Routing Protocol Based On Optimal Clustering Algorithm For Wireless Sensor Networks

Wireless Sensor Network(WSN)is composed of a large number of sensor nodes deployed randomly in the monitoring area.Because of their self-organization and low power consumption,wireless sensor network has a very wide application prospect.However,the energy of sensor nodes is limited,and it is difficult to recharge,so how to reduce the energy consumption of the network and prolong the life cycle of the network is the key problem of the research.Clustering routing protocol as an effective energy optimization strategy for wireless sensor network has important research significance.Based on the existing clustering routing protocol,this paper optimizes the clustering algorithm and simulates the feasibility and performance of the improved algorithm.Firstly,in the phase of network initialization,the calculation formula of the optimal cluster head number under cluster multi-hop mode is derived on the basis of single-hop among clusters,which can be divided into two cases of data fusion and non-fusion,and the calculation of the optimal cluster head number is optimized.When determining the competitive radius of nodes,the node degree is added on the basis of the original distance adaptive adjusting radius,and the adjustment coefficient is introduced to control the fluctuation range of the competitive radius,the problem of unreasonable cluster structure is improved,and the energy consumption of the network is reduced.Secondly,in the phase of clustering,a weight function is defined for each node when performing the cluster head election,the definition of weight includes residual energy,energy consumption speed,node degree,and the distance from node to base station.Nodes become cluster heads by way of election according to the weight and competition radius,which ensures the rationality of cluster head distribution and the stability of cluster heads.When cluster heads rotation is performed,cluster heads are no longer selected for each round of the whole network,but are divided into network-wide election and intra-cluster election according to the dynamic change of energy,thereby avoiding unnecessary energy consumption and prolonging the life cycle of the network.Finally,the isolated nodes in the network are processed.The isolated nodes select the best cluster to join according to the cluster energy consumption.After the isolated nodes enter the cluster,the base station can receive more data and ensure the integrity of the data.In the phase of stabilization,greedy algorithm is used to build the optimal path to transmit data.