Decentralized Computation of Homology in Wireless Sensor Networks Using Spanning Trees

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10410)


When deploying a wireless sensor network over an area of interest, the information on signal coverage is critical. It has been shown that even when geometric position and orientation of individual nodes is not known, useful information on coverage can still be deduced based on connectivity data. In recent years, homological criteria have been introduced to verify complete signal coverage, given only the network communication graph. However, their algorithmic implementation has been limited due to high computational complexity of centralized algorithms, and high demand for communication in decentralized solutions, where a network employs the processing power of its nodes to check the coverage autonomously. To mitigate these problems, known approaches impose certain limitations on network topologies. In this paper, we propose a novel distributed algorithm which uses spanning trees to verify homology-based network coverage criteria, and works for arbitrary network topologies. We demonstrate that its communication demands are suitable even for low-bandwidth wireless sensor networks.


Wireless sensor networks Coverage problem Simplicial homology Computational homology Rips complex 


  1. 1.
    Raut, A.R., Khandait, S.P.: Review on data mining techniques in wireless sensor networks. In: 2015 2nd International Conference on Electronics and Communication Systems (ICECS). IEEE, February 2015Google Scholar
  2. 2.
    Holzinger, A.: On topological data mining. In: Holzinger, A., Jurisica, I. (eds.) Interactive Knowledge Discovery and Data Mining in Biomedical Informatics. LNCS, vol. 8401, pp. 331–356. Springer, Heidelberg (2014). doi: 10.1007/978-3-662-43968-5_19 CrossRefGoogle Scholar
  3. 3.
    Fan, G., Jin, S.: Coverage problem in wireless sensor network: a survey. J. Netw. 5(9), 1033–1040 (2010)Google Scholar
  4. 4.
    Bai, X., Kuma, S., Xua, D., Yun, Z., La, T.H.: Deploying wireless sensors to achieve both coverage and connectivity. In: Proceedings of the Seventh ACM International Symposium on Mobile ad hoc Networking and Computing. ACM Press (2006)Google Scholar
  5. 5.
    Bai, X., Yun, Z., Xuan, D., Lai, T.H., Jia, W.: Deploying four-connectivity and full-coverage wireless sensor networks. In: IEEE INFOCOM 2008 - The 27th Conference on Computer Communications. IEEE, April 2008Google Scholar
  6. 6.
    Li, X., Frey, H., Santoro, N., Stojmenovic, I.: Strictly localized sensor self-deployment for optimal focused coverage. IEEE Trans. Mob. Comput. 10(11), 1520–1533 (2011)CrossRefGoogle Scholar
  7. 7.
    So, A.M.-C., Ye, Y.: On solving coverage problems in a wireless sensor network using voronoi diagrams. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol. 3828, pp. 584–593. Springer, Heidelberg (2005). doi: 10.1007/11600930_58 CrossRefGoogle Scholar
  8. 8.
    Wang, G., Cao, G., Porta, T.L.: Movement-assisted sensor deployment. IEEE Trans. Mob. Comput. 5(6), 640–652 (2006)CrossRefGoogle Scholar
  9. 9.
    Zhang, C., Zhang, Y., Fang, Y.: Localized algorithms for coverage boundary detection in wireless sensor networks. Wirel. Netw. 15(1), 3–20 (2007)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Zhang, C., Zhang, Y., Fang, Y.: A coverage inference protocol for wireless sensor networks. IEEE Trans. Mob. Comput. 9(6), 850–864 (2010)CrossRefGoogle Scholar
  11. 11.
    Kumari, P., Singh, Y.: Delaunay triangulation coverage strategy for wireless sensor networks. In: 2012 International Conference on Computer Communication and Informatics. IEEE, January 2012Google Scholar
  12. 12.
    Huang, C.F., Tseng, Y.C.: The coverage problem in a wireless sensor network. In: Proceedings of the 2nd ACM International Conference on Wireless Sensor Networks and Applications. ACM Press (2003)Google Scholar
  13. 13.
    Wang, X., Xing, G., Zhang, Y., Lu, C., Pless, R., Gill, C.: Integrated coverage and connectivity configuration in wireless sensor networks. In: Proceedings of the First International Conference on Embedded Networked Sensor Systems. ACM Press (2003)Google Scholar
  14. 14.
    Bejerano, Y.: Simple and efficient k-coverage verification without location information. In: IEEE INFOCOM 2008 - The 27th Conference on Computer Communications. IEEE, April 2008Google Scholar
  15. 15.
    Ghrist, R., Muhammad, A.: Coverage and hole-detection in sensor networks via homology. In: IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks. IEEE (2005)Google Scholar
  16. 16.
    de Silva, V., Ghrist, R., Muhammad, A.: Blind swarms for coverage in 2-d. In: Robotics: Science and Systems I. Robotics: Science and Systems Foundation, June 2005Google Scholar
  17. 17.
    de Silva, V., Ghrist, R.: Coverage in sensor networks via persistent homology. Algebraic Geom. Topol. 7(1), 339–358 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Iyengar, S.S., Boroojeni, K.G., Balakrishnan, N.: Coordinate-free coverage in sensor networks via homology. Mathematical Theories of Distributed Sensor Networks, pp. 57–82. Springer, New York (2014). doi: 10.1007/978-1-4419-8420-3_4 CrossRefGoogle Scholar
  19. 19.
    Muhammad, A., Jadbabaie, A.: Decentralized computation of homology groups in networks by gossip. In: 2007 American Control Conference. IEEE, July 2007Google Scholar
  20. 20.
    Tahbaz-Salehi, A., Jadbabaie, A.: Distributed coverage verification in sensor networks without location information. IEEE Trans. Autom. Control 55(8), 1837–1849 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Kanno, J., Selmic, R.R., Phoha, V.: Detecting coverage holes in wireless sensor networks. In: 2009 17th Mediterranean Conference on Control and Automation. IEEE, June 2009Google Scholar
  22. 22.
    Chintakunta, H., Krim, H.: Divide and conquer: localizing coverage holes in sensor networks. In: 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON). IEEE, June 2010Google Scholar
  23. 23.
    Arai, Z., Hayashi, K., Hiraoka, Y.: Mayer-vietoris sequences and coverage problems in sensor networks. Jpn. J. Ind. Appl. Math. 28(2), 237–250 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    Chintakunta, H., Krim, H.: Distributed localization of coverage holes using topological persistence. IEEE Trans. Signal Process. 62(10), 2531–2541 (2014)MathSciNetCrossRefGoogle Scholar
  25. 25.
    Dłotko, P., Ghrist, R., Juda, M., Mrozek, M.: Distributed computation of coverage in sensor networks by homological methods. Appl. Algebra Eng. Commun. Comput. 23(1–2), 29–58 (2012)MathSciNetzbMATHGoogle Scholar
  26. 26.
    Yan, F., Vergne, A., Martins, P., Decreusefond, L.: Homology-based distributed coverage hole detection in wireless sensor networks. IEEE/ACM Trans. Netw. 23(6), 1705–1718 (2015)CrossRefGoogle Scholar
  27. 27.
    Hatcher, A.: Algebraic Topology. Cambridge University Press, Cambridge (2002)zbMATHGoogle Scholar
  28. 28.
    Edelsbrunner, H., Harer, J.: Computational Topology - An Introduction. American Mathematical Society, Providence (2010)zbMATHGoogle Scholar
  29. 29.
    Bott, R., Tu, L.W.: Differential Forms in Algebraic Topology. Springer, New York (1982). doi: 10.1007/978-1-4757-3951-0 CrossRefzbMATHGoogle Scholar
  30. 30.
    Khan, M., Pandurangan, G.: A fast distributed approximation algorithm for minimum spanning trees. Distrib. Comput. 20(6), 391–402 (2007)CrossRefzbMATHGoogle Scholar
  31. 31.
    Aho, A.V., Hopcroft, J.E., Ullman, J.: Data Structures and Algorithms, 1st edn. Addison-Wesley Longman Publishing Co. Inc, Boston (1983)zbMATHGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2017

Authors and Affiliations

  1. 1.Faculty of Computer and Information ScienceUniversity of LjubljanaLjubljanaSlovenia
  2. 2.Jožef Stefan InstituteLjubljanaSlovenia

Personalised recommendations