Advertisement

Distributed Computing

, Volume 27, Issue 5, pp 313–328 | Cite as

LiMoSense: live monitoring in dynamic sensor networks

  • Ittay Eyal
  • Idit Keidar
  • Raphael Rom
Article

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. The algorithm uses a novel technique to bound variable size. We present the algorithm and formally prove its correctness. 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.

Keywords

Sensor Network Serial Number Read Average Node Failure Dynamic Topology 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Notes

Acknowledgments

The authors thank an anonymous reviewer for important comments on an earlier version of this work.

References

  1. 1.
    Almeida., P.S., Baquero., C., Farach-Colton., M., Jesus., P., Mosteiro, M.A.: Fault-tolerant aggregation: flow updating meets mass distribution. In: OPODIS (2011)Google Scholar
  2. 2.
    Asada, G., Dong, M., Lin, T.S., Newberg, F., Pottie, G., Kaiser, W.J., Marcy, H.O.: Wireless integrated network sensors: low power systems on a chip. In: ESSCIRC (1998)Google Scholar
  3. 3.
    Birk., Y., Keidar., I., Liss, L., Schuster, A.: Efficient dynamic aggregation. In: DISC (2006)Google Scholar
  4. 4.
    Boyd, S.P., Ghosh, A., Prabhakar, B., Shah, D.: Gossip algorithms: design, analysis and applications. In: INFOCOM (2005)Google Scholar
  5. 5.
    Boyd, S.P., Ghosh, A., Prabhakar, B., Shah, D.: Randomized gossip algorithms. IEEE Trans. Inf. Theory 52(6), 2508–2530 (2006) Google Scholar
  6. 6.
    Chen, J.-Y., Pandurangan, G.: Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis. IEEE Trans. Parallel Distrib. Syst. 17(9), 987–1000 (2006)CrossRefGoogle Scholar
  7. 7.
    Eyal, I., Keidar, I., Rom, R.: LiMoSense: live monitoring in dynamic sensor networks. In: 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSOR’11) (2011)Google Scholar
  8. 8.
    Fagnani, Fabio, Zampieri, Sandro: Randomized consensus algorithms over large scale networks. IEEE J. Sel. Areas Commun. 26(4), 634–649 (2008)CrossRefGoogle Scholar
  9. 9.
    Flajolet, P., Nigel Martin, G.: Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci. 31(2), 182–209 (1985)Google Scholar
  10. 10.
    Jain, N., Mahajan, P., Kit, D., Yalagandula, P., Dahlin, M., Zhang, Y.: A new consistency metric for scalable monitoring. In: OSDI, Network imprecision (2008)Google Scholar
  11. 11.
    Jelasity, M., Montresor, A.: Epidemic-style proactive aggregation in large overlay networks. In: Distributed Computing Systems, 2004. Proceedings. 24th International Conference on, pp. 102–109. IEEE (2004)Google Scholar
  12. 12.
    Jelasity, M., Montresor, A., Babaoglu. Ö.: Gossip-based aggregation in large dynamic networks. ACM Trans. Comput. Syst. (TOCS) 23(3), 219–252 (2005) Google Scholar
  13. 13.
    Jesus, P., Baquero, C., Almeida, P.S.: Fault-tolerant aggregation for dynamic networks. In: SRDS (2010)Google Scholar
  14. 14.
    Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: FOCS (2003)Google Scholar
  15. 15.
    Madden, S., Franklin, M.J., Hellerstein, J.M., Hong, W.: A tiny aggregation service for ad-hoc sensor networks. In: OSDI, Tag (2002)Google Scholar
  16. 16.
    Mosk-Aoyama, D., Shah, D.: Computing separable functions via gossip. In: PODC (2006)Google Scholar
  17. 17.
    Nath, S., Gibbons, P.B., Seshan, S., Anderson, Z.R.: Synopsis diffusion for robust aggregation in sensor networks. In: SenSys (2004)Google Scholar
  18. 18.
    Tanenbaum, A.S.: Computer Networks. Prentice Hall, New Jersey (2003)Google Scholar
  19. 19.
    Warneke, B., Last, M., Liebowitz, B., Pister, K.S.J.: Smart dust: communicating with a cubic-millimeter computer. Computer 34(1), 44–51 (2001)Google Scholar
  20. 20.
    Wuhib, Fetahi, Dam, Mads, Stadler, Rolf, Clem, Alexander: Robust monitoring of network-wide aggregates through gossiping. IEEE Trans. Netw. Serv. Manag. 6(2), 95–109 (2009)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  1. 1.Department of Computer ScienceCornell UniversityIthacaUSA
  2. 2.Department of Electrical EngineeringTechnionHaifaIsrael

Personalised recommendations