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.
Partially supported by the ICT Program of the European Union under contract number 215270 (FRONTS). The first, second and, fourth authors were also supported by the Spanish project TIN-2007-66523 (FORMALISM).
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
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
À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)
À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)
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)
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)
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)
Feige, U.: A tight upper bound on the cover time for random walks on graphs. Random Struct. Algorithms 6(1), 51–54 (1995)
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)
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)
Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, San Mateo (1993)
Spitzer, F.: Principles of Random Walk, 2nd edn. Springer, New York (2001)
Valiant, L.: A bridging model for parallel computation. Communications of the ACM 33(8), 103–111 (1990)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Àlvarez, C., Díaz, J., Mitsche, D., Serna, M. (2012). Continuous Monitoring in the Dynamic Sensor Field Model. In: Erlebach, T., Nikoletseas, S., Orponen, P. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2011. Lecture Notes in Computer Science, vol 7111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28209-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-28209-6_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28208-9
Online ISBN: 978-3-642-28209-6
eBook Packages: Computer ScienceComputer Science (R0)