198 search results - page 17 / 40 » A practical algorithm for constructing oblivious routing sch... |
94
Voted
INFOCOM
2009
IEEE
15 years 6 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...
MOBICOM
2005
ACM
15 years 5 months ago
2005
ACM
One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consider...
COMCOM
2007
14 years 11 months ago
2007
The network topology changes frequently in ad-hoc networks. Some on-demand protocols with multi-paths or backup routes have been proposed to improve the performance in ad-hoc netw...
MOBICOM
2006
ACM
15 years 5 months ago
2006
ACM
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this...
ICCCN
2007
IEEE
15 years 6 months ago
2007
IEEE
— The scalability of Internet addressing and routing has been a serious issue and becomes a more urgent problem today because of driving factors like IPv6. A radical impacting el...