MobiBar: Barrier Coverage with Mobile Sensors

Silvestri, Simone

doi:10.1109/glocom.2011.6133536

Cited by 11 publications

(10 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, in [24], the authors deployed a sensor network which consists of both mobile and static sensors, and the mobile sensors can move from a dense area to a sparse area to improve coverage rate. In [25], the authors proposed a distributed algorithm for building k-coverage based on mobile sensors. In [26], a fully distributed algorithm based on virtual force and convex analysis is developed for the objective to relocate the sensors from the original positions to uniformly distribute on the convex hull of the region to building the barrier.…”

Section: Related Workmentioning

confidence: 99%

Minimum Cost Deployment of Bistatic Radar Sensor for Perimeter Barrier Coverage

Zhao

et al. 2019

Sensors

View full text Add to dashboard Cite

Perimeter barriers can provide intrusion detection for a closed area. It is efficient for practical applications, such as coastal shoreline monitoring and international boundary surveillance. Perimeter barrier coverage construction in some regions of interest with irregular boundaries can be represented by its minimum circumcircle and every point on the perimeter can be covered. This paper studies circle barrier coverage in Bistatic Radar Sensor Network (BRSN) which encircles a region of interest. To improve the coverage quality, it is required to construct a circle barrier with a predefined width. Firstly, we consider a BR deployment problem to constructing a single BR circular barrier with minimum threshold of detectability. We study the optimized BR placement patterns on the single circular ring. Then the unit costs of the BR sensor are taken into account to derive the minimum cost placement sequence. Secondly, we further consider a circular BR barrier with a predefined width, which is wider than the breadth of Cassini oval sensing area with minimum threshold of detectability. We propose two segment strategies to efficiently divide a circular barrier to several adjacent sub-ring with some appropriate width: Circular equipartition strategy and an adaptive segmentation strategy. Finally, we propose approximate optimization placement algorithms for minimum cost placement of BR sensor for circular barrier coverage with required width and detection threshold. We validate the effectiveness of the proposed algorithms through theory analysis and extensive simulation experiments.

show abstract

Section: Related Workmentioning

confidence: 99%

Minimum Cost Deployment of Bistatic Radar Sensor for Perimeter Barrier Coverage

Zhao

et al. 2019

Sensors

View full text Add to dashboard Cite

show abstract

“…All these approaches are centralized. Distributed approaches to barrier coverage formation are addressed in [12], [13], [9], [10], [16]. Kong et al [12] used the concept of virtual forces to solve the kbarrier coverage.…”

Section: Related Workmentioning

confidence: 99%

“…Kong et al [12] used the concept of virtual forces to solve the kbarrier coverage. Silvestri [13] presented a novel approach MobiBar that outperforms the algorithm of [12] in k-barrier coverage. Cheng and Savkin [10] presented a decentralized approach of creating 1-barrier coverage between any two prespecified landmarks in the belt region.…”

Section: Related Workmentioning

confidence: 99%

“…However, maintaining the information centrally incurs some overhead. To address this problem, distributed approaches in which sensors locally coordinate to adjust and move to their final positions have also been proposed [9], [10], [11], [12], [13]. However, most of these solutions (centralized or distributed) try to organize all sensors in a straight line to achieve barrier coverage.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Non-linear barrier coverage using mobile wireless sensors

Baheti

Gupta

2017

2017 IEEE Symposium on Computers and Communications (ISCC)

View full text Add to dashboard Cite

Abstract-A belt region is said to be k-barrier covered by a set of sensors if all paths crossing the width of the belt region intersect the sensing regions of at least k sensors. Barrier coverage can be achieved from a random initial deployment of mobile sensors by suitably relocating the sensors to form a barrier. Reducing the movement of the sensors is important in such scenarios due to the energy constraints of sensor devices. In this paper, we propose a centralized algorithm which achieves 1-barrier coverage by forming a non-linear barrier from a random initial deployment of sensors in a belt. The algorithm uses a novel idea of physical behavior of chains along with the concept of virtual force. Formation of non-linear barrier reduces the movement of the sensors needed as compared to linear barriers. Detailed simulation results are presented to show that the proposed algorithm achieves barrier coverage with less movement of sensors compared to other existing algorithms in the literature.

show abstract

“…Some researchers also consider the problem of how to construct barrier coverage by mobile sensors. Silvestri [24] proposes a distributed algorithm to solve the problem of how to construct k-barrier coverage by mobile sensors. Kong et al [25] address the problem of how to construct a barrier coverage enclosing a dynamic object by mobile sensors.…”

Section: Related Workmentioning

confidence: 99%

Minimum Cost Placement of Bistatic Radar Sensors for Belt Barrier Coverage

Wang

Chen

Liu

et al. 2016

IEEE Trans. Comput.

View full text Add to dashboard Cite

How to construct barrier coverage efficiently is a critical problem for many wireless sensor network applications, such as boundary surveillance and intrusion detection. In this paper, we study the belt barrier coverage in bistatic radar sensor networks. Much different from the disk and sector coverage, the coverage area of bistatic radar is dependent on the distance between a pair of radar transmitter and receiver. To improve coverage quality, we require to construct a belt barrier with the breadth not smaller than a predefined threshold. Furthermore, the unit cost of a radar transmitter may be different from a receiver. The bistatic radar placement problem is to construct a belt barrier with the minimum total placement cost.To solve the minimum cost placement problem, we propose a line-based equipartition placement strategy such that all radars placed on a deployment line can form a barrier with some breadth and one or more such placement lines can form a belt barrier with the required breadth. We first study the barrier property of different placement patterns on one deployment line, and prove the structure property of the optimal placement sequence on one deployment line. When multiple deployment lines are needed for belt barrier construction, we propose algorithms to find out the number of deployment lines and the number of receivers in the optimal placement pattern on each deployment line to minimize the total placement cost. The efficiency of the proposed algorithm is also validated by our simulation results.Index Terms-Barrier coverage, barrier breadth, bistatic radar, minimum cost placement. 0018-9340 (c)

show abstract

MobiBar: Barrier Coverage with Mobile Sensors

Cited by 11 publications

References 18 publications

Minimum Cost Deployment of Bistatic Radar Sensor for Perimeter Barrier Coverage

Minimum Cost Deployment of Bistatic Radar Sensor for Perimeter Barrier Coverage

Non-linear barrier coverage using mobile wireless sensors

Minimum Cost Placement of Bistatic Radar Sensors for Belt Barrier Coverage

Contact Info

Product

Resources

About