Greedy Geographic Routing using Dynamic Potential Field for Wireless Ad Hoc Networks

Greedy Geographic Routing using Dynamic Potential Field for Wireless Ad Hoc Networks

Greedy geographic routing has been considered as an attractive approach due to its simplicity and scalability. However, greedy routing is insufficient in terms of routing convergence because of the local maximum problem. In this letter, we propose a novel greedy routing scheme based on a potential f...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE communications letters 2007-03, Vol.11 (3), p.243-245
Hauptverfasser: Jongkeun Na, Soroker, D., Chong-kwon Kim
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Cities and towns
Computer networks
Convergence
Dynamics
Exact sciences and technology
Large-scale systems
Mobile ad hoc networks
Network topology
Networks
Planarization
Potential fields
Robot kinematics
Routing
Routing (telecommunications)
Scalability
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Transmission and modulation (techniques and equipments)
Wireless networks
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Greedy geographic routing has been considered as an attractive approach due to its simplicity and scalability. However, greedy routing is insufficient in terms of routing convergence because of the local maximum problem. In this letter, we propose a novel greedy routing scheme based on a potential field method that dynamically eliminates the local maximum condition
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2007.061612