Energy efficient alert in single-hop networks of extremely weak devices

We present an alert algorithm for single-hop radio networks with polylogarithmic time complexity and sublogarithmic energy complexity. Our algorithm works correctly with high probability regardless of the number of stations that try to broadcast an alert signal. Moreover, we show that it can be made...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science 2012-09, Vol.453, p.65-74
Main Authors: Klonowski, M., Kutyłowski, M., Zatopiański, J.
Format: Article
Language:English
Subjects:
Ad hoc network
Alert algorithm
Sensor network
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present an alert algorithm for single-hop radio networks with polylogarithmic time complexity and sublogarithmic energy complexity. Our algorithm works correctly with high probability regardless of the number of stations that try to broadcast an alert signal. Moreover, we show that it can be made fairly robust against node failures. We show a lower bound for energy cost that matches the energy cost of our algorithm. Our solution has very weak computing, communication and storage requirements. Moreover the behavior of almost all devices is almost oblivious. Therefore, the algorithm can be applied for a system containing extremely weak devices.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2012.01.044