Next Article in Journal
Flow Control in Wells Turbines for Harnessing Maximum Wave Power
Previous Article in Journal
A Real-Time Wireless Sweat Rate Measurement System for Physical Activity Monitoring
Article Menu
Issue 2 (February) cover image

Export Article

Open AccessArticle
Sensors 2018, 18(2), 534; https://doi.org/10.3390/s18020534

Achieving Crossed Strong Barrier Coverage in Wireless Sensor Network

1
School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing 100044, China
2
School of Electronic and Electrical Engineering, University of Leeds, Leeds LS2 9DX, UK
*
Author to whom correspondence should be addressed.
Received: 24 January 2018 / Revised: 4 February 2018 / Accepted: 5 February 2018 / Published: 10 February 2018
(This article belongs to the Section Sensor Networks)
View Full-Text   |   Download PDF [5982 KB, uploaded 10 February 2018]   |  

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. View Full-Text
Keywords: barrier coverage; crossed; wireless sensor networks; branch and bound; shortest path barrier coverage; crossed; wireless sensor networks; branch and bound; shortest path
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Han, R.; Yang, W.; Zhang, L. Achieving Crossed Strong Barrier Coverage in Wireless Sensor Network. Sensors 2018, 18, 534.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top