Barrier coverage with wireless sensors

Kumar, Santosh; Lai, Ten-Hwang; Arora, Anish

doi:10.1145/1080829.1080859

Cited by 492 publications

(264 citation statements)

References 20 publications

Supporting

Mentioning

261

Contrasting

Unclassified

Order By: Relevance

“…Similar to [4]- [7], we define a barrier as a curve in region such that any intrusion path intersects with the curve. We use the following concept as the coverage metric of a barrier.…”

Section: A Optimality Condition For Shortest-barrier-based Placementmentioning

confidence: 99%

“…Barrier coverage has recently emerged as an efficient coverage strategy for numerous sensor network applications centered around intruder detection, such as border monitoring and drug interdiction, and has drawn a surge of research interest [4]- [7]. Despite tremendous research efforts on coverage problems for sensor networks [8], those pertaining to radar sensors remain largely unexplored, and this is the main subject of this paper.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Optimal Placement for Barrier Coverage in Bistatic Radar Sensor Networks

Gong

Zhang

Cochran

et al. 2016

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

By taking advantage of active sensing using radio waves, radar sensors can offer several advantages over passive sensors. Although much attention has been given to multistatic and multiple-input-multiple-output (MIMO) radar concepts, little has been paid to understanding radar networks (i.e., multiple individual radars working in concert). In this context, we study the coverage problem of a bistatic radar (BR) sensor network, which is very challenging due to the Cassini oval sensing region of a BR and the coupling of sensing regions across different BRs. In particular, we consider the problem of deploying a network of BRs in a region to maximize the worst-case intrusion detectability, which amounts to minimizing the vulnerability of a barrier. We show that it is optimal to place BRs on the shortest barrier if it is the shortest line segment that connects the left and right boundary of the region. Based on this, we study the optimal placement of BRs on a line segment to minimize its vulnerability, which is a nonconvex optimization problem. By exploiting certain specific structural properties pertaining to the problem (particularly an important structure of detectability), we characterize the optimal placement order and the optimal placement spacing of the BR nodes, both of which present elegant balanced structures. Our findings provide valuable insights into the placement of BRs for barrier coverage. To our best knowledge, this is the first work to explore the barrier coverage of a network of BRs.Index Terms-Barrier coverage, bistatic radar sensor network, optimal placement, worst-case intrusion.

show abstract

“…Similar to [4]- [7], we define a barrier as a curve in region such that any intrusion path intersects with the curve. We use the following concept as the coverage metric of a barrier.…”

Section: A Optimality Condition For Shortest-barrier-based Placementmentioning

confidence: 99%

mentioning

confidence: 99%

Optimal Placement for Barrier Coverage in Bistatic Radar Sensor Networks

Gong

Zhang

Cochran

et al. 2016

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…In fact, it is a very useful approach for intrusion detection. The idea is that sensors need to be deployed to cover only a path that completely crosses the width or height of the monitored field, in order to detect the crossing of a moving object [44]. When planning the expected level of availability, we can define that the network is available as long as the barrier is maintained, even if some visual sensors become faulty.…”

Section: Availability Evaluationmentioning

confidence: 99%

“…Barrier monitoring can be classified in weak and strong [44]. In weak barrier coverage, sensors must detect an object that is moving along congruent paths, while strong barrier coverage would detect any type of movement behavior.…”

Section: Availability Evaluationmentioning

confidence: 99%

Availability Issues in Wireless Visual Sensor Networks

Costa

Silva

Guedes

et al. 2014

Sensors

View full text Add to dashboard Cite

Wireless visual sensor networks have been considered for a large set of monitoring applications related with surveillance, tracking and multipurpose visual monitoring. When sensors are deployed over a monitored field, permanent faults may happen during the network lifetime, reducing the monitoring quality or rendering parts or the entire network unavailable. In a different way from scalar sensor networks, camera-enabled sensors collect information following a directional sensing model, which changes the notions of vicinity and redundancy. Moreover, visual source nodes may have different relevancies for the applications, according to the monitoring requirements and cameras' poses. In this paper we discuss the most relevant availability issues related to wireless visual sensor networks, addressing availability evaluation and enhancement. Such discussions are valuable when designing, deploying and managing wireless visual sensor networks, bringing significant contributions to these networks.

show abstract

“…k-coverage problem has been formulated based on this requirement. In addition, k-barrier coverage [63] is used to detect an object, that penetrates the protected region. In this case, the sensor network would detect each penetrating object by at least k distinct sensors before it crosses the barrier of wireless sensors.…”

Section: Target-based Coverage Solutionsmentioning

confidence: 99%