Research On Clustering Routing Algorithm In Wireless Sensor Networks

Wireless Sensor Network(The following is called WSN)is a network that can integrate the collection,processing,and transmission of data.At present,the application of WSN has begun to show results in the fields of agriculture,climate,traffic control,and target tracking.With the maturity of research methods,clustering routing algorithm has gradually become one of the hot topics in recent years.This paper elaborates on the various WSN clustering routing algorithms that have been proposed and analyzes their shortcomings.Finally,based on the research of LEACH algorithm and DEEC algorithm,a new clustering routing algorithm is proposed.The newly proposed algorithm performs simulation experiments and compares the performance of the LEACH algorithm and the DEEC algorithm.This article has mainly done several aspects of the study:1.Introduce the concept of WSN,architecture,data collection model and key technologies.Then the specific processes of LEACH algorithm and DEEC algorithm are expatiated.Through the simulation results,the influence of the location of the base station,the proportion of cluster heads,and the size of the region on the performance of the algorithm is analyzed.Finally,the advantages and disadvantages of the two algorithms are analyzed,which is the next step.Research preparation.2.The disadvantages of the DEEC algorithm for the cluster head selection mechanism.This paper proposes a multi-hop clustering routing algorithm based on value-dependent multi-heterogeneous wireless sensor networks(BDMCRA).The algorithm changes the election mechanism of cluster heads from the original random election based on the initial energy and residual energy and the distance between the nodes and the base station.The election mechanism is to balance the network load.Simulation results show that compared with LEACH algorithm and DEEC algorithm,the algorithm achieves the goal of equalizing node energy consumption and extending network lifetime.3.The shortage of LEACH algorithm in clustering and the defect of the DEEC algorithm in the cluster head selection mechanism.This paper proposes an energy-based heterogeneous wireless sensor network routing protocol(OCRP)based on optimal clustering.The OCRP protocol considers the optimal cluster number K,divides the area to be measured into K fixed partitions,and optimizes the clustering process.In the cluster head selection stage,the remaining energy of the node,the energy of the entire network,and the nodes and base stations are fully considered.The distance between them has improved the cluster head election mechanism.Simulation results show that the protocol outperforms the EH-LEACH and DEEC routing protocols in extending network lifetime and energy consumption.