The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Energy-efficient surveillance system using wireless sensor networks
Proceedings of the 2nd international conference on Mobile systems, applications, and services
On k-coverage in a mostly sleeping sensor network
Proceedings of the 10th annual international conference on Mobile computing and networking
Barrier coverage with wireless sensors
Proceedings of the 11th annual international conference on Mobile computing and networking
Telos: enabling ultra-low power wireless research
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Reliable density estimates for coverage and connectivity in thin strips of finite length
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Strong barrier coverage of wireless sensor networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Measuring and guaranteeing quality of barrier-coverage in wireless sensor networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
On-supporting energy balanced k-barrier coverage in wireless sensor networks
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Optimal movement of mobile sensors for barrier coverage of a planar region
Theoretical Computer Science
Measuring and guaranteeing quality of barrier coverage for general belts with wireless sensors
ACM Transactions on Sensor Networks (TOSN)
Employing a novel two tiered network structure to extend the lifetime of WSNs
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Cluster head selection for homogeneous wireless sensor networks
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 3
On perimeter coverage scheduling in wireless sensor networks
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
Accumulation point model for barrier coverage
INSS'09 Proceedings of the 6th international conference on Networked sensing systems
Strong barrier coverage with directional sensors
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Strong k-barrier coverage with mobile sensors
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Multi-round sensor deployment for guaranteed barrier Coverage
INFOCOM'10 Proceedings of the 29th conference on Information communications
The intrusion detection in mobile sensor network
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Barrier coverage with sensors of limited mobility
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
New algorithms for barrier coverage with mobile sensors
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
On minimizing the sum ofensor movements for barrier coverage of a line segment
ADHOC-NOW'10 Proceedings of the 9th international conference on Ad-hoc, mobile and wireless networks
Characterizing the path coverage of random wireless sensor networks
EURASIP Journal on Wireless Communications and Networking - Special issue on theoretical and algorithmic foundations of wireless ad hoc and sensor networks
EURASIP Journal on Wireless Communications and Networking - Special issue on theoretical and algorithmic foundations of wireless ad hoc and sensor networks
A study on the weak barrier coverage problem in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Coverage problems in sensor networks: A survey
ACM Computing Surveys (CSUR)
Points of interest coverage with connectivity constraints using wireless mobile sensors
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part I
Review: A survey on coverage and connectivity issues in wireless sensor networks
Journal of Network and Computer Applications
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Energy efficient k-barrier coverage in limited mobile wireless sensor networks
Computer Communications
Optimal sensor networks for area monitoring using rotating and beam sensors
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
The intrusion detection in mobile sensor network
IEEE/ACM Transactions on Networking (TON)
Constructing sensor barriers with minimum cost in wireless sensor networks
Journal of Parallel and Distributed Computing
Barrier coverage with line-based deployed mobile sensors
Ad Hoc Networks
A density-barrier construction algorithm with minimum total movement in mobile WSNs
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Global barrier coverage that requires much fewer sensors than full coverage, is known to be an appropriate model of coverage for movement detection applications such as intrusion detection. However, it has been proved that given a sensor deployment, sensors can not locally determine whether the deployment provides global barrier coverage, making it impossible to develop localized algorithms, thus limiting its use in practice. In this paper, we introduce the concept of local barrier coverage to address this limitation. Motivated by the observation that movements are likely to follow a shorter path in crossing a belt region, local barrier coverage guarantees the detection of all movements whose trajectory is confined to a slice of the belt region of deployment. We prove that it is possible for individual sensors to locally determine the existence of local barrier coverage, even when the region of deployment is arbitrarily curved. Although local barrier coverage does not always guarantee global barrier coverage, we show that for thin belt regions, local barrier coverage almost always provides global barrier coverage. To demonstrate that local barrier coverage can be used to design localized algorithms, we develop a novel sleep-wakeup algorithm for maximizing the network lifetime, called Localized Barrier Coverage Protocol (LBCP). We show that LBCP provides close to optimalenhancement in network lifetime, while providing global barrier coverage most of the time. It outperforms an existing algorithm called Randomized Independent Sleeping (RIS) by up to 6 times.