Minimum Perimeter Coverage Set Based on Points of Tangency and Strong Barrier for an Extended WSN Lifetime

Abstract

The random deployment of sensors in the area of interest triggers several research issues. Among them, we can cite connectivity, localization and coverage. In this paper, we focus on the latter one. Our objective is to monitor the perimeter of a region of interest with circular shape from intrusions. We propose a new approach to define the minimum coverage set based on points of tangency and strong barrier coverage. Furthermore, in order to exploit the redundancy of information due to the random deployment of nodes, we also suggest a new approach to generate the scheduling sets, which consists on the creation of multiple virtual perimeters around the area of interest, upon which the minimum coverage sets is constructed. In other words, the objective is to minimize the number of nodes in coverage set and to maximize the number of coverage sets for scheduling. These disjoint sets of sensors can be activated one after the other to further extend the network lifetime or multiple sets at time and reach k-barrier coverage for strong surveillance applications. Simulation results show that to generate the minimum coverage set, our approach gives better results compared to those proposed in the literature. Moreover, the approach of constructing the scheduling sets significantly increases the network lifetime.