Abstract

Perimeter protection aims to detect intrusions: these intrusions may range from agricultural fields to army base camps. The main problem concerning perimeter protection is edge or boundary detection. In this paper, two boundary detection algorithms have been proposed that use convex hull techniques to find the boundary of a static and dynamic wireless sensor network (WSN). Whenever a boundary node on a static WSN has to be replaced, our method chooses a new neighbor such that the overall area covered by the boundary is maximized. In the dynamic case, we demonstrate that the boundary of a dynamic WSN can be maintained in O(lig <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> n) time, where n is the number of sensor nodes in the network, maximizing the coverage area of the network at all times.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.