Strong k-barrier coverage with mobile sensors

2010 ◽  
Author(s):  
Dongsong Ban ◽  
Jie Jiang ◽  
Wei Yang ◽  
Wenhua Dou ◽  
Huizhan Yi
Keyword(s):  
Mobile Sensors ◽  
Barrier Coverage

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

2020 ◽  
Vol 17 (3) ◽  
pp. 737-758
Author(s):  
Zijing Ma ◽  
Shuangjuan Li ◽  
Longkun Guo ◽  
Guohua Wang
Keyword(s):  
Sensor Network ◽  
Mobile Sensors ◽  
Barrier Coverage ◽  
Force Model ◽  
Mobile Sensor ◽  
Mobile Sensor Network ◽  
Virtual Force ◽  
Straight Line ◽  
Non Linear ◽  
Single Sensor

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.

Barrier coverage with line-based deployed mobile sensors

2013 ◽  
Vol 11 (4) ◽  
pp. 1381-1391 ◽  
Author(s):  
Anwar Saipulla ◽  
Cedric Westphal ◽  
Benyuan Liu ◽  
Jie Wang
Keyword(s):  
Mobile Sensors ◽  
Barrier Coverage

“Green” barrier coverage with mobile sensors

2021 ◽  
Vol 860 ◽  
pp. 117-134
Author(s):  
Amotz Bar-Noy ◽  
Thomas Erlebach ◽  
Dror Rawitz ◽  
Peter Terlecky
Keyword(s):  
Mobile Sensors ◽  
Barrier Coverage ◽  
Green Barrier

An Optimization Algorithm for Barrier Coverage in Mobile Sensor Networks

2014 ◽  
Vol 926-930 ◽  
pp. 3485-3488
Author(s):  
Hui Lin Wang
Keyword(s):  
Homeland Security ◽  
Mobile Sensor Networks ◽  
Critical Issue ◽  
Sensor Nodes ◽  
Mobile Sensors ◽  
Barrier Coverage ◽  
Mobile Sensor ◽  
Heterogeneous Sensors ◽  
Security Applications ◽  
Simulation Results

Barrier coverage of heterogeneous sensors with randomly deployed is a critical issue in military and homeland security applications. In this paper we study how to exploit sensor mobility to improve barrier coverage. We presented an efficient algorithm to relocate mobile sensors accord to line so as to improve barrier coverage. The algorithm firstly scans whole barrier and finds out barrier gaps. Then it relocates mobile sensor nodes to fill the gaps with energy consumption limited. Simulation results show that the algorithms can effectively improve the barrier coverage.

Sign in / Sign up

Export Citation Format

Share Document