On alarm protocol in wireless sensor networks

Authors:
Jacek Cichoń;Rafał Kapelko;Jakub Lemiesz;Marcin Zawada
Affiliations:
Institute of Mathematics and Computer Science, Wrocław University of Technology, Poland;Institute of Mathematics and Computer Science, Wrocław University of Technology, Poland;Institute of Mathematics and Computer Science, Wrocław University of Technology, Poland;Institute of Mathematics and Computer Science, Wrocław University of Technology, Poland
Venue:
ADHOC-NOW'10 Proceedings of the 9th international conference on Ad-hoc, mobile and wireless networks
Year:
2010

Citing 10
Cited 1

The Wakeup Problem in Synchronous Broadcast Systems

SIAM Journal on Discrete Mathematics
Uniform Leader Election Protocols in Radio Networks

ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
Randomized Leader Election Protocols in Radio Networks with No Collision Detection

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
A Survey on Leader Election Protocols for Radio Networks

ISPAN '02 Proceedings of the 2002 International Symposium on Parallel Architectures, Algorithms and Networks
On the power assignment problem in radio networks

Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Energy Efficient Alert in Single-Hop Networks of Extremely Weak Devices

Algorithmic Aspects of Wireless Sensor Networks
Analysis of the bounded-hops converge-cast distributed protocol in ad-hoc networks

ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
A distributed protocol for the bounded-hops converge-cast in ad-hoc networks

ADHOC-NOW'06 Proceedings of the 5th international conference on Ad-Hoc, Mobile, and Wireless Networks
Divide and conquer is almost optimal for the bounded-hop MST problem on random euclidean instances

SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity

On cardinality estimation protocols for wireless sensor networks

ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of efficient alarm protocol for ad-hoc radio networks consisting of devices that try to gain access for transmission through a shared radio communication channel. The problem arise in tasks that sensors have to quickly inform the target user about an alert situation such as presence of fire, dangerous radiation, seismic vibrations, and more. In this paper, we present a protocol which uses O(log n) time slots and show that Ω(log n/ log log n) is a lower bound for used time slots.