Connected sensor cover

Weili Wu, Zhao Zhang, Wonjun Lee, Ding Zhu Du

Research output: Chapter in Book/Report/Conference proceedingChapter


The connected sensor cover was first studied by Cardei et al. The minimum connected sensor cover problem (Problem 1.3.2) was first proposed by Gupta, Das, and Gu. They presented a greedy algorithm with performance ratio O(rln n) where n is the number of sensors and r is the link radius of the sensor network, i.e., for any two sensors s and s′ with a sensing point in common, there exists a path between s and s′ with hop distance at most r in communication network. Zhang and Hou studied the minimum connected sensor cover problem in homogeneous wireless sensor networks with property that Rc ≥ 2Rs. They showed that in this case, the coverage of a connected target area implies the connectivity. This result was generalized by Zhou, Das, and Gupta to the m-connectivity that if every point in a connected target area is covered by at least m sensors, then those sensors induce an m-connected sensor network. Xing et al. presented a coverage configuration protocol which can give different degree of coverage requested by applications. Bai et al. studied a sensor deployment problem regarding the coverage and connectivity. Alam and Haas studied this problem in three-dimensional sensor networks.

Original languageEnglish
Title of host publicationSpringer Optimization and Its Applications
Number of pages33
Publication statusPublished - 2020

Publication series

NameSpringer Optimization and Its Applications
ISSN (Print)1931-6828
ISSN (Electronic)1931-6836

Bibliographical note

Publisher Copyright:
© Springer Nature Switzerland AG 2020.

ASJC Scopus subject areas

  • Control and Optimization


Dive into the research topics of 'Connected sensor cover'. Together they form a unique fingerprint.

Cite this