460 search results - page 4 / 92 » Bounding the locality of distributed routing algorithms |
SENSYS
2003
ACM
15 years 2 months ago
2003
ACM
In the absence of location errors, geographic routing - using a combination of greedy forwarding and face routing - has been shown to work correctly and efficiently. The effects o...
SPAA
2006
ACM
15 years 3 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
SPAA
2003
ACM
15 years 2 months ago
2003
ACM
An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any fixed infrastructure. Indeed, an important task of an ad hoc network...
PDCAT
2005
Springer
15 years 3 months ago
2005
Springer
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
PODC
2005
ACM
15 years 3 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...