2076 search results - page 4 / 416 » Universal Routing in Distributed Networks |
EURONGI
2006
Springer
13 years 11 months ago
2006
Springer
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—We propose a generic routing table design principle for scalable routing on networks with bounded geometric growth. Given an inaccurate distance oracle that estimates the graph ...
INFOCOM
1999
IEEE
13 years 11 months ago
1999
IEEE
Abstract--CEDAR is an algorithm for QoS routing in ad hoc network environments. It has three key components: (a) the establishment and maintenance of a self-organizing routing infr...
JUCS
2006
13 years 7 months ago
2006
Abstract: Multiple hop routing in mobile ad hoc networks can minimize energy consumption and increase data throughput. Yet, the problem of radio interferences remain. However if th...
MOBICOM
2003
ACM
14 years 21 days ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...