61 search results - page 2 / 13 » Stability of a localized and greedy routing algorithm |
MOBIHOC
2010
ACM
13 years 3 months ago
2010
ACM
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
MOBICOM
2000
ACM
13 years 10 months ago
2000
ACM
We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet’s destination to ma...
MOBIHOC
2006
ACM
14 years 5 months ago
2006
ACM
Geographic ad hoc networks use position information for routing. They often utilize stateless greedy forwarding and require the use of recovery algorithms when the greedy approach...
ICNP
2005
IEEE
13 years 11 months ago
2005
IEEE
The recent discovery of instability caused by the interaction of local routing policies of multiple ASes has led to extensive research on the subject. However, previous studies an...
CCR
2005
13 years 5 months ago
2005
Dynamic multi-path routing has the potential to improve the reliability and performance of a communication network, but carries a risk. Routing needs to respond quickly to achieve...