On k-coverage in a mostly sleeping sensor network
Proceedings of the 10th annual international conference on Mobile computing and networking
Barrier coverage with wireless sensors
Proceedings of the 11th annual international conference on Mobile computing and networking
Designing localized algorithms for barrier coverage
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Strong barrier coverage of wireless sensor networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Wireless sensor network survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Lifetime maximization for connected target coverage in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Energy-efficient coverage problems in wireless ad-hoc sensor networks
Computer Communications
A distributed self-deployment algorithm for the coverage of mobile wireless sensor networks
IEEE Communications Letters
Coverage Control in Sensor Networks
Coverage Control in Sensor Networks
A coverage-aware clustering protocol for wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
Barrier coverage with line-based deployed mobile sensors
Ad Hoc Networks
Hi-index | 0.00 |
The barrier coverage problem is one of the most important issues in wireless sensor networks (WSNs). In previous research, scholars did not consider the actual density of sensors in the area. As a result, their algorithms might require sensors to move a longer distance to form a barrier. A longer distance of movement means more energy consumption. This requirement is disadvantageous to sensors with limited energy. In this paper, we consider the actual density of sensors in solving the barrier coverage problem in an attempt to minimize the moving distances of mobile sensors and further enhance the network lifetime of the barrier. We propose a density-barrier construction algorithm that involves the following operations: First of all, a barrier that requires the minimum total moving distance for all sensors is constructed using the least squares line approach. Through recursive elimination of outlier sensors, a new barrier can be obtained. The algorithm will find the assembly points on this barrier and the optimal assembly point for each barrier member respectively. Finally, the algorithm uses the hole-handling mechanism to achieve barrier construction and improve the network lifetime. In this paper, the variation in network lifetime under different settings of the outlier value is also analyzed through simulation experiments.