Geographic Routing

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 chapter contains an introduction to the problem field of geographic routing, presents a specific routing algorithm based on a synthesis of the greedy f...

Full description

Saved in:
Bibliographic Details
Published inAlgorithms for Sensor and Ad Hoc Networks Vol. 4621; pp. 161 - 185
Main Author Zollinger, Aaron
Format Book Chapter
LanguageEnglish
Published Germany Springer Berlin / Heidelberg 2007
Springer Berlin Heidelberg
SeriesLecture Notes in Computer Science
Subjects
Algorithms & data structures
Network hardware
Network Node
Node Mobility
Optimal Path
Optimal Route
Short Path
Software Engineering
Online AccessGet full text
ISBN354074990X
9783540749905
ISSN0302-9743
1611-3349
DOI10.1007/978-3-540-74991-2_9

Cover

More Information
Summary: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 chapter 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.
ISBN:354074990X
9783540749905
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-540-74991-2_9