DocumentCode :
3624975
Title :
Guaranteed-Delivery Geographic Routing Under Uncertain Node Locations
Author :
S. Funke;N. Milosavljevic
Author_Institution :
Max-Planck-Inst. fur Inf., Saarbrucken
fYear :
2007
fDate :
5/1/2007 12:00:00 AM
Firstpage :
1244
Lastpage :
1252
Abstract :
Geographic routing protocols like GOAFR or GPSR rely on exact location information at the nodes, as when the greedy routing phase gets stuck at a local minimum, they require, as a fallback, a planar subgraph whose identification, in all existing methods, depends on exact node positions. In practice, however, location information at the network nodes is hardly precise; be it because the employed location hardware, such as GPS, exhibits an inherent measurement imprecision, or because the localization protocols which estimate positions of the network nodes cannot do so without errors. In this paper we propose a novel naming and routing scheme that can handle the uncertainty in location information. It is based on a macroscopic variant of geographic greedy routing, as well as a macroscopic planarization of the communication graph. If an upper bound on the deviation from true node locations is available, our routing protocol guarantees delivery of messages. Due to its macroscopic view, our routing scheme also produces shorter and more load-balanced paths than common geographic routing schemes, in particular in sparsely connected networks or in the presence of obstacles.
Keywords :
"Peer to peer computing","Wireless sensor networks","Routing protocols","Global Positioning System","Planarization","Communications Society","Computer science","Hardware","Position measurement","Upper bound"
Publisher :
ieee
Conference_Titel :
INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE
ISSN :
0743-166X
Print_ISBN :
1-4244-1047-9
Type :
conf
DOI :
10.1109/INFCOM.2007.148
Filename :
4215730
Link To Document :
بازگشت