On Connected Target k-Coverage in Heterogeneous Wireless Sensor Networks
AbstractCoverage and connectivity are two important performance evaluation indices for wireless sensor networks (WSNs). In this paper, we focus on the connected target k-coverage (CTC k ) problem in heterogeneous wireless sensor networks (HWSNs). A centralized connected target k-coverage algorithm (CCTC k ) and a distributed connected target k-coverage algorithm (DCTC k ) are proposed so as to generate connected cover sets for energy-efficient connectivity and coverage maintenance. To be specific, our proposed algorithms aim at achieving minimum connected target k-coverage, where each target in the monitored region is covered by at least k active sensor nodes. In addition, these two algorithms strive to minimize the total number of active sensor nodes and guarantee that each sensor node is connected to a sink, such that the sensed data can be forwarded to the sink. Our theoretical analysis and simulation results show that our proposed algorithms outperform a state-of-art connected k-coverage protocol for HWSNs. View Full-Text
Share & Cite This Article
Yu, J.; Chen, Y.; Ma, L.; Huang, B.; Cheng, X. On Connected Target k-Coverage in Heterogeneous Wireless Sensor Networks. Sensors 2016, 16, 104.
Yu J, Chen Y, Ma L, Huang B, Cheng X. On Connected Target k-Coverage in Heterogeneous Wireless Sensor Networks. Sensors. 2016; 16(1):104.Chicago/Turabian Style
Yu, Jiguo; Chen, Ying; Ma, Liran; Huang, Baogui; Cheng, Xiuzhen. 2016. "On Connected Target k-Coverage in Heterogeneous Wireless Sensor Networks." Sensors 16, no. 1: 104.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.