Abstract:
Minimizing the maximum sensor movement distance for achieving linear barrier coverage is a key issue for intrusion detection in the area of barrier coverage. Existing wor...Show MoreMetadata
Abstract:
Minimizing the maximum sensor movement distance for achieving linear barrier coverage is a key issue for intrusion detection in the area of barrier coverage. Existing work in this area mostly assume that every working sensor needs to move onto the barrier line. Actually, sensors can still be helpful for covering the barrier when they move near enough to the line. In this paper, we study the case where moving sensors do not have to move onto the barrier line for intrusion detection purpose, and accordingly present an optimal algorithm for this issue. Detailed algorithm design is presented and the complexity of the algorithm is deduced to be O(n2log2|M|), where n represents the number of sensors in the network and M represents the upper bound of possible moving distance. Simulation results show that our algorithm outperforms existing work.
Published in: 2016 IEEE Global Communications Conference (GLOBECOM)
Date of Conference: 04-08 December 2016
Date Added to IEEE Xplore: 06 February 2017
ISBN Information: