Skip to Main content Skip to Navigation
Reports

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.
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/inria-00486270
Contributor : Chrsitopher Thraves Caro <>
Submitted on : Wednesday, May 26, 2010 - 12:44:05 PM
Last modification on : Tuesday, June 15, 2021 - 4:14:10 PM
Long-term archiving on: : Thursday, December 1, 2016 - 2:39:58 PM

File

Research-reaport.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00486270, version 2

Citation

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

Share

Metrics

Record views

368

Files downloads

493