Strong k-barrier coverage with mobile sensors

Ban, Dongsong; Jiang, Jie; Yang, Wei; Wang, Dou; Yi, Huizhan

doi:10.1145/1815396.1815413

Cited by 10 publications

(12 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A central device can compute the final location of each mobile sensor and then sensors can move directly to their final location. The work in [2] constructed linear k barriers by dividing the region into subregions and forming a baseline grid barrier and an isolation grid barrier in each subregion. However, a large number of redundant sensors are needed for constructing isolation grid barriers.…”

Section: Related Workmentioning

confidence: 99%

“…All the above algorithms formed linear barriers, which means the sensors in the barriers must locate on a straight line. The work in [1] proposed an energy-efficient algorithm based on virtual force to form non-linear barrier coverage, which outperformed the linear barrier algorithms in the work [2]. The work in [16] proposed a centralized algorithm to form barriers with mobile sensors under the influence of both sunny and rainy days.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Energy-efficient non-linear k-barrier coverage in mobile sensor network

Guo

et al. 2020

COMSIS J

View full text Add to dashboard Cite

K-barrier coverage is an important coverage model for achieving robust barrier coverage in wireless sensor networks. After initial random sensor deployment, k-barrier coverage can be achieved by moving mobile sensors to form k barriers consisting of k sensor chains crossing the region. In mobile sensor network, it is challenging to reduce the moving distances of mobile sensors to prolong the network lifetime. Existing work mostly focused on forming linear barriers, that is the final positions of sensors are on a straight line, which resulted in large redundant movements. However, the moving cost of sensors can be further reduced if nonlinear barriers are allowed, which means that sensors? final positions need not be on a straight line. In this paper, we propose two algorithms of forming non-linear k barriers energy-efficiently. The algorithms use a novel model, called horizontal virtual force model, which considers both the euclidean distance and horizontal angle between two sensors. Then we propose two barrier forming algorithms. To construct a barrier, one algorithm always chooses the mobile sensor chain with the largest horizontal virtual force and then flattens it, called sensor chain algorithm. The other chooses the mobile sensor with the largest horizontal virtual force to construct the barrier, other than the mobile sensor chain, called single sensor algorithm. Simulation results show that the algorithms significantly reduce the movements of mobile sensors compared to a linear k-barrier coverage algorithm. Besides, the sensor chain algorithm outperforms the single sensor algorithm when the sensor density becomes higher.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Energy-efficient non-linear k-barrier coverage in mobile sensor network

Guo

et al. 2020

COMSIS J

View full text Add to dashboard Cite

show abstract

“…When some extra sensors (over the minimum number required) are available, forming a non-linear barrier can reduce the movement of the sensors and consequently cause less energy usage. Ban et al [17] also presented a more general k-barrier coverage algorithm that creates a non-linear grid barrier by breaking the region into subregions, forming linear barriers in each subregions, and then forming vertical isolation barriers between subregions to connect the horizontal barriers. However, the algorithm uses very large number of redundant sensors, and for 1-barrier coverage (k = 1), provides no significant advantage over the CBGB algorithm.…”

Section: Related Workmentioning

confidence: 99%

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

“…The problem of barrier coverage [17], [18], [19], [20], [21], [22], [23], [24], [25], [26] has a similar placement scenario to the belt coverage problem, but there are some distinct differences in the two problems. The main purpose of the belt coverage is to cover all the points within the belt.…”

Section: Related Workmentioning

confidence: 99%