Efficient Greedy Geographical Non-Planar Routing with Reactive Deflection - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Efficient Greedy Geographical Non-Planar Routing with Reactive Deflection

Eryk Schiller
  • Function : Author
  • PersonId : 858353
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 routing 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
geo_routing_rr.pdf (305.68 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00363811 , version 1 (24-02-2009)

Identifiers

Cite

Fabrice Theoleyre, Eryk Schiller, Andrzej Duda. Efficient Greedy Geographical Non-Planar Routing with Reactive Deflection. 2009. ⟨hal-00363811⟩
160 View
111 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More