On connected target coverage for wireless heterogeneous sensor networks with multiple sensing units

The paper considers the connected target coverage (CTC) problem in wireless heterogeneous sensor networks (WHSNs) with multiple sensing units, termed MU-CTC problem. MU-CTC problem can be reduced to a connected set cover problem and further formulated as an integer linear programming (ILP) problem. However, the ILP problem is an NP-complete problem. Therefore, two distributed heuristic schemes, REFS (remaining energy first scheme) and EEFS (energy efficiency first scheme), are proposed. In REFS, each sensor considers its remaining energy and its neighbors' decisions to enable its sensing units and communication unit such that all targets can be covered for the required attributes and the sensed data can be delivered to the sink. The advantages of REFS are its simplicity and reduced communication overhead. However, to utilize sensors' energy efficiently, EEFS is proposed. A sensor in EEFS considers its contribution to the coverage and the connectivity to make a better decision. To our best knowledge, this paper is the first to consider target coverage and connectivity jointly for WHSNs with multiple sensing units. Simulation results show that REFS and EEFS can both prolong the network lifetime effectively. EEFS outperforms REFS in network lifetime, but REFS is simpler.