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.
Type de document :
Pré-publication, Document de travail
2009
Liste complète des métadonnées

Littérature citée [17 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00363811
Contributeur : Fabrice Theoleyre <>
Soumis le : mardi 24 février 2009 - 14:57:03
Dernière modification le : jeudi 11 janvier 2018 - 06:21:05
Document(s) archivé(s) le : mardi 8 juin 2010 - 21:05:48

Fichiers

geo_routing_rr.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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

Collections

Citation

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

Partager

Métriques

Consultations de la notice

302

Téléchargements de fichiers

157