Exposure in wireless Ad-Hoc sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Introduction to Algorithms
Minimal and maximal exposure path algorithms for wireless embedded sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Barrier coverage with wireless sensors
Proceedings of the 11th annual international conference on Mobile computing and networking
Designing localized algorithms for barrier coverage
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Coverage in wireless ad hoc sensor networks
IEEE Transactions on Computers
Data fusion improves the coverage of wireless sensor networks
Proceedings of the 15th annual international conference on Mobile computing and networking
Measuring and guaranteeing quality of barrier coverage for general belts with wireless sensors
ACM Transactions on Sensor Networks (TOSN)
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
Constructing underwater sensor based barriers using distributed auctions
MILCOM'09 Proceedings of the 28th IEEE conference on Military 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
Minimum energy cost k-barrier coverage in wireless sensor networks
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
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)
Barrier coverage in camera sensor networks
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Review: A survey on coverage and connectivity issues in wireless sensor networks
Journal of Network and Computer Applications
Strong barrier coverage in directional sensor networks
Computer Communications
On barrier resilience of sensor networks
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Exploiting data fusion to improve the coverage of wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Energy efficient k-barrier coverage in limited mobile wireless sensor networks
Computer Communications
Design of wireless sensor networks for mobile target detection
IEEE/ACM Transactions on Networking (TON)
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
Barrier coverage in bistatic radar sensor networks: cassini oval sensing and optimal placement
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Automation and Remote Control
Sweep-coverage with energy-restricted mobile wireless sensor nodes
WASA'13 Proceedings of the 8th international conference on Wireless Algorithms, Systems, and Applications
Achieving full-view coverage in camera sensor networks
ACM Transactions on Sensor Networks (TOSN)
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 |
Constructing sensor barriers to detect intruders crossing a randomly-deployed sensor network is an important problem. Early results have shown how to construct sensor barriers to detect intruders moving along restricted crossing paths in rectangular areas. We present a complete solution to this problem for sensors that are distributed according to a Poisson point process. In particular, we present an efficient distributed algorithm to construct sensor barriers on long strip areas of irregular shape without any constraint on crossing paths. Our approach is as follows: We first show that in a rectangular area of width w and length l with w = Ω(log l), if the sensor density reaches a certain value, then there exist, with high probability, multiple disjoint sensor barriers across the entire length of the area such that intruders cannot cross the area undetected. On the other hand, if w = o(log l), then with high probability there is a crossing path not covered by any sensor regardless of the sensor density. We then devise, based on this result, an efficient distributed algorithm to construct multiple disjoint barriers in a large sensor network to cover a long boundary area of an irregular shape. Our algorithm approximates the area by dividing it into horizontal rectangular segments interleaved by vertical thin strips. Each segment and vertical strip independently computes the barriers in its own area. Constructing "horizontal" barriers in each segment connected by "vertical" barriers in neighboring vertical strips, we achieve continuous barrier coverage for the whole region. Our approach significantly reduces delay, communication overhead, and computation costs compared to centralized approaches. Finally, we implement our algorithm and carry out a number of experiments to demonstrate the effectiveness of constructing barrier coverage.