Yu Jiguo, Chen Ying, Ma Liran, Huang Baogui, Cheng Xiuzhen
School of Information Science and Engineering, Qufu Normal University, Rizhao 276826, Shandong, China.
Department of Computer Science, Texas Christian University, Fort Worth, TX 298850, USA.
Sensors (Basel). 2016 Jan 15;16(1):104. doi: 10.3390/s16010104.
Coverage 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.
覆盖范围和连通性是无线传感器网络（WSN）的两个重要性能评估指标。在本文中，我们关注异构无线传感器网络（HWSN）中的连通目标k覆盖（CTC k）问题。提出了一种集中式连通目标k覆盖算法（CCTC k）和一种分布式连通目标k覆盖算法（DCTC k），以生成用于高效节能的连通性和覆盖维护的连通覆盖集。具体而言，我们提出的算法旨在实现最小连通目标k覆盖，其中监测区域中的每个目标至少由k个活跃传感器节点覆盖。此外，这两种算法努力使活跃传感器节点的总数最小化，并确保每个传感器节点连接到一个汇聚节点，以便将感测到的数据转发到汇聚节点。我们的理论分析和仿真结果表明，我们提出的算法优于一种针对HWSN的现有连通k覆盖协议。
