J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
Paper
Greedy geographic routing using dynamic potential field for wireless ad hoc networks
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. © 2007 IEEE.
Related
Reena Elangovan, Shubham Jain, et al.
ACM TODAES
Nanda Kambhatla
ACL 2004
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990