The detection of intrusion is one of the primary requirements of any sensor network when you deal with threats. Nowadays, camera sensor networks are being used due to the high level of information capture at a reasonable cost. When we deal with a camera sensor, occlusion due to the presence of other objects in between the camera and the target is a practical issue. Border areas with small hills or rock outcroppings contribute to occlusion which can affect proper surveillance.
Barrier coverage in the presence of occluders : A coverage model is proposed that incorporates the notion of sector division, determined by the overlap between occluders and sensor regions. We adapt the current graph-based technique to identify the existence of barrier coverage in the presence of occluders.
Barrier coverage through optimization: For the identified barrier uncovered network, an optimization problem is formulated using the orientation and movement of each sensor to determine the optimal positions and orientations for ensuring barrier coverage. Further, an attraction forced-based motion strategy is used to relocate the sensors at desired positions and orientations.
Barrier coverage of a protected region refers to the sensor network deployment, which ensures that there are no paths for intruders to go undetected when it passes through the borders of that region. UAVs that are equipped with downward-facing cameras act as mobile sensors and can be used for barrier coverage. We study the barrier coverage problem using such UAVs. We propose a movement strategy for UAVs that will maximize the barrier coverage of the belt with the deployment of the given sensors. Given an arbitrary placement of UAVs over a rectangular belt, we first align the sensors to a barrier line, and then we maximize the barrier coverage based on the number of sensors and the maximum and minimum height of flight allowed for UAVs. In cases, when the number of sensors is insufficient to cover the barrier line, we first deploy each UAV at the maximum allowed altitude. Then, we define an optimization problem that minimizes energy to find the final location of each UAV that covers a single segment of maximum length on the barrier line. We validate our result with simulation on different example scenarios.
In a more general case, an optimization problem is solved based on energy and resolution to obtain barrier coverage. A minimum overlapping criterion is also maintained while obtaining barrier coverage. The resolution of the camera, in addition to the extent of coverage, is a crucial parameter used to evaluate the quality of barrier coverage of a region. So, the resolution cost has been defined for a rectangular belt using the metric of area per pixel. If the belt is barrier uncovered, an optimization problem is solved based on resolution cost to achieve barrier coverage with an overlapping constraint and if the belt is barrier covered, an optimization problem is formulated to improve the overall resolution of the barrier-covered network. Moreover, it is also shown that a combination of rectangular belts can be utilized to guarantee barrier coverage for borders of any shape, by leveraging the barrier coverage outcomes obtained with a single rectangular belt. Further, if a sensor or a set of sensors fails in the barrier-covered network, a local barrier-mend strategy is proposed to reassure barrier coverage. The proposed algorithms can be easily scaled for a larger belt with a larger number of UAVs.
Different sections of a belt may require varying levels of surveillance quality. Currently, the reassuring of barrier coverage for the regions of different resolution requirements with a minimum number of UAVs and minimum energy (movement) is being studied.