Monitoring Area Coverage Based on Adjusting Node Spacing in Mixed Underwater Mobile Wireless Sensor Networks

被引:3
作者
Li, Qiangyi [1 ,2 ,3 ]
Liu, Ningzhong [1 ,2 ,3 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Coll Comp Sci & Technol, Nanjing 211106, Jiangsu, Peoples R China
[2] MIIT Key Lab Pattern Anal & Machine Intelligence, Nanjing 211106, Jiangsu, Peoples R China
[3] Collaborat Innovat Ctr Novel Software Technol & I, Nanjing 211106, Jiangsu, Peoples R China
基金
中国国家自然科学基金;
关键词
PERCEIVED PROBABILITY; DEPLOYMENT;
D O I
10.1155/2022/5001662
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Wireless sensor nodes have the characteristics of small size, light weight, simple structure, and limited energy. They are random during deployment in the monitoring area, and the location of nodes is uncertain after deployment. It is easy to have uneven node distribution, resulting in dense nodes in some areas and sparse nodes in some areas. In the area with dense nodes, the monitoring area is covered repeatedly due to the distance between nodes which is too close. In the area with sparse nodes, the problem of covering blind areas appears due to the distance between nodes which is too far. Aiming at the complex structure of underwater wireless sensor networks, a coverage algorithm based on adjusting the nodes spacing is proposed. The algorithm calculates the reasonable distance between adjacent nodes before the wireless sensor node moves. The distance between wireless sensor nodes increases gradually. The simulation results show that the algorithm can make the clustered wireless sensor nodes disperse gradually by reasonably adjusting the distance between wireless sensor nodes, improve the coverage effect of wireless sensor networks, and reduce the energy consumption of wireless sensor nodes.
引用
收藏
页数:23
相关论文
共 36 条
[1]   Connected k-coverage in two-dimensional wireless sensor networks using hexagonal slicing and area stretching [J].
Ammari, Habib M. .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2021, 153 :89-109
[2]   Energy-efficient coverage optimization in wireless sensor networks based on Voronoi-Glowworm Swarm Optimization-K-means algorithm [J].
Chowdhury, Aparajita ;
De, Debashis .
AD HOC NETWORKS, 2021, 122
[3]   Point coverage with heterogeneous sensor networks: A robust optimization approach under target location uncertainty [J].
Eriskin, Levent .
COMPUTER NETWORKS, 2021, 198
[4]   Data Reconstruction Coverage Based on Graph Signal Processing for Wireless Sensor Networks [J].
Feng, Jie ;
Chen, Fangjiong ;
Chen, Hongbin .
IEEE WIRELESS COMMUNICATIONS LETTERS, 2022, 11 (01) :48-52
[5]   Confident Information Coverage Hole Prediction and Repairing for Healthcare Big Data Collection in Large-Scale Hybrid Wireless Sensor Networks [J].
Feng, Jie ;
Chen, Hongbin ;
Deng, Xianjun ;
Yang, Laurence Tianruo ;
Tan, Fangqing .
IEEE INTERNET OF THINGS JOURNAL, 2021, 8 (23) :16801-16813
[6]   Energy Optimization of Wireless Visual Sensor Networks With the Consideration of the Desired Target Coverage [J].
Ghazalian, Reza ;
Aghagolzadeh, Ali ;
Andargoli, Seyed Mehdi Hosseini .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2021, 20 (09) :2795-2807
[7]   A distributed coverage hole recovery approach based on reinforcement learning for Wireless Sensor Networks [J].
Hajjej, Faten ;
Hamdi, Monia ;
Ejbali, Ridha ;
Zaied, Mourad .
AD HOC NETWORKS, 2020, 101
[8]   Energy-Efficient Node Deployment in Heterogeneous Two-Tier Wireless Sensor Networks With Limited Communication Range [J].
Karimi-Bidhendi, Saeed ;
Guo, Jun ;
Jafarkhani, Hamid .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2021, 20 (01) :40-55
[9]   Machine learning algorithms for wireless sensor networks: A survey [J].
Kumar, D. Praveen ;
Amgoth, Tarachand ;
Annavarapu, Chandra Sekhara Rao .
INFORMATION FUSION, 2019, 49 :1-25
[10]   On Energy Hole and Coverage Hole Avoidance in Underwater Wireless Sensor Networks [J].
Latif, Kamran ;
Javaid, Nadeem ;
Ahmad, Ashfaq ;
Khan, Zahoor Ali ;
Alrajeh, Nabil ;
Khan, Majid Iqbal .
IEEE SENSORS JOURNAL, 2016, 16 (11) :4431-4442