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

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.

scholarly journals Proficient QoS-Based Target Coverage Problem in Wireless Sensor Networks

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 74315-74325 ◽  
Author(s):  
Manju ◽  
Samayveer Singh ◽  
Sandeep Kumar ◽  
Anand Nayyar ◽  
Fadi Al-Turjman ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Target Coverage ◽  
Coverage Problem ◽  
Target Coverage Problem

scholarly journals Simulated Annealing Application to Maximum Lifetime Coverage Problem in Wireless Sensor Networks

10.29007/gl61 ◽  
2018 ◽  
Author(s):  
Antonina Tretyakova ◽  
Franciszek Seredynski
Keyword(s):  
Wireless Sensor Networks ◽  
Simulated Annealing ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Maximization Problem ◽  
Main Task ◽  
Coverage Problem ◽  
Wsn Lifetime ◽  
Efficient Performance ◽  
Hard Problems

Energy optimization problem in Wireless Sensor Networks (WSN) is a backbone of efficient performance of sensor network consisting of small devices with limited and non-recovering battery. WSN lifetime maximization problem under assumption of that the coverage is main task of the network is known as Maximal lifetime coverage problem (MLCP).This problem belongs to a class of NP-hard problems. In this paper we propose a novel simulated annealing (SA) algorithm to solve MLCP. The proposed algorithm is studied for high dense WSN instances under different parameter setup.

Sign in / Sign up

Export Citation Format

Share Document