Efficient Greedy Geographical Non-Planar Routing with Reactive Deflection - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2010

Efficient Greedy Geographical Non-Planar Routing with Reactive Deflection

(1) , (1) , (1)
1
Fabrice Theoleyre
Eryk Schiller
  • Function : Author
  • PersonId : 909294
Andrzej Duda

Abstract

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.
Fichier principal
Vignette du fichier
RR-LIG-003.pdf (17.72 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01073422 , version 1 (30-09-2015)

Identifiers

  • HAL Id : hal-01073422 , version 1

Cite

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⟩
67 View
35 Download

Share

Gmail Facebook Twitter LinkedIn More