DocumentCode :
651943
Title :
Fine-Grained Landmark Based Greedy Geographic Routing with Guaranteed Delivery Under Uncertain Locations
Author :
Xiaopei Lu ; Dezun Dong ; Xiangke Liao
Author_Institution :
Coll. of Comput. Sci., Nat. Univ. of Defense Technol., Changsha, China
fYear :
2013
fDate :
14-16 Oct. 2013
Firstpage :
413
Lastpage :
414
Abstract :
This poster presents a hierarchical greedy geographic routing scheme in wireless networks, which performs greedy geographic routing with guaranteed delivery under uncertain locations on a landmark graph by leveraging a fine-grained connectivity-based planarization algorithm. This design neither depends on exact node locations, nor needs to store any global state information in each node. The algorithm works in a completely localized fashion, and the additional storage and computation complexity is extremely low. Our simulations demonstrate that the routing scheme is able to produce route paths with lower stretch factors and more load-balancing property than the state-of-the-art methods.
Keywords :
computational complexity; graph theory; greedy algorithms; planarisation; radio networks; telecommunication network routing; computation complexity; fine-grained connectivity-based planarization algorithm; fine-grained landmark graph; global state information; greedy geographic routing scheme; guaranteed delivery; load-balancing property; wireless network; Mobile computing; Planarization; Robustness; Routing; Routing protocols; Tiles; Wireless networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Mobile Ad-Hoc and Sensor Systems (MASS), 2013 IEEE 10th International Conference on
Conference_Location :
Hangzhou
Type :
conf
DOI :
10.1109/MASS.2013.77
Filename :
6680269
Link To Document :
بازگشت