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(logn) time slots and show that Ω(logn/loglogn) is a lower bound for used time slots. © 2010 Springer-Verlag.
CITATION STYLE
Cichoń, J., Kapelko, R., Lemiesz, J., & Zawada, M. (2010). On alarm protocol in wireless sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6288 LNCS, pp. 43–52). https://doi.org/10.1007/978-3-642-14785-2_4
Mendeley helps you to discover research relevant for your work.