Barrier Coverage Problem in 2D

2019 ◽  
pp. 118-130 ◽  
Author(s):  
Adil Erzin ◽  
Natalya Lagutkina
Keyword(s):  
Barrier Coverage ◽  
Coverage Problem

Minimizing the Maximum Moving Cost of Interval Coverage

2017 ◽  
Vol 27 (03) ◽  
pp. 187-205 ◽  
Author(s):  
Victor C. S. Lee ◽  
Haitao Wang ◽  
Xiao Zhang
Keyword(s):  
Line Segment ◽  
Barrier Coverage ◽  
Mobile Sensor ◽  
Coverage Problem ◽  
Weighted Version ◽  
Nonnegative Weight ◽  
Covering Interval ◽  
Interval Coverage

In this paper, we consider an interval coverage problem. We are given [Formula: see text] intervals of the same length on a line [Formula: see text] and a line segment [Formula: see text] on [Formula: see text]. Each interval has a nonnegative weight. The goal is to move the intervals along [Formula: see text] such that every point of [Formula: see text] is covered by at least one interval and the maximum moving cost of all intervals is minimized, where the moving cost of each interval is its moving distance times its weight. Algorithms for the “unweighted” version of this problem have been given before. In this paper, we present a first-known algorithm for this weighted version and our algorithm runs in [Formula: see text] time. The problem has applications in mobile sensor barrier coverage, where [Formula: see text] is the barrier and each interval is the covering interval of a mobile sensor.

A study on the weak barrier coverage problem in wireless sensor networks

2011 ◽  
Vol 55 (3) ◽  
pp. 711-721 ◽  
Author(s):  
Lei Li ◽  
Baoxian Zhang ◽  
Xiaojun Shen ◽  
Jun Zheng ◽  
Zheng Yao
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Barrier Coverage ◽  
Coverage Problem

A Minimalist Solution to the Multi-robot Barrier Coverage Problem

2021 ◽  
pp. 349-353
Author(s):  
Thomas Green ◽  
Kevin Kamel ◽  
Siyuan Li ◽  
Christopher Shinn ◽  
Paolo Toscano ◽  
...  
Keyword(s):  
Barrier Coverage ◽  
Coverage Problem ◽  
Multi Robot

Self-deployment of mobile robotic sensor networks for multilevel barrier coverage

Robotica ◽  
2011 ◽  
Vol 30 (4) ◽  
pp. 661-669 ◽  
Author(s):  
Teddy M. Cheng ◽  
Andrey V. Savkin
Keyword(s):  
Sensor Networks ◽  
Numerical Simulations ◽  
Local Information ◽  
Barrier Coverage ◽  
Coverage Problem ◽  
Decentralized Coordination ◽  
Robotic Sensor ◽  
Simple Rules ◽  
Robotic Sensor Networks ◽  
Robotic Sensors

SUMMARYWe study a problem of K-barrier coverage by employing a network of self-deployed, autonomous mobile robotic sensors. A decentralized coordination algorithm is proposed for the robotic sensors to address the coverage problem. The algorithm is developed based on some simple rules that only rely on local information. By applying the algorithm to the robotic sensors, K layers of sensor barriers are formed to cover the region between two given points. To illustrate the proposed algorithm, numerical simulations are carried out for a number of scenarios.

scholarly journals Solving k-Barrier Coverage Problem Using Modified Gravitational Search Algorithm

2017 ◽  
Vol 2017 ◽  
pp. 1-12
Author(s):  
Yanhua Zhang ◽  
Xingming Sun ◽  
Zhanke Yu
Keyword(s):  
Particle Swarm Optimization ◽  
Search Algorithm ◽  
Gravitational Search Algorithm ◽  
Particle Swarm ◽  
Barrier Coverage ◽  
Coverage Problem ◽  
Swarm Optimization ◽  
Hybrid Particle Swarm Optimization ◽  
Mutation Strategy ◽  
Gravitational Search

Coverage problem is a critical issue in wireless sensor networks for security applications. The k-barrier coverage is an effective measure to ensure robustness. In this paper, we formulate the k-barrier coverage problem as a constrained optimization problem and introduce the energy constraint of sensor node to prolong the lifetime of the k-barrier coverage. A novel hybrid particle swarm optimization and gravitational search algorithm (PGSA) is proposed to solve this problem. The proposed PGSA adopts a k-barrier coverage generation strategy based on probability and integrates the exploitation ability in particle swarm optimization to update the velocity and enhance the global search capability and introduce the boundary mutation strategy of an agent to increase the population diversity and search accuracy. Extensive simulations are conducted to demonstrate the effectiveness of our proposed algorithm.

scholarly journals Approximate Optimal Deployment of Barrier Coverage on Heterogeneous Bistatic Radar Sensors

Sensors ◽  
2019 ◽  
Vol 19 (10) ◽  
pp. 2403
Author(s):  
Xianghua Xu ◽  
Chengwei Zhao ◽  
Zongmao Cheng ◽  
Tao Gu
Keyword(s):  
Sensor Networks ◽  
Coupling Effect ◽  
Minimum Cost ◽  
Approximate Algorithm ◽  
Barrier Coverage ◽  
Optimal Placement ◽  
Coverage Problem ◽  
Placement Problem ◽  
Simulation Experiments ◽  
Radar Sensors

Heterogeneous Bistatic Radars (BR) have different sensing ranges and couplings of sensing regions, which provide more flexible coverage for the boundary at complex terrain such as across rivers and valleys. Due to the Cassini oval sensing region of a BR and the coupling of sensing regions among different BRs, the coverage problem of BR sensor networks is very challenging. Existing works in BR barrier coverage focus mainly on homogeneous BR sensor networks. This paper studies the heterogeneous BR placement problem on a line barrier to achieve optimal coverage. 1) We investigate coverage differences of the basic placement sequences of heterogeneous BRs on the line barrier, and prove the optimal basic placement spacing patterns of heterogeneous BRs. 2) We study the coverage coupling effect among adjacent BRs on the line barrier, and determine that different placement sequences of heterogeneous BR transmitters will affect the barrier’s coverage performance and length. The optimal placement sequence of heterogeneous BR barrier cannot be solved through the greedy algorithm. 3) We propose an optimal BRs placement algorithm on a line barrier when the heterogeneous BR transmitters’ placement sequence is predetermined on the barrier, and prove it to be optimal. Through simulation experiments, we determine that the different placement sequences of heterogeneous BR transmitters have little influence on the barrier’s maximum length. Then, we propose an approximate algorithm to optimize the BR placement spacing sequence on the heterogeneous line barrier. 4) As a heterogeneous barrier case study, a minimum cost coverage algorithm of heterogeneous BR barrier is presented. We validate the effectiveness of the proposed algorithms through theory analysis and extensive simulation experiments.

k-barrier coverage reliability evaluation for wireless sensor networks using two-dimensional k-within-consecutive-r × s-out-of-m × n:F system

2019 ◽  
Vol 233 (6) ◽  
pp. 1029-1039
Author(s):  
Qiang Liu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Positive Integer ◽  
Recursive Algorithm ◽  
Wireless Sensor ◽  
Barrier Coverage ◽  
Horizontal Distance ◽  
Two Dimensional ◽  
Coverage Problem ◽  
Integer Multiple

The reliability of k-barrier coverage for wireless sensor networks is evaluated in this article. We construct a two-dimensional k-within-consecutive- r ×  s-out-of- m ×  n:F system to describe the k-barrier coverage problem and propose the definition of the k-barrier coverage reliability. If the sensing radius r of each sensor is equal to half of the horizontal distance d between two adjacent sensors, then the formula for calculating the k-barrier coverage reliability can be derived directly. If r is a positive integer multiple of d, then a recursive algorithm is applied to calculate the coverage reliability. The effects of the probability that sensors are active, the number of rows of deployed sensors and the number of sensors in each row on the coverage reliability are also analyzed using some illustrative examples. The results show that, if r =  d/2, the reliability of a barrier decreases with an increase in the length of the barrier; if r =  t ×  d ( t is a positive integer), the reliability of a barrier hardly decreases with an increase in the length of the barrier.

Sign in / Sign up

Export Citation Format

Share Document