{'fraction_non_alphanumeric': 0.02270081490104773, 'fraction_numerical': 0.002328288707799767, 'mean_word_length': 5.637065637065637, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Underwater Acoustic Sensor Networks With Cost Efficiency for Internet of Underwater Things

Despite the potential benefits of Internet of Underwater Things, a number of issues hinder its realization, including the need for communication reliability and cost-effectiveness. This article aims to optimize network design to implement cost-effective underwater acoustic sensor networks (UASNs) with 3D topology while supporting diverse communication quality of service (QoS) requirements. First, we present an analytical framework based on a queueing system that evaluates communication performances of UASNs, wherein each underwater sensor distributed within a 3D space under the sea surface performs fountain code (FC)-based automatic repeat request (ARQ) transmissions under the slotted-Aloha medium access control protocol. Under the proposed framework, we evaluate communication performances given in terms of successful FC-based ARQ transmission probability and the average queueing delay of an underwater sensor. When evaluating the performances, we formulate the service time of each underwater sensor as a function of network parameters, i.e., the density of data sink and amount of redundancy for FC-based ARQ transmission, before solving a function for accurate service time, such that each sensor can be represented by an M/G/1 queue. Further, our analysis can formulate an optimization problem that aims at minimizing total cost incurred to install and operate 3D UASNs, without compromising two communication QoS requirements. To solve this problem, we propose a recursive algorithm to approach an optimal solution in reasonable time. Numerical evaluations demonstrate the validity of the proposed algorithm.