Abstract
The Internet of Underwater Things (IoUT) shows great potential in realizing the smart ocean. Underwater acoustic sensor networks (UWASNs) are the main existing form of IoUT but face with reliable data transmission problems. To tackle this issue, this article considers using the autonomous underwater vehicle (AUV) as a mobile collector to construct a reliable hierarchical information collection system while the Value of Information (VoI) is used as a main metric to measure the Quality of Information (QoI). We first establish a realistic model for characterizing the behaviors of AUV and sensor nodes as well as the challenging environments. Then, to construct a hierarchical architecture, we design a sink node (SN) selection scheme by jointly considering VoI conservation and energy load balancing. After that, we focus on AUV path planning with the objective of maximizing the VoI of the total network. We formulate the problem as a combinatorial optimization problem and provide an integer linear programming (ILP) model for this problem. An optimal algorithm based on the branch-and-bound (BB) method is proposed for seeking for the optimal solution, in which the lower bound and upper bound calculation strategies are specifically designed. Two near-optimal heuristic algorithms based on the concepts of the ant colony algorithm (ACA) and the genetic algorithm (GA) are also provided for further reducing the computation complexity. Finally, simulations validate the effectiveness of the proposed algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.