In recent years, target coverage is one of the important problems in visual sensor networks. An efficient use of energy is required in order to increase the network lifetime, while covering all the targets. In this paper, we address the Maximum Lifetime with Coverage Sc More
In recent years, target coverage is one of the important problems in visual sensor networks. An efficient use of energy is required in order to increase the network lifetime, while covering all the targets. In this paper, we address the Maximum Lifetime with Coverage Scheduling (MLCS) problem that maximizes the network lifetime. We develop a simulated annealing (SA) algorithm that divides the sensors’ Field-of-View (FoV) to a number of cover sets that can cover all the targets and then applies a sleep-wake scheduling algorithm. On the other hand, we have to identify the best possible FoV of sensors according to the targets’ location using rotating cameras, to reduce the solution space and find a near-optimal solution. It also provides the balanced distribution of energy consumption by introducing a new energy and neighbor generating function as well as escaping from local optima. Finally, we conduct some simulation experiments to evaluate the performance of our proposed method by comparing with well-known solutions in the literature such as greedy algorithms.
Manuscript profile
