Energy Efficient Alert in Single-Hop Networks of Extremely Weak Devices

Authors:
Marek Klonowski;Miroslaw Kutyłowski;Jan Zatopiański
Affiliations:
Institute of Mathematics and Computer Science, Wrocław University of Technology,;Institute of Mathematics and Computer Science, Wrocław University of Technology,;Institute of Mathematics and Computer Science, Wrocław University of Technology,
Venue:
Algorithmic Aspects of Wireless Sensor Networks
Year:
2009

Citing 0
Cited 3

On alarm protocol in wireless sensor networks

ADHOC-NOW'10 Proceedings of the 9th international conference on Ad-hoc, mobile and wireless networks
Monitoring churn in wireless networks

ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Time-optimal information exchange on multiple channels

FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

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 independently of the number of sensors 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 and therefore can be applied for a system containing extremely weak devices.