District Partition-Based Data Collection Algorithm With Event Dynamic Competition in Underwater Acoustic Sensor Networks

被引:76
作者
Han, Guangjie [1 ]
Tang, Zhengkai [1 ]
He, Yu [1 ]
Jiang, Jinfang [1 ]
Ansere, James Adu [1 ]
机构
[1] Hohai Univ, Dept Informat & Commun Syst, Changzhou 213022, Peoples R China
基金
中国国家自然科学基金;
关键词
Data collection; Heuristic algorithms; Task analysis; Vehicle dynamics; Partitioning algorithms; Underwater acoustics; Navigation; district partition; dynamic competition; underwater acoustic sensor networks; ROUTING PROTOCOL; VEHICLES;
D O I
10.1109/TII.2019.2912320
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The advent of underwater acoustic sensor networks (UASNs) has enhanced marine environmental monitoring, auxiliary navigation, and marine military defense. One of the core functions of UASNs is data collection. However, current underwater data collection schemes generally encounter problems such as high energy consumption and high latency. Furthermore, the application of multiple autonomous underwater vehicles (AUVs) has contributed to more problems of task assignment and load balancing. This leads to significant failure in data collections and controlling of spontaneous emergencies. To address these problems, a district partition-based data collection algorithm with event dynamic competition in UASNs has been proposed. In this algorithm, the value of information of the packet determines the priority of its transmission to the cluster head. The navigation position of the mobile sink and the area under the responsibility of each AUV are determined by the spatial region division. The path of the AUV in the subregion is then planned using reinforcement learning. Subsequently, the dynamic competition of multiple AUVs is used to handle emergency tasks. The simulation demonstrates that our proposed algorithm significantly reduces energy consumption to guarantee load balancing while reducing end-to-end transmission delay.
引用
收藏
页码:5755 / 5764
页数:10
相关论文
共 28 条
[1]   End-to-End Delay and Energy Efficient Routing Protocol for Underwater Wireless Sensor Networks [J].
Ali, Tariq ;
Jung, Low Tang ;
Faye, Ibrahima .
WIRELESS PERSONAL COMMUNICATIONS, 2014, 79 (01) :339-361
[2]  
Arrichiello F., 2009, P INT C ROB COMM COO, P1
[3]   Multi-AUV cooperative target search and tracking in unknown underwater environment [J].
Cao, Xiang ;
Sun, Hongbing ;
Jan, Gene Eu .
OCEAN ENGINEERING, 2018, 150 :1-11
[4]   Data gathering problem with the data importance consideration in Underwater Wireless Sensor Networks [J].
Cheng, Chien-Fu ;
Li, Lung-Hao .
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2017, 78 :300-312
[5]   Mutual Information-Based Multi-AUV Path Planning for Scalar Field Sampling Using Multidimensional RRT* [J].
Cui, Rongxin ;
Li, Yang ;
Yan, Weisheng .
IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2016, 46 (07) :993-1004
[6]   Underwater Sensor Networks: A New Challenge for Opportunistic Routing Protocols [J].
Darehshoorzadeh, Amir ;
Boukerche, Azzedine .
IEEE COMMUNICATIONS MAGAZINE, 2015, 53 (11) :98-107
[7]  
Freitag L., 2005, OCEANS MTS IEEE WASH
[8]   Void-Handling Techniques for Routing Protocols in Underwater Sensor Networks: Survey and Challenges [J].
Ghoreyshi, Seyed Mohammad ;
Shahrabi, Alireza ;
Boutaleb, Tuleen .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2017, 19 (02) :800-827
[9]   Path Finding for Maximum Value of Information in Multi-Modal Underwater Wireless Sensor Networks [J].
Gjanci, Petrika ;
Petrioli, Chiara ;
Basagni, Stefano ;
Phillips, Cynthia A. ;
Boloni, Ladislau ;
Turgut, Damla .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2018, 17 (02) :404-418
[10]   A High-Availability Data Collection Scheme based on Multi-AUVs for Underwater Sensor Networks [J].
Han, Guangjie ;
Long, Xiaohan ;
Zhu, Chuan ;
Guizani, Mohsen ;
Zhang, Wenbo .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2020, 19 (05) :1010-1022