Research On Hybrid Routing Algorithm For Underwater Wireless Sensor Networks

Underwater wireless sensor networks(UWSNs)are composed of a variety of communication types of sensors,which can be placed either directly underwater or on a specific shallow water surface.Through these sensors,the underwater or water surface information is collected,and the proposed hybrid routing algorithm is used to transmit the data to the ships sailing on the water supply,so that the ships can use this information to complete the task of detecting and performing specific tasks in specific areas,such as marine sampling,environmental monitoring,military technology application,disaster prevention,tactical monitoring and other fields.Nowadays,with the development of modern communication technology,people's demand for underwater communication is more and more obvious.However,compared with the traditional ground wireless sensor network,the characteristics of UWSNs limit the applicability of the existing routing algorithm.These mainly include related issues of physical layer and link layer such as limited bandwidth,severely attenuated channel propagation,long propagation delay and high bit error rate.At the same time,because underwater sensor nodes are powered by batteries,it is difficult to exchange or charge when the power is completely exhausted.Therefore,how to design an underwater sensor network to minimize its power consumption and maximize its network life has become an important academic research topic.In this paper,we study the hybrid routing algorithm of underwater wireless sensor network to achieve the purpose of prolonging the the life of the network.This paper introduces the hybrid routing in three stages.The specific research contents are as follows:(1)Clustering stage:The algorithm selects the cluster head(CH)node based on the Low-Energy Adaptive Clustering Hierarchy(LEACH)protocol.Combined with the SEP algorithm,the node's current remaining energy and position are considered.Different cluster head election probability factors are given for advanced nodes and ordinary nodes,which makes the distribution of CH more uniform.Therefore,the complexity of the short service life of nodes and the imbalance of energy consumption due to the adoption of LEACH protocol is solved.(2)In-cluster data transmission stage:compare the distance from the node to the CH and the base station.When the node is closer to the base station,the node directly communicates with the base station.Otherwise,the communication between the node and the base station through the CH reduces the number of the number of clustering times and saves the energy consumption of the network.(3)Inter-cluster routing stage:the depth and residual energy of nodes are considered firstly.In order to effectively reduce the energy consumption of CH,the methods of distance factor and energy consumption speed factor are introduced to optimize and adjust the threshold function.Then,Dijkstra algorithm is optimized in two aspects,including:a.ignore the unnecessary path;b.introduce the end-to-end path and the residual energy weight function.It avoids unnecessary energy consumption caused only the unique single-hop routing strategy in the LEACH protocol,and realizes the optimal routing of information and data transmission path between the two nodes.The simulation results show that the hybrid wireless routing algorithm effectively balances the energy consumption of the network and increases the service life of the network.