Improving Energy-Efficient Target Coverage in Visual Sensor Networks

Subject Areas : Journal of Computer & Robotics

Behrooz  Shahrokhzadeh ¹ (Faculty of Computer and Information Technology Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran)
Mehdi  Dehghan ² (Department of computer engineering, Amirkabir University of Technology, Tehran, Iran)
MohammadReza  Shahrokhzadeh ³ (University of Applied Sciences & Technology, Tehran, Iran)

Received: 2016-01-12 Accepted : 2016-12-19 Published : 2017-03-16

Keywords: target coverage, network lifetime, scheduling, simulated annealing, visual sensor networks,

Abstract :

Target coverage is one of the important problems in visual sensor networks. The coverage should be accompanied with an efficient use of energy in order to increase the network lifetime. In this paper, we address the maximum lifetime for visual sensor networks (MLV) problem by maximizing the network lifetime while covering all the targets. For this purpose, we develop a simulated annealing (SA) algorithm that divides the sensors’ Field-of-View (FoV) to a number of cover sets and then applies a sleep-wake schedule for cover sets. We also identify the best possible FoV of sensors according to the targets’ location using rotating cameras, to reduce the solution space and approaching to a near-optimal solution. Our proposed energy and neighbor generating functions of the SA result in a balanced distribution of energy consumption as well as escaping from local optima. We conduct some simulation experiments to evaluate the performance of our proposed method by comparing with some well-known solutions in the literature.