Greedy geographic routing using dynamic potential field for wireless ad hoc networks

IEEE Communications Letters

Volumn 11, Issue 3, 2007, Pages 243-245

  Na, Jongkeun ^a   Soroker, Danny ^b   Kim, Chong Kwon ^a  

^a Seoul National University   (South Korea)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Geographic routing; Greedy routing; Potential field

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; MULTICASTING; ROUTING ALGORITHMS; SCALABILITY;

GEOGRAPHIC ROUTING; GREEDY ROUTING; POTENTIAL FIELD;

AD HOC NETWORKS;

EID: 34147123057     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2007.061612     Document Type: Article

References (4)

1. C. E. Perkins, Ad Hoc Networking. Addison Wesley Professional, 2001.
2. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, "Routing with guaranteed delivery in ad hoc wireless networks," in Proc. Third Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications 1999, pages 48-55.
3. B. Karp and H. Kung, "GPSR: Greedy perimeter stateless routing for wireless networks," in Proc. Sixth Annual ACM/IEEE International Conference on Mobile Computing and Networking (Mobicom 2000).
4. Y. Koren and J. Borenstein, "Potential field methods and their inherent limitations for mobile robot navigation," in Proc. IEEE Conference on Robotics and Automation 1991, pp. 1398-1404.