Continuous Monitoring in the Dynamic Sensor Field Model
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  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.
KeywordsTiny artifacts sensor networks continuous monitoring problem sensor field model computational complexity
Unable to display preview. Download preview PDF.
- 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
- 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
- 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.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