Lower and upper bounds for minimum energy broadcast and sensing problems in sensor networks

Guillaume Chelius 1 Eric Fleury 1, 2 Thierry Mignon 3
1 ARES - Architectures of networks of services
Inria Grenoble - Rhône-Alpes, CITI - CITI Centre of Innovation in Telecommunications and Integration of services
2 LIP - Laboratoire de l'Informatique du Parallélisme
3 GETODIM - Laboratoire de Géométrie, Topologie et Algèbre
Abstract : In this article, we study the problem of assigning transmission ranges to the nodes of a wireless sensor network so as to minimize the global power consumption while ensuring a broadcast task. A first novelty is that our model takes into account both the transmission and the reception costs when evaluating the energy consumption. We establish a new analytical model and derive lower and upper bounds on region covering. Moreover, we show that the lower bound is asymptotically optimal and can be approached up to ε.
Type de document :
Article dans une revue
International Journal of Parallel, Emergent and Distributed Systems, Taylor & Francis, 2006, 21 (6), pp.405-422
Liste complète des métadonnées
https://hal.inria.fr/inria-00396212
Contributeur : Guillaume Chelius <>
Soumis le : mercredi 17 juin 2009 - 11:07:45
Dernière modification le : vendredi 20 avril 2018 - 15:44:24

Identifiants

  • HAL Id : inria-00396212, version 1

Collections

INRIA | LIP | ENS-LYON | INSA-LYON | UNIV-LYON1 | INRIA-RENGRE

Citation

Guillaume Chelius, Eric Fleury, Thierry Mignon. Lower and upper bounds for minimum energy broadcast and sensing problems in sensor networks. International Journal of Parallel, Emergent and Distributed Systems, Taylor & Francis, 2006, 21 (6), pp.405-422. 〈inria-00396212〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

135

Contact


archive-ouverte@inria.fr