Deterministic Recurrent Communication and Synchronization in Restricted Sensor Networks

  • Antonio Fernández Anta
  • Miguel A. Mosteiro
  • Christopher Thraves
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6451)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: Single round simulation in radio networks. J. Algorithms 13, 188–210 (1992)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    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)MathSciNetMATHGoogle Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    Chlebus, B., Ga̧sieniec, L., Lingas, A., Pagourtzis, A.: Oblivious gossiping in ad-hoc radio networks. In: DIAL-M, pp. 44–51 (2001)Google Scholar
  6. 6.
    Chlebus, B., Kowalski, D.: A better wake-up in radio networks. In: PODC (2004)Google Scholar
  7. 7.
    Chrobak, M., Ga̧sieniec, L., Kowalski, D.: The wake-up problem in multi-hop radio networks. In: SODA (2004)Google Scholar
  8. 8.
    Chrobak, M., Ga̧sieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. In: FOCS (2000)Google Scholar
  9. 9.
    Clementi, A., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: SODA (2001)Google Scholar
  10. 10.
    Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. In: FOCS (2003)Google Scholar
  11. 11.
    Doherty, L., Pister, K.S.J., El Ghaoui, L.: Convex optimization methods for sensor node position estimation. In: INFOCOM, pp. 1655–1663 (2001)Google Scholar
  12. 12.
    Dolev, S., Gilbert, S., Guerraoui, R., Kuhn, F., Newport, C.: The wireless synchronization problem. In: PODC (2009)Google Scholar
  13. 13.
    Dyachkov, A., Rykov, V.: A survey of superimposed code theory. Probl. Contr. Inform. Theor. 12(4) (1983)Google Scholar
  14. 14.
    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)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    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)CrossRefGoogle Scholar
  16. 16.
    Fernández Anta, A., Mosteiro, M.A., Thraves, C.: Deterministic recurrent communication in restricted sensor networks. INRIA RR 00486270 (2009)Google Scholar
  17. 17.
    Fernández Anta, A., Mosteiro, M.A., Thraves, C.: Deterministic recurrent communication and synchronization in restricted sensor networks. INRIA RR 00486277 (2010)Google Scholar
  18. 18.
    Gouda, M.G., Herman, T.: Stabilizing unison. IPL 35(4), 171–175 (1990)MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Indyk, P.: Explicit constructions of selectors and related combinatorial structures, with applications. In: SODA (2002)Google Scholar
  20. 20.
    Kowalski, D.R.: On selection problem in radio networks. In: PODC, pp. 158–166 (2005)Google Scholar
  21. 21.
    Kushilevitz, E., Mansour, Y.: An Ω(Dlog(N/D)) lower bound for broadcast in radio networks. SICOMP 27(3), 702–712 (1998)CrossRefMATHGoogle Scholar
  22. 22.
    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)CrossRefGoogle Scholar
  23. 23.
    Roberts, L.G.: Aloha packet system with and without slots and capture. CCR 5(2), 28–42 (1975)Google Scholar
  24. 24.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Antonio Fernández Anta
    • 1
    • 2
  • Miguel A. Mosteiro
    • 3
    • 2
  • Christopher Thraves
    • 4
  1. 1.Institute IMDEA NetworksLeganésSpain
  2. 2.LADyR, GSyCUniversidad Rey Juan CarlosMadridSpain
  3. 3.Department of Computer ScienceRutgers UniversityPiscatawayUSA
  4. 4.ASAP Project team, IRISA/INRIA RennesCampus Universitaire de BeaulieuRennes CedexFrance

Personalised recommendations