An important issue in deploying a wireless sensor network (WSN) is to provide target coverage with high energy efficiency and fault-tolerance. In this paper, we study the problem of constructing energy-efficient and fault-tolerant target coverage with the minimal number of active nodes which form an
-coverage for targets and a
-connected communication subgraph. We propose two heuristic algorithms for
-coverage problem, and get the performance ratio of one heuristic. Then two heuristic algorithms are further proposed to solve the
-coverage problem. The simulation results demonstrate the desired efficiency of the proposed algorithms.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten