DocumentCode
1065327
Title
An Algorithmic Approach to Geographic Routing in Ad Hoc and Sensor Networks
Author
Kuhn, Fabian ; Wattenhofer, R. ; Zollinger, Aaron
Author_Institution
Microsoft Res., Mountain View
Volume
16
Issue
1
fYear
2008
Firstpage
51
Lastpage
62
Abstract
The one type of routing in ad hoc and sensor networks that currently appears to be most amenable to algorithmic analysis is geographic routing. This paper contains an introduction to the problem field of geographic routing, presents a specific routing algorithm based on a synthesis of the greedy forwarding and face routing approaches, and provides an algorithmic analysis of the presented algorithm from both a worst-case and an average-case perspective.
Keywords
ad hoc networks; computational complexity; graph theory; routing protocols; wireless sensor networks; geographic routing algorithm; greedy forwarding-face routing approach; lower bound graph; routing protocols; wireless ad hoc networks; wireless sensor networks; Algorithmic analysis; routing; stretch; wireless networks;
fLanguage
English
Journal_Title
Networking, IEEE/ACM Transactions on
Publisher
ieee
ISSN
1063-6692
Type
jour
DOI
10.1109/TNET.2007.900372
Filename
4448977
Link To Document