Achieving Crossed Strong Barrier Coverage in Wireless Sensor Network
AbstractBarrier 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. View Full-Text
Share & Cite This Article
Han, R.; Yang, W.; Zhang, L. Achieving Crossed Strong Barrier Coverage in Wireless Sensor Network. Sensors 2018, 18, 534.
Han R, Yang W, Zhang L. Achieving Crossed Strong Barrier Coverage in Wireless Sensor Network. Sensors. 2018; 18(2):534.Chicago/Turabian Style
Han, Ruisong; Yang, Wei; Zhang, Li. 2018. "Achieving Crossed Strong Barrier Coverage in Wireless Sensor Network." Sensors 18, no. 2: 534.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.