Full angle coverage in visual sensor networks

In this article, the problem of selection and configuration of visual sensors in Visual Sensor Networks (VSNs) is studied for coverage of the existing targets in the three-dimensional network area. It is assumed that visual sensors are capable of Pan-Tilt-Zoom (PTZ) ability and able to choose the covered area and desirable target through configuration of the angle of view in two horizontal and vertical dimensions and alteration of the enlargement scale. In order to solve the problem of selection and configuration, two methods according to Binary Integer Programming (BIP) and Greedy Search are presented to ensure to find the best solution and least calculation complexity respectively. Applying the proposed solutions, the problems of full angle coverage have been assessed using circular target model. The perceived results properly confirm the efficiency of the proposed method in terms of execution speed and decreasing the computation complexity.