Raymond F. Boyce, Donald D. Chamberlin, et al.
CACM
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.
Raymond F. Boyce, Donald D. Chamberlin, et al.
CACM
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001
Arun Viswanathan, Nancy Feldman, et al.
IEEE Communications Magazine
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996