Abstract
We present LiMoSense, a fault-tolerant live monitoring algorithm for dynamic sensor networks. This is the first asynchronous robust average aggregation algorithm that performs live monitoring, i.e., it constantly obtains a timely and accurate picture of dynamically changing data. LiMoSense uses gossip to dynamically track and aggregate a large collection of ever-changing sensor reads. It overcomes message loss, node failures and recoveries, and dynamic network topology changes. We formally prove the correctness of LiMoSense; we use simulations to illustrate its ability to quickly react to changes of both the network topology and the sensor reads, and to provide accurate information.
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
Almeida, P.S., Baquero, C., Farach-Colton, M., Jesus, P., Mosteiro, M.A.: Fault-Tolerant Aggregation: Flow-Updating Meets Mass-Distribution. In: Fernàndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol. 7109, pp. 513–527. Springer, Heidelberg (2011)
Asada, G., Dong, M., Lin, T., Newberg, F., Pottie, G., Kaiser, W., Marcy, H.: Wireless integrated network sensors: Low power systems on a chip. In: ESSCIRC (1998)
Birk, Y., Keidar, I., Liss, L., Schuster, A.: Efficient Dynamic Aggregation. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 90–104. Springer, Heidelberg (2006)
Boyd, S.P., Ghosh, A., Prabhakar, B., Shah, D.: Gossip algorithms: design, analysis and applications. In: INFOCOM (2005)
Eyal, I., Keidar, I., Rom, R.: LiMoSense – live monitoring in dynamic sensor networks. Tech. Rep. CCIT 786, Technion, Israel Institute of Technology (2011)
Flajolet, P., Martin, G.N.: Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci. 31(2) (1985)
Jain, N., Mahajan, P., Kit, D., Yalagandula, P., Dahlin, M., Zhang, Y.: Network imprecision: A new consistency metric for scalable monitoring. In: OSDI (2008)
Jelasity, M., Montresor, A., Babaoglu, O.: Gossip-based aggregation in large dynamic networks. ACM Transactions on Computer Systems (TOCS) 23(3) (2005)
Jesus, P., Baquero, C., Almeida, P.: Fault-tolerant aggregation for dynamic networks. In: SRDS (2010)
Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: FOCS (2003)
Madden, S., Franklin, M.J., Hellerstein, J.M., Hong, W.: Tag: A tiny aggregation service for ad-hoc sensor networks. In: OSDI (2002)
Mosk-Aoyama, D., Shah, D.: Computing separable functions via gossip. In: PODC (2006)
Nath, S., Gibbons, P.B., Seshan, S., Anderson, Z.R.: Synopsis diffusion for robust aggregation in sensor networks. In: SenSys (2004)
Warneke, B., Last, M., Liebowitz, B., Pister, K.: Smart dust: communicating with a cubic-millimeter computer. Computer 34(1) (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eyal, I., Keidar, I., Rom, R. (2012). LiMoSense – Live Monitoring in Dynamic Sensor Networks. 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_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-28209-6_7
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)