Title :
Greedy Geographic Routing using Dynamic Potential Field for Wireless Ad Hoc Networks
Author :
Na, Jongkeun ; Soroker, Danny ; Kim, Chong-Kwon
Author_Institution :
Sch. of Comput. Sci. & Eng., Seoul Nat. Univ.
fDate :
3/1/2007 12:00:00 AM
Abstract :
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
Keywords :
ad hoc networks; greedy algorithms; telecommunication network reliability; telecommunication network routing; greedy geographic routing; potential field method; scalability; wireless ad hoc network; Cities and towns; Convergence; Large-scale systems; Mobile ad hoc networks; Network topology; Planarization; Robot kinematics; Routing; Scalability; Wireless networks;
Journal_Title :
Communications Letters, IEEE
DOI :
10.1109/LCOMM.2007.061612
