Adaptive algorithms to mitigate inefficiency in greedy geographical routing

摘要

This letter presents theoretical basis and practical algorithms for mitigating inefficiency in greedy geographical routing, which has great application potential in large scale ad hoc networks, such as sensor nets. Simulation results demonstrate the proposed algorithms' effectiveness and the capability to provide different efficiency-overhead tradeoffs.