Leo Liberti, James Ostrowski
Journal of Global Optimization
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.
Leo Liberti, James Ostrowski
Journal of Global Optimization
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
Lixi Zhou, Jiaqing Chen, et al.
VLDB
Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory