A scheduling algorithm for connected target coverage under probabilistic coverage model
Chan-Myung Kim, Yonghwan Kim, In-Seok Kang, Kang-whan Lee, Youn‐Hee Han · 2012
Connected Target Coverage (CTC) problem [8], covering given targets fully with the deployed sensors and also guaranteeing connectivity to a sink node, is a challenging scheduling problem. In this paper, unlike the existing heuristic algorithms, we adopt the probabilistic coverage model to solve the problem and develop a heuristic algorithm called CWGC-PM (Communication Weighted Greedy Cover-Probabilistic Model) to extend the network lifetime while such coverage and connectivity constraints are satisfied. Simulation results are presented to evaluate the performance of the proposed algorithm and they show that the probabilistic coverage model can capture the diverse sensing characteristics of sensor nodes in the real world.