Skip to Main content Skip to Navigation

Efficient Greedy Geographical Non-Planar Routing with Reactive Deflection

Fabrice Theoleyre 1 Eryk Schiller 1 Andrzej Duda 1
1 Drakkar
LIG - Laboratoire d'Informatique de Grenoble
Résumé : We present a novel geographical routing scheme for spontaneous wireless mesh networks. Greedy geographical routing has many advantages, but suffers from packet losses occurring at the border of voids. In this paper, we propose a flexible greedy routing scheme that can be adapted to any variant of geographical rout- ing and works for any connectivity graph, not necessarily Unit Disk Graphs. The idea is to reactively detect voids, backtrack packets, and propagate information on blocked sectors to reduce packet loss. We also propose an extrapolating algorithm to reduce the latency of void discovery and to limit route stretch. Performance evaluation via simulation shows that our modified greedy routing avoids most of packet losses.
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Gilles Berger Sabbatel Connect in order to contact the contributor
Submitted on : Wednesday, September 30, 2015 - 9:46:04 AM
Last modification on : Thursday, October 21, 2021 - 3:49:45 AM
Long-term archiving on: : Thursday, December 31, 2015 - 10:10:45 AM


Files produced by the author(s)


  • HAL Id : hal-01073422, version 1


Fabrice Theoleyre, Eryk Schiller, Andrzej Duda. Efficient Greedy Geographical Non-Planar Routing with Reactive Deflection. [Research Report] RR-LIG-003, Laboratoire d'informatique de Grenoble. 2010. ⟨hal-01073422⟩



Les métriques sont temporairement indisponibles