On Alarm Protocol in Wireless Sensor Networks

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 show 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. Keywords. wireless sensor network, radio channel, alarm protocol, leader election

• Type: Conference
• Year: 2010
• Where: ADHOCNOW
• Authors: Jacek Cichon, Rafal Kapelko, Jakub Lemiesz, Marcin Zawada
• Keywords: ADHOCNOW 2010, Alarm Protocol, Computer Networks, Efficient Alarm Protocol, Time Slots