Routing in Wireless Networks with Position Trees - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Routing in Wireless Networks with Position Trees

Résumé

Sensor networks are wireless adhoc networks where all the nodes cooperate for routing messages in the absence of a fixed infrastructure. Non-flooding, guaranteed delivery routing protocols are preferred because sensor networks have limited battery life. Location aware routing protocols are good candidates for sensor network applications, nevertheless they need either an external location service like GPS or Galileo (which are bulky, energy consuming devices) or internal location services providing non-unique virtual coordinates leading to low delivery rates. In this paper we introduce {\em Position Trees} a collision free, distributed labeling algorithm based on hop counting, which embed a spanning tree of the underlying network . The Routing with Position Trees (RTP) is a guaranteed delivery, non-flooding, efficient implicit routing protocol based on Position Trees. We study experimentally the statistical properties of memory requirements and the routing efficiency of the RPT.
Fichier principal
Vignette du fichier
adhocnow.pdf (148.37 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00384015 , version 1 (14-05-2009)

Identifiants

  • HAL Id : hal-00384015 , version 1

Citer

Edgar Chavez, Nathalie Mitton, Hector Tejeda. Routing in Wireless Networks with Position Trees. ADHOC-NOW, Sep 2007, France. pp.32-47. ⟨hal-00384015⟩
147 Consultations
359 Téléchargements

Partager

Gmail Facebook X LinkedIn More