Barrier Coverage

Suppose sensors are deployed randomly in a long thin strip, and suppose each sensor can detect objects within a fixed distance. We say that the sensors achieve barrier coverage if there is no path across the strip that a small object can follow that avoids detection by the sensors. We give fairly pr...

Full description

Saved in:
Bibliographic Details
Published in:Random structures & algorithms 2016-10, Vol.49 (3), p.429-478
Main Authors: Balister, Paul, Bollobás, Béla, Sarkar, Amites
Format: Article
Language:English
Subjects:
Algorithms
Barriers
connectivity
coverage
Failure
Poisson process
random geometric graphs
Sensors
Strip
wireless sensor networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Suppose sensors are deployed randomly in a long thin strip, and suppose each sensor can detect objects within a fixed distance. We say that the sensors achieve barrier coverage if there is no path across the strip that a small object can follow that avoids detection by the sensors. We give fairly precise results on the probability that barrier coverage is achieved as a function of the range of the sensors, the height and length of the strip, and the number of sensors deployed. In particular, we show that the most likely obstruction—a rectangular region crossing the strip which is devoid of sensors—does not in general dominate the probability of failure of barrier coverage. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 49, 429–478, 2016
ISSN:1042-9832
1098-2418
DOI:10.1002/rsa.20656