Design and performance of wireless data gathering networks based on unicast random walk routing - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue IEEE/ACM Transactions on Networking Année : 2009

Design and performance of wireless data gathering networks based on unicast random walk routing

Résumé

Wireless environment monitoring applications with significantly relaxed quality-of-service constraints are emerging. Hence, the possibility to use rough low knowledge routing in sensor networks to reduce hardware resource and software complexity is questionable. Moreover, low lnowledge handling allows better genericity, which is of interest, for instance, for basic operation enabling system set-up. In this framework, this paper revisits stateless unicast random walk routing in wireless sensor networks. Based on random walk theory, original closed-form expressions of the delay, the power consumption and related spatial behaviors are provided according to the scale of the system. Basic properties of such a random routing are discussed. Exploiting its properties, data gathering schemes that fulfill the requirements of the application with rather good energy efficiency are then identified
Fichier principal
Vignette du fichier
Froc2009.pdf (330.84 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-02141169 , version 1 (30-03-2022)

Licence

Paternité - Pas d'utilisation commerciale

Identifiants

Citer

Gwillerm Froc, Issam Mabrouki, Xavier Lagrange. Design and performance of wireless data gathering networks based on unicast random walk routing. IEEE/ACM Transactions on Networking, 2009, 17 (4), pp.1214-1227. ⟨10.1109/TNET.2008.2006223⟩. ⟨hal-02141169⟩
42 Consultations
16 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More