Deterministic Recurrent Communication in Restricted Sensor Networks

Abstract : In Sensor Networks, the lack of topology information and the availability of only one communication channel has led research work to the use of randomization to deal with collisions of transmissions. However, the scarcest resource in this setting is the energy supply, and radio communication dominates the sensor node energy consumption. Hence, redundant trials of transmission as used in randomized protocols may be counter-effective. Additionally, most of the research work in Sensor Networks is either heuristic or includes unrealistic assumptions. Hence, provable results for many basic problems still remain to be given. In this paper, we study upper and lower bounds for deterministic communication primitives under the harsh constraints of sensor nodes.
Liste complète des métadonnées

Littérature citée [24 références]  Voir  Masquer  Télécharger
Contributeur : Chrsitopher Thraves Caro <>
Soumis le : mercredi 26 mai 2010 - 12:44:05
Dernière modification le : vendredi 16 novembre 2018 - 01:38:46
Document(s) archivé(s) le : jeudi 1 décembre 2016 - 14:39:58


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00486270, version 2


Antonio Fernández Anta, Miguel Mosteiro, Christopher Thraves-Caro. Deterministic Recurrent Communication in Restricted Sensor Networks. [Research Report] 2010. 〈inria-00486270v2〉



Consultations de la notice


Téléchargements de fichiers