Minimizing recovery state in geographic ad hoc routing

Noa Arad*, Yuval Shavitt

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


Geographic ad hoc networks use position information for routing. They often utilize stateless greedy forwarding and require the use of recovery algorithms when the greedy approach fails. We propose a novel idea based on virtual repositioning of nodes that allows to increase the efficiency of greedy routing and significantly increase the success of the recovery algorithm based on local information alone. We explain the problem of predicting dead ends, which the greedy algorithm may reach and bypassing voids in the network, and introduce Node Elevation Ad hoc Routing (NEAR), a solution that incorporates both virtual positioning and routing algorithms that improve performance in ad hoc networks containing voids. We demonstrate by simulations the advantages of our algorithm over other geographic ad hoc routing solutions.

Original languageEnglish
Article number04538226
Pages (from-to)203-217
Number of pages15
JournalIEEE Transactions on Mobile Computing
Issue number2
StatePublished - Feb 2009


  • Ad hoc
  • Distributed
  • Elevation
  • Repositioning
  • Routing


Dive into the research topics of 'Minimizing recovery state in geographic ad hoc routing'. Together they form a unique fingerprint.

Cite this