Abstract
Barrier coverage has been widely used to detect intrusions in wireless sensor networks (WSNs). It can fulfill the monitoring task while extending the lifetime of the network. Though barrier coverage in WSNs has been intensively studied in recent years, previous research failed to consider the problem of intrusion in transversal directions. If an intruder knows the deployment configuration of sensor nodes, then there is a high probability that it may traverse the whole target region from particular directions, without being detected. In this paper, we introduce the concept of crossed barrier coverage that can overcome this defect. We prove that the problem of finding the maximum number of crossed barriers is NP-hard and integer linear programming (ILP) is used to formulate the optimization problem. The branch-and-bound algorithm is adopted to determine the maximum number of crossed barriers. In addition, we also propose a multi-round shortest path algorithm (MSPA) to solve the optimization problem, which works heuristically to guarantee efficiency while maintaining near-optimal solutions. Several conventional algorithms for finding the maximum number of disjoint strong barriers are also modified to solve the crossed barrier problem and for the purpose of comparison. Extensive simulation studies demonstrate the effectiveness of MSPA.
Highlights
Wireless sensor networks (WSNs), which have the outstanding advantages of easy configuration, flexibility in shrinking or expanding, strong fault-tolerance, and mobility, have played an important role in monitoring and analyzing dynamic, hostile, unfamiliar, and unexplored environments
We provide an integer linear programming (ILP) formulation to better describe the optimization problem of finding the maximum number of crossed barriers, and we use the branch-and-bound algorithm to obtain the optimal solution, which will serve as a benchmark for other algorithms
We studied the problem of achieving the maximum number of crossed barriers in a wireless sensor network
Summary
Wireless sensor networks (WSNs), which have the outstanding advantages of easy configuration, flexibility in shrinking or expanding, strong fault-tolerance, and mobility, have played an important role in monitoring and analyzing dynamic, hostile, unfamiliar, and unexplored environments. In WSNs, a series of sensor nodes, whose sensing regions overlap, form a sensor barrier for intruders and can guarantee the detection of penetrating behavior in particular directions. Strong barrier coverage, which provides continuous coverage, ensures that every intrusion is detected since any crossing path needs to traverse a barrier. Strong barrier coverage can detect intruders who traverse the target region vertically, a security vulnerability exists since a WSN cannot handle the traverse intrusion. Note that maximizing the number of crossed barrier is not merely the superposition of finding and adding up the maximum barrier in individual directions We demonstrate it through analysis and simulations . To the best of our knowledge, we are the first to introduce and study crossed barrier coverage in WSNs. We show that the problem of finding the maximum number of crossed strong barriers is NP-hard.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
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
