Abstract

The dynamic topology, narrow transmission bandwidth, and limited energy of sensor nodes in mobile underwater acoustic sensor networks (UASNs) pose challenges to design an efficient and robust network for underwater communications. In this paper, we propose a novel machine learning-based clustering and routing scheme, named energy-efficient clustering and cooperative routing based on improved K-means and Q-learning (ECRKQ), to reduce and balance energy consumption among sensor nodes in a mobile UASN and improve the bandwidth utilization. In the cluster head (CH) selection stage, ECRKQ modifies the K-means algorithm to dynamically select a CH based on the residual energy of the node and the distance from the node to the centroid in a cluster. In the clustering stage, ECRKQ adopts the Q-learning algorithm by incorporating the residual energy of the CH, the energy consumption of data transmission from the node to the CH, and the energy consumption of the data transmission from the CH to the base station into the Q-value function. In the data transmission stage, ECRKQ applies the dynamic coded cooperation (DCC) transmission to improve the bandwidth utilization and the robustness of the underwater communications. In the DCC transmission, cooperative nodes are also dynamically selected based on the residual energy and the energy consumption of transmitting a packet to their destinations. In the simulation, we apply the ocean current drifting model to emulate the position variation of nodes caused by ocean currents in a mobile UASN. The simulation results show that the proposed ECRKQ scheme can achieve more balanced energy consumption among sensor nodes in a mobile UASN than that of the existing scheme.

Highlights

  • INTRODUCTIONApplying underwater acoustic sensor networks (UASNs) is a key technique in realizing Internet of underwater things (IoUT), which can efficiently explore and utilize marine

  • Applying underwater acoustic sensor networks (UASNs) is a key technique in realizing Internet of underwater things (IoUT), which can efficiently explore and utilize marineThe associate editor coordinating the review of this manuscript and approving it for publication was Fang Yang .resources [1], [2]

  • Motivated by [8], we propose the Energy-efficient Clustering and cooperative Routing protocol based on improved K-means and Q-learning (ECRKQ) to address the energy holes, nodes drift, and narrow bandwidth problem in a UASN

Read more

Summary

INTRODUCTION

Applying underwater acoustic sensor networks (UASNs) is a key technique in realizing Internet of underwater things (IoUT), which can efficiently explore and utilize marine. Non-CH nodes dynamically select a CH according to the reward function, which jointly considers the residual energy of the CH and the energy consumed by the non-CH nodes in sending data to the CH. This dynamic clustering method provides a new idea for underwater clustering to handle underwater nodes floating along with ocean currents. Motivated by [8], we propose the Energy-efficient Clustering and cooperative Routing protocol based on improved K-means and Q-learning (ECRKQ) to address the energy holes, nodes drift, and narrow bandwidth problem in a UASN.

RELATED WORK
THE COOPERATIVE TRANSMISSION MECHANISM IN THE UASNs
UNDERWATER ACOUSTIC ENERGY CONSUMPTION MODEL
DRIFTING MODEL FOR UNDERWATER SENSOR NODES
THE PROPOSED ECRKQ PROTOCAL FOR UASNS
CLUSTER HEAD SELECTION STAGE
Stage 1
18 Stage 3
24 Stage 4
CLUSTERING STAGE
DATA TRANSMISSION STAGE
COST ANALYSIS OF THE PROPOSED ECRKQ
SIMULATION
CONCLUSION
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.