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

Abstract

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.