260 search results - page 15 / 52 » Geographical Routing in Intermittently Connected Ad Hoc Netw... |
IPCCC
2007
IEEE
14 years 3 months ago
2007
IEEE
In a MANET network where nodes move frequently, the probability of connectivity loss between nodes might be high, and communication sessions may easily loose connectivity during t...
JNW
2007
13 years 8 months ago
2007
— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk grap...
INFOCOM
2000
IEEE
14 years 1 months ago
2000
IEEE
Ad hoc networks are characterized by multihop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols. We compare the perf...
TMC
2008
13 years 8 months ago
2008
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
ADHOC
2007
13 years 9 months ago
2007
We present a self-healing On-demand Geographic Path Routing Protocol (OGPR) for mobile ad-hoc networks. OGPR is an efficient, stateless, and scalable routing protocol that inherit...