Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/3523
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMishra, Tapas Kumar-
dc.contributor.authorSadhu, Jayadeep-
dc.contributor.authorKumar, Arun-
dc.date.accessioned2020-03-05T11:13:13Z-
dc.date.available2020-03-05T11:13:13Z-
dc.date.issued2020-02-
dc.identifier.citationIEEE Kolkata Conference CALCON 2020, Kolkata, 28-29th February 2020en_US
dc.identifier.urihttp://hdl.handle.net/2080/3523-
dc.descriptionCopyright belongs to proceedings publisheren_US
dc.description.abstractPerimeter 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(log2n) time, where n is the number of sensor nodes in the network, maximizing the coverage area of the network at all times.en_US
dc.subjectWireless Sensor Networksen_US
dc.subjectConvex Hull Techniquesen_US
dc.titleBoundary Detection in Dynamic Wireless Sensor Networks using Convex Hull Techniquesen_US
dc.typeArticleen_US
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
2020_CALCON_TKMishra_Boundary.pdf390.22 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.