Distributed coverage hole detection algorithm based on Čech complex

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationCommunications and Networking - 12th International Conference, ChinaCom 2017, Proceedings
EditorsBo Li, Deze Zeng, Lei Shu
PublisherSpringer Verlag
Pages165-175
Number of pages11
ISBN (Print)9783319781389
DOIs
Publication statusPublished - 1 Jan 2018
Externally publishedYes
Event12th International Conference on Communications and Networking in China, CHINACOM 2017 - Xian, China
Duration: 10 Oct 201712 Oct 2017

Publication series

NameLecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST
Volume237 LNICST
ISSN (Print)1867-8211

Conference

Conference12th International Conference on Communications and Networking in China, CHINACOM 2017
Country/TerritoryChina
CityXian
Period10/10/1712/10/17

Keywords

  • Coverage problem
  • Distributed algorithm
  • Wireless sensor network
  • Čech complex

Fingerprint

Dive into the research topics of 'Distributed coverage hole detection algorithm based on Čech complex'. Together they form a unique fingerprint.

Cite this