Skip to main content
Log in

LiMoSense: live monitoring in dynamic sensor networks

  • Published:
Distributed Computing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

Notes

  1. For any variable, the node it belongs to is written in subscript and, when relevant, the time is written in superscript.

  2. There is a rich literature dealing with the means of detecting failures, usually with timeouts. This subject is outside the scope of this work.

  3. Note that the weight at a node never drops below \(q\), so the expression is valid.

References

  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)

  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)

  3. Birk., Y., Keidar., I., Liss, L., Schuster, A.: Efficient dynamic aggregation. In: DISC (2006)

  4. Boyd, S.P., Ghosh, A., Prabhakar, B., Shah, D.: Gossip algorithms: design, analysis and applications. In: INFOCOM (2005)

  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. 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)

    Article  Google Scholar 

  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)

  8. Fagnani, Fabio, Zampieri, Sandro: Randomized consensus algorithms over large scale networks. IEEE J. Sel. Areas Commun. 26(4), 634–649 (2008)

    Article  Google Scholar 

  9. Flajolet, P., Nigel Martin, G.: Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci. 31(2), 182–209 (1985)

  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)

  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)

  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. Jesus, P., Baquero, C., Almeida, P.S.: Fault-tolerant aggregation for dynamic networks. In: SRDS (2010)

  14. Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: FOCS (2003)

  15. Madden, S., Franklin, M.J., Hellerstein, J.M., Hong, W.: A tiny aggregation service for ad-hoc sensor networks. In: OSDI, Tag (2002)

  16. Mosk-Aoyama, D., Shah, D.: Computing separable functions via gossip. In: PODC (2006)

  17. Nath, S., Gibbons, P.B., Seshan, S., Anderson, Z.R.: Synopsis diffusion for robust aggregation in sensor networks. In: SenSys (2004)

  18. Tanenbaum, A.S.: Computer Networks. Prentice Hall, New Jersey (2003)

    Google Scholar 

  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. 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)

    Article  Google Scholar 

Download references

Acknowledgments

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

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ittay Eyal.

Additional information

A preliminary version of this paper appears in the proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSOR) [7].

This work was partially supported by the Israeli Science Foundation (ISF), Technion Funds for Security Research, the Technion Autonomous Systems Program (TASP), the Intel Collaborative Research Institute for Computational Intelligence (ICRI-CI), and the Hasso-Plattner Institute for Software Systems Engineering (HPI).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Eyal, I., Keidar, I. & Rom, R. LiMoSense: live monitoring in dynamic sensor networks. Distrib. Comput. 27, 313–328 (2014). https://doi.org/10.1007/s00446-014-0213-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-014-0213-8

Keywords

Navigation