Scalable geographic routing algorithms for wireless ad hoc networks

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 ge...

Full description

Saved in:
Bibliographic Details
Published in:IEEE network 2004-07, Vol.18 (4), p.18-22
Main Author: Frey, H.
Format: Article
Language:English
Subjects:
Ad hoc networks
Algorithms
Collaboration
Computer networks
Design
Ear
Global Positioning System
Graphs
Greedy algorithms
Mobile ad hoc networks
Networks
Protocol
Routing
Routing (telecommunications)
Satellite navigation systems
Strategy
Wireless application protocol
Wireless communication
Wireless networks
Wireless sensor networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0890-8044
1558-156X
DOI:10.1109/MNET.2004.1316756