Research On Optimization Of Cluster Routing Of Underwater Acoustic Sensor Networks

The underwater acoustic sensor network has been widely used in industrial,national defense,environment and other fields,and it's an Internet of things technology which has always been highly valued by research institutions and researchers at home and aboard.UASNs consist of a limited number of acoustic sensor nodes which usually use a battery that is electrically charged.However,UASNs are generally under water and even deep water environment,making it difficult for sensor nodes to be replenished,and the cost of redeploying or replacing these sensor nodes is too high.Therefore,how to save the energy consumption of the whole network and prolong the survival time of the network has always been a very important subject of UASNs research.The optimization of routing protocols has a direct impact on the uplift of UASNs,which is one of the key topics in UASNs research.The cluster routing algorithm is a type of routing protocol,by dividing the network node into a finite number of cluster management,and it has good extensibility,it can effectively enhance the network energy efficiency,and now the cluster routing algorithm has been applied to Wireless Sensor network WSNs.First,this article elaborated the UASNs selected topic reason,the research significance and research status.Secondly,it introduces some of the relevant knowledge of UASNs,including its features,applied background,topology,routing protocols,and the major problems of UASNs design.Thirdly,the related models of UASNs are described,including system model,energy consumption model and relay model.Finally,in view of the existing UASNs Clustering Routing algorithm exist some problems in the part of the optimization improvement,this paper proposes a Layered three-dimensional underwater sensor network Clustering Routing algorithm,the LCR.In the algorithm of this paper,a new hierarchical clustering routing algorithm is applied to the network model of UASNs.According to the spacing of the distance between the base station node and the base station node,the cluster head can be more evenly distributed under certain layer spacing.In the election cluster head,the comprehensive attribute value of the node is taken into consideration,and the cluster head election in each layer can make the cluster head distribution more evenly distributed in each layer.As a cluster,the competition radius of the cluster head node is used,so that the smaller the cluster size of the node is,the energy consumption of the cluster head node can be balanced.Meanwhile,considering the distance between the node and the base station and the distance between the cluster head node and the base station,the energy consumption of the entire network data transmission can be reduced.In data transmission phase,draw lessons from relaying the ideas of the model,using the given the depth and residual energy of nodes routing function to find the best of the next-hop node,can reduce consumption of data relay forwarding path.Finally,through MATLAB simulation,by comparing the LCR of this algorithm with the existing representative algorithm LEACH and the algorithm DEBCR,the feasibility of this algorithm and the existence of effective and balanced energy consumption can be verified to extend the network life and other advantages.