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(logn) time slots and show that Ω(logn/loglogn) is a lower bound for used time slots.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alfandari, L., Paschos, V.: Approximating minimum spanning tree of depth 2. International Transactions in Operational Research 6, 607–622 (1999)
Clementi, A.E.F., Ianni, M.D., Monti, A., Rossi, G., SilvestriL, R.: Divide and conquer is almost optimal for the bounded-hop accumulation in ad hoc wireless networks. In: The Proceedings of SIROCCO (2005)
Clementi, A.E.F., Penna, M.D., Silvestri, R.: On the power assignment problem in radio networks. In: Mobile Networks and Applications, MONET (2004)
Clementi, A.E.F., Ianni, M.D., Lauria, M., Monti, A., Rossi, G., Silvestri, R.: A distributed protocol for the bounded-hops converge-cast in ad-hoc networks. In: The Proceedings of the 5th International Conference on AD-HOC Networks & Wireless (2006)
Zawada, M.: Analysis of the bounded-hops converge-cast distributed protocol in ad-hoc networks. In: The Proceedings of the 3nd International Workshop on Algorithmic Aspect of Wireless Sensor Networks (2007)
Nakano, K., Olariu, S.: Randomized leader election protocols in radio networks with no collision detection. In: ISAAC, pp. 362–373 (2000)
Nakano, K., Olariu, S.: Uniform leader election protocols in radio networks. In: ICPP, pp. 240–250 (2001)
Nakano, K., Olariu, S.: A survey on leader election protocols for radio networks. In: ISPAN 2002: Proceedings of the 2002 International Symposium on Parallel Architectures, Algorithms and Networks, Washington, DC, USA, p. 71. IEEE Computer Society, Los Alamitos (2002)
Gasieniec, L., Pelc, A., Peleg, D.: The wakeup problem in synchronous broadcast systems. SIAM J. Discrete Math. 14, 207–222 (2001)
Jurdzinski, T., Stachowiak, G.: Probabilistic algorithms for the wakeup problem in single-hop radio networks. In: ISAAC, pp. 535–549 (2002)
Klonowski, M., Kutylowski, M., Zatopianski, J.: Energy efficient alert in single-hop networks of extremely weak devices. In: Algosensors (2009)
Hoorfar, A., Hassiani, M.: Inequalities on the lambert w function and hyperpower function. Journal of Inequalities in Pure and Applied Mathematisc 9(51) (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cichoń, J., Kapelko, R., Lemiesz, J., Zawada, M. (2010). On Alarm Protocol in Wireless Sensor Networks. In: Nikolaidis, I., Wu, K. (eds) Ad-Hoc, Mobile and Wireless Networks. ADHOC-NOW 2010. Lecture Notes in Computer Science, vol 6288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14785-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-14785-2_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14784-5
Online ISBN: 978-3-642-14785-2
eBook Packages: Computer ScienceComputer Science (R0)