论文信息 - Adaptive algorithms to mitigate inefficiency in greedy geographical routing

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.

Hong Huang

[1] Brad Karp,et al. GPSR : Greedy Perimeter Stateless Routing for Wireless , 2000, MobiCom 2000.

[2] Hong Huang. Adaptive geographical routing in wireless ad-hoc networks , 2004, IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall. 2004.

[3] Martin Mauve,et al. A survey on position-based routing in mobile ad hoc networks , 2001, IEEE Netw..

[4] Deborah Estrin,et al. GPS-less low-cost outdoor localization for very small devices , 2000, IEEE Wirel. Commun..

[5] Srdjan Capkun,et al. Self-organization in mobile ad hoc networks: the approach of Terminodes , 2001, IEEE Commun. Mag..