Advertisement

Continuous Monitoring in the Dynamic Sensor Field Model

  • Carme Àlvarez
  • Josep Díaz
  • Dieter Mitsche
  • Maria Serna
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7111)

Abstract

In this work we consider the problem of continuously monitoring a collection of data sets produced by sensors placed on mobile or static targets. Our computational model, the dynamic sensor field model, is an extension of the static sensor field model [3] allowing computation in the presence of mobility. The dynamicity comes from both the mobile communication devices and the data sensors. The mobility of devices is modeled by a dynamic communication graph depending on the position of the devices. Data mobility is due to measurements performed by sensing units that are not placed on fixed positions but attached to mobile agents or targets. Accordingly, we introduce two additional performance measures: the total traveled distance in a computational step and the gathering period.

We study the Continuous Monitoring problem providing bounds on performance for several protocols that differ in the use of mobility and the placement of the devices. Our objective is to analyze formally the computational resources needed to solve the Continuous Monitoring in a dynamic context. For doing so, we consider a particular scenario in which communication devices and data sensors move on top of a squared terrain discretized by a mobility grid. We also consider two scenarios, the static data setting in which sensors are placed at fixed but unknown positions and the dynamic data setting in which sensors are placed on dynamic targets and follow a passive mobility pattern.

Keywords

Tiny artifacts sensor networks continuous monitoring problem sensor field model computational complexity 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aldous, D., Fill, J.: Reversible Markov Chains and Random Walks on Graphs. Electronic Draft (2002), at http://stat-www.berkeley.edu/users/aldous/RWG/book.html
  2. 2.
    Àlvarez, C., Duch, A., Gabarro, J., Michail, O., Serna, M., Spirakis, P.: Computational models for networks of tiny artifacts: a survey. Computer Science Review 5(1), 7–25 (2011)CrossRefzbMATHGoogle Scholar
  3. 3.
    Àlvarez, C., Duch, A., Gabarro, J., Serna, M.: Sensor Field: A Computational Model. In: Dolev, S. (ed.) ALGOSENSORS 2009. LNCS, vol. 5804, pp. 3–14. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  4. 4.
    Díaz, J., Mitsche, D., Santi, P.: Theoretical aspects of graph models for MANETs. In: Nikoetseas, S., Rolim, J. (eds.) Theoretical Aspects of Distributed Computing in Sensor Networks. Monographs in Theoretical Computer Science, pp. 161–190. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  5. 5.
    Díaz, J., Pérez, X., Serna, M., Wormald, N.: Walkers on the cycle and the grid. SIAM Journal on Discrete Mathematics 22(2), 747–775 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Eyal, I., Keidar, I., Rom, R.: LiMoSense – Live Monitoring in Dynamic Sensor Networks. In: Erlebach, T., Nikoletseas, S., Orponen, P. (eds.) ALGOSENSORS 2011. LNCS, vol. 7111, pp. 72–85. Springer, Heidelberg (2012)Google Scholar
  7. 7.
    Feige, U.: A tight upper bound on the cover time for random walks on graphs. Random Struct. Algorithms 6(1), 51–54 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Gibbons, P., Tirthapura, S.: Estimating simple functions on the union of data streams. In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2001, pp. 281–291 (2001)Google Scholar
  9. 9.
    Juang, P., Oki, H., Wang, Y., Martonosi, M., Henzinger, L.-S.P., Rubenstein, D.: Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with ZebraNet. In: ASPLOS 2002, pp. 96–107 (2002)Google Scholar
  10. 10.
    Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, San Mateo (1993)zbMATHGoogle Scholar
  11. 11.
    Spitzer, F.: Principles of Random Walk, 2nd edn. Springer, New York (2001)zbMATHGoogle Scholar
  12. 12.
    Valiant, L.: A bridging model for parallel computation. Communications of the ACM 33(8), 103–111 (1990)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Carme Àlvarez
    • 1
  • Josep Díaz
    • 1
  • Dieter Mitsche
    • 2
  • Maria Serna
    • 1
  1. 1.LSI Dept.Universitat Politècnica de CatalunyaBarcelonaSpain
  2. 2.Dept. of MathematicsRyerson UniversityTorontoCanada

Personalised recommendations