Communications and Networking. 12th International Conference, ChinaCom 2017, Xi’an, China, October 10-12, 2017, Proceedings, Part II

Research Article

Distributed Coverage Hole Detection Algorithm Based on Čech Complex

Download
193 downloads
  • @INPROCEEDINGS{10.1007/978-3-319-78139-6_17,
        author={Wang Yuchen and Lu Jialiang and Philippe Martins},
        title={Distributed Coverage Hole Detection Algorithm Based on Čech Complex},
        proceedings={Communications and Networking. 12th International Conference, ChinaCom 2017, Xi’an, China, October 10-12, 2017, Proceedings, Part II},
        proceedings_a={CHINACOM},
        year={2018},
        month={4},
        keywords={Coverage problem Wireless Sensor Network Čech complex Distributed algorithm},
        doi={10.1007/978-3-319-78139-6_17}
    }
    
  • Wang Yuchen
    Lu Jialiang
    Philippe Martins
    Year: 2018
    Distributed Coverage Hole Detection Algorithm Based on Čech Complex
    CHINACOM
    Springer
    DOI: 10.1007/978-3-319-78139-6_17
Wang Yuchen1,*, Lu Jialiang1,*, Philippe Martins2,*
  • 1: SJTU-ParisTech, Elite Institute of Technology
  • 2: Institut Telecom, TELECOM ParisTech, LTCI
*Contact email: lucassjtu@gmail.com, jialiang.lu@sjtu.edu.cn, philippe.martins@telecom-paristech.fr

Abstract

Coverage problem is essential to Wireless Sensor Networks on energy efficient deployment and monitoring. In this paper, we propose a distributed Čech complex algorithm for coverage hole detection in WSNs. Based on our algorithm, each node takes only local information to build Čech sub-complex. Simulations on randomly deployed nodes show that the algorithm achieves a comparable accuracy and a much lower communication cost than a centralized Čech complex construction. Furthermore, it can be combined with distributed Rips complex algorithm to gain an even better performance.