Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Efficient Greedy Geographical Non-Planar Routing with Reactive Deflection

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.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00363811
Contributor : Fabrice Theoleyre <>
Submitted on : Tuesday, February 24, 2009 - 2:57:03 PM
Last modification on : Friday, July 17, 2020 - 11:10:21 AM
Long-term archiving on: : Tuesday, June 8, 2010 - 9:05:48 PM

Files

geo_routing_rr.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00363811, version 1
  • ARXIV : 0902.4157

Collections

CNRS | LIG | UGA

Citation

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

Share

Metrics

Record views

372

Files downloads

321