15 search results - page 1 / 3 » Void Traversal for Guaranteed Delivery in Geometric Routing |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorith...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract-- Stateless geographic routing provides relatively good performance at a fixed overhead, which is typically much lower than conventional routing protocols such as AODV. Ho...
OPODIS
2008
13 years 6 months ago
2008
We present a concurrent face routing CFR algorithm. We formally prove that the worst case latency of our algorithm is asymptotically optimal. Our simulation results demonstrate tha...
MOBICOM
2006
ACM
13 years 11 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...
INFOCOM
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract—Because the global positioning system (GPS) consumes a large amount of power and does not work indoors, many virtual-coordinate-based routing protocols are proposed for ...