Paper Info
Title
Scalable geographic routing algorithms for wireless ad hoc networks
Abstract
The design of efficient routing protocols for dynamical changing network topologies is a crucial part of building power-efficient and scalable ad hoc wireless networks. If position information is available due to GPS or some kind of relative positioning technique, a promising approach is given by geographic routing algorithms, where each forwarding decision is based on the positions of current, destination, and possible candidate nodes in vicinity only. About 15 years ago heuristic greedy algorithms were proposed, which in order to provide freedom from loops might fail even if there is a path from source to destination. In recent years planar graph traversal has been investigated as one possible strategy to recover from such greedy routing failures. This article provides a tutorial for this class of geographic routing algorithms, and discusses recent improvements to both greedy forwarding and routing in planar graphs.
Year
DOI
Venue
2004
10.1109/MNET.2004.1316756
IEEE Network
Keywords
Field
DocType
Routing,Ad hoc networks,Global Positioning System,Wireless sensor networks,Collaboration,Mobile ad hoc networks,Wireless application protocol,Ear,Greedy algorithms,Wireless communication
Link-state routing protocol,Equal-cost multi-path routing,Dynamic Source Routing,Computer science,Static routing,Computer network,Destination-Sequenced Distance Vector routing,Algorithm,Wireless Routing Protocol,Optimized Link State Routing Protocol,Geographic routing,Distributed computing
Journal
Volume
Issue
ISSN
18
4
0890-8044
Citations 
PageRank 
References 
27
5.44
6
Authors
1
Name
Order
Citations
PageRank
Hannes Frey1587.40