Abstract
Monitoring physical phenomena in Sensor Networks requires guaranteeing permanent communication between nodes. Moreover, in an effective implementation of such infrastructure, the delay between any two consecutive communications should be minimized. The problem is challenging because, in a restricted Sensor Network, the communication is carried out through a single and shared radio channel without collision detection. Dealing with collisions is crucial to ensure effective communication between nodes. Additionally, minimizing them yields energy consumption minimization, given that sensing and computational costs in terms of energy are negligible with respect to radio communication. In this work, we present a deterministic recurrent-communication protocol for Sensor Networks. After an initial negotiation phase of the access pattern to the channel, each node running this protocol reaches a steady state, which is asymptotically optimal in terms of energy and time efficiency. As a by-product, a protocol for the synchronization of a Sensor Network is also proposed. Furthermore, the protocols are resilient to an arbitrary node power-up schedule and a general node failure model.
This research was partially supported by Spanish MICINN grant no. TIN2008-06735-C02-01, Comunidad de Madrid grant no. S2009TIC-1692, EU Marie Curie International Reintegration Grant IRG 210021, NSF grant no. 0937829, and French ANR project Shaman.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: Single round simulation in radio networks. J. Algorithms 13, 188–210 (1992)
Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. JCSS 45, 104–126 (1992)
De Bonis, A., Ga̧sieniec, L., Vaccaro, U.: Generalized framework for selectors with applications in optimal group testing. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 81–96. Springer, Heidelberg (2003)
Chlebus, B., Ga̧sieniec, L., Kowalski, D., Radzik, T.: On the wake-up problem in radio networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 347–359. Springer, Heidelberg (2005)
Chlebus, B., Ga̧sieniec, L., Lingas, A., Pagourtzis, A.: Oblivious gossiping in ad-hoc radio networks. In: DIAL-M, pp. 44–51 (2001)
Chlebus, B., Kowalski, D.: A better wake-up in radio networks. In: PODC (2004)
Chrobak, M., Ga̧sieniec, L., Kowalski, D.: The wake-up problem in multi-hop radio networks. In: SODA (2004)
Chrobak, M., Ga̧sieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. In: FOCS (2000)
Clementi, A., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: SODA (2001)
Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. In: FOCS (2003)
Doherty, L., Pister, K.S.J., El Ghaoui, L.: Convex optimization methods for sensor node position estimation. In: INFOCOM, pp. 1655–1663 (2001)
Dolev, S., Gilbert, S., Guerraoui, R., Kuhn, F., Newport, C.: The wireless synchronization problem. In: PODC (2009)
Dyachkov, A., Rykov, V.: A survey of superimposed code theory. Probl. Contr. Inform. Theor. 12(4) (1983)
Farach-Colton, M., Fernandes, R.J., Mosteiro, M.A.: Bootstrapping a hop-optimal network in the weak sensor model. ACM TALG 5(4), 1–30 (2009)
Fernández Anta, A., Mosteiro, M.A., Thraves, C.: Deterministic communication in the weak sensor model. In: Tovar, E., Tsigas, P., Fouchal, H. (eds.) OPODIS 2007. LNCS, vol. 4878, pp. 119–131. Springer, Heidelberg (2007)
Fernández Anta, A., Mosteiro, M.A., Thraves, C.: Deterministic recurrent communication in restricted sensor networks. INRIA RR 00486270 (2009)
Fernández Anta, A., Mosteiro, M.A., Thraves, C.: Deterministic recurrent communication and synchronization in restricted sensor networks. INRIA RR 00486277 (2010)
Gouda, M.G., Herman, T.: Stabilizing unison. IPL 35(4), 171–175 (1990)
Indyk, P.: Explicit constructions of selectors and related combinatorial structures, with applications. In: SODA (2002)
Kowalski, D.R.: On selection problem in radio networks. In: PODC, pp. 158–166 (2005)
Kushilevitz, E., Mansour, Y.: An Ω(Dlog(N/D)) lower bound for broadcast in radio networks. SICOMP 27(3), 702–712 (1998)
Liu, D., Prabhakaran, M.: On randomized broadcasting and gossiping in radio networks. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 340–349. Springer, Heidelberg (2002)
Roberts, L.G.: Aloha packet system with and without slots and capture. CCR 5(2), 28–42 (1975)
Song, W.-Z., Wang, Y., Li, X.-Y., Frieder, O.: Localized algorithms for energy efficient topology in wireless ad hoc networks. MONET 10(6), 911–923 (2005)
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
Fernández Anta, A., Mosteiro, M.A., Thraves, C. (2010). Deterministic Recurrent Communication and Synchronization in Restricted Sensor Networks. In: Scheideler, C. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2010. Lecture Notes in Computer Science, vol 6451. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16988-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-16988-5_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16987-8
Online ISBN: 978-3-642-16988-5
eBook Packages: Computer ScienceComputer Science (R0)