Abstract

Excessive energy loss is caused by premature node death and lower energy utilization efficiency in underwater acoustic sensor networks. Network-based clustering methods can use a cluster head to fuse data within the cluster members for forwarding, instead of each node forwarding data alone, which can effectively reduce the total energy loss in the process of transmission. Therefore, an energy-efficient adaptive clustering routing algorithm for underwater acoustic sensor network is proposed (ACUN). The algorithm uses a multi-level hierarchical network structure based on the distance between cluster heads and the sink node and the residual energy of a cluster head to determine the size of the competition radius. It can avoid early death of a cluster head away from the sink node because of excessive competition radius leading to excessive energy burdens. When selecting a cluster head, considering node residual energy and the energy loss of a transmission path, the algorithm can select a node with larger residual energy as a cluster head while optimizing network energy consumption. Routing rules are adopted according to the residual energy conditions of the nodes to choose a more energy-efficient single-hop routing node or multi-hop routing in favor of energy balance. Simulation experiments show that the ACUN algorithm compared with the AFP protocol and DEBCR algorithm results in more energy savings and an extended working life of network nodes.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.