415 search results - page 52 / 83 » Reactive routing overhead in networks with unreliable nodes |
116
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
115
click to vote
TPDS
1998
15 years 1 months ago
1998
—Unicast_V is a progressive, misrouting algorithm for packet or virtual cut-through networks. A progressive protocol forwards a message at an intermediate node if a nonfaulty pro...
104
click to vote
MOBIHOC
2008
ACM
16 years 1 months ago
2008
ACM
Ad hoc networks formed by traveling vehicles are envisaged to become a common platform that will support a wide variety of applications, ranging from road safety to advertising an...
127
click to vote
PIMRC
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract-- Due to the limited energy supplies of nodes in wireless networks, achieving energy efficiency is crucial for extending the lifetime of these networks. Thus, we study eff...
111
click to vote
ISCC
2005
IEEE
15 years 7 months ago
2005
IEEE
We propose routing schemes that optimize the average number of hops for lookup requests in Peer–to–Peer (P2P) systems without adding any overhead to the system. Our work is in...