Contribution to the Maximum Coverage Detection in a Heterogeneous Network

This article has addressed the problem of area coverage in surveillance camera networks using a minimum number of active sensors. The dense and random deployment of cameras creates many problems, among which the same portion of the area of interest is cited and monitored by several sensors. This redundancy of information generates unnecessary energy consumption, which increases the cost of installation. This work contributed to the extension of a surveillance algorithm, and the authors presented in this work a distributed algorithm of perimeter surveillance and made this contribution allowing the maintenance of total coverage in heterogeneous camera networks. The proposed solution is based on the search for minimum sets that completely cover a surface by scheduling the activity of the sensors. The proposed approach consists of calculating the distance between the center and the furthest point not covered and subtracting a fixed step from it; the coverage of these circles is done in the same way as the coverage of the first perimeter. The results of the simulations show that this approach ensures maximum coverage with a minimum number of cameras.