Research On Clustering Routing Algorithm Of Heterogeneous Wireless Sensor Networks

Wireless sensor networks(WSNs)use peripheral sensor nodes to monitor designated areas.However,the energy of nodes in WSNs is limited.How to improve energy utilization and extend the network operating cycle has become an important issue.Traditional routing algorithms focus on homogeneous WSNs,and heterogeneous WSNs are the in-depth and promotion of research on homogeneous WSNs.It not only meets the technical requirements of homogeneous networks,but also meets different needs with the help of the characteristics of heterogeneous nodes.Therefore,the research on routing algorithms of heterogeneous WSNs is of great significance.The thesis is based on the energy heterogeneous wireless sensor network.based on the research of LEACH algorithm and DEEC algorithm,Aiming at the problems of random election of cluster heads,poor scalability and unbalanced energy consumption of network nodes,energy balanced cluster routing algorithm(EBCR)and energy balanced multi-hop cluster routing algorithm(EMCR)are proposed.The EBCR algorithm optimizes the threshold formula of the election cluster head while introducing a competition mechanism and an overlap ratio(Overlap)to ensure an even distribution of cluster heads and avoid overlapping of coverage areas.In the process of clustering,in order to avoid hot spots,the concept of node residual energy gradient is introduced to balance the energy consumption between clusters.MATLAB simulation shows that the improved algorithm balances the node energy and improves the network running time.Since the EBCR algorithm uses a single-hop method for inter-cluster communication,in order to improve the scalability of the EBCR algorithm,the EMCR algorithm is proposed.The EMCR algorithm uses a single-hop and multi-hop method to communicate.In order to alleviate the resulting hot issues,the algorithm adopts an improved non-uniform competition mechanism to elect cluster heads,so that cluster heads close to the base station have more energy for receiving and forwarding data between clusters.In the selection of the next-hop cluster head,an energy gradient is established in combination with the number of nodes in the cluster,and a multi-objective decision strategy is used to reduce energy consumption between clusters and avoid hotspot path problems.By comparing and analyzing the performance and network characteristics of EMCR algorithm through MATLAB,the results show that the algorithm has good scalability,and it still has a long stable period and high energy utilization rate under large-scale networks,and the node energy consumption is more balanced;It is suitable for networks with small node density and base stations located in the center of the area.