Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Deterministic Recurr ...
Article

Deterministic Recurrent Communication and Synchronization in Restricted Sensor Network

Antonio Fernández Anta (1), Miguel Mosteiro (2) (3), Christopher Thraves-Caro
(1) Institute IMDEA Networks [Madrid]
(2) Laboratorio de Algoritmia Distribuida y Redes
(3) Department of Computer Science [Camden]
Download article
Open on HAL
Imported on
September 23, 2010
Published on
April 21, 2011
Last modified on
March 31, 2025
Volume 13
vol. 13:1
Distributed Computing and Networking
DOI
10.46298/dmtcs.528
License
https://about.hal.science/hal-authorisation-v1
HECURA: Colaborative: Multidimensional and String Indexes for Streaming Data
Indicators
1110
Views
1107
Downloads

Deterministic Recurrent Communication and Synchronization in Restricted Sensor Network

Antonio Fernández Anta (1), Miguel Mosteiro (2) (3), Christopher Thraves-Caro
(1) Institute IMDEA Networks [Madrid]
(2) Laboratorio de Algoritmia Distribuida y Redes
(3) Department of Computer Science [Camden]
Abstract
Monitoring physical phenomena in Sensor Networks requires guaranteeing permanent communication between nodes. Moreover, in an effective implementation of such infrastructure, the delay between any two consecutive communications should be minimized. The problem is challenging because, in a restricted Sensor Network, the communication is carried out through a single and shared radio channel without collision detection. Dealing with collisions is crucial to ensure effective communication between nodes. Additionally, minimizing them yields energy consumption minimization, given that sensing and computational costs in terms of energy are negligible with respect to radio communication. In this work, we present a deterministic recurrent-communication protocol for Sensor Networks. After an initial negotiation phase of the access pattern to the channel, each node running this protocol reaches a steady state, which is asymptotically optimal in terms of energy and time efficiency. As a by-product, a protocol for the synchronization of a Sensor Network is also proposed. Furthermore, the protocols are resilient to an arbitrary node power-up schedule and a general node failure model.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Preview
Loading PDF preview...