| Wireless Sensor Network(WSN)as an emerging technology for data collection has become a research hotspot in the academic community in recent years.WSN have been widely used in environmental monitoring,military reconnaissance,and other fields due to their features of easy deployment,scalability,and high reliability.However,due to the limited energy of sensor nodes,WSN are greatly restricted in practical applications.Therefore,improving energy efficiency to prolong the network lifetime has become a key focus of WSN research.This article focuses on the issues of energy balance and hot-spot path in WSN,and studies and improves the cluster routing algorithm.The main research content is as follows:(1)In order to address the issue of low and uneven energy utilization caused by randomly selecting cluster heads,the energy balance bilevel decision-making clustering routing algorithm(EBBD)is proposed for cluster head election,which utilizes a two-layer decision-making approach.In the first layer,the remaining energy and node density are considered to select temporary cluster heads,while in the second layer,node proximity and centrality are taken into account to identify more suitable cluster heads and reduce the average energy consumption of the entire network.A competition mechanism is also introduced in the second layer to avoid overlapping of cluster heads and achieve a more even distribution of cluster heads in the network,optimizing the number of cluster heads to some extent.During the node clustering phase,multiple indicators are integrated to optimize the node clustering and avoid uneven energy consumption between nodes.Furthermore,a dynamic clustering scheme based on energy is proposed to reduce the additional energy consumption of control messages caused by frequent clustering.It can be seen from the simulation results that the EBBD algorithm effectively balances the energy consumption between nodes and prolongs the life cycle of the network.(2)In order to address the issue of hot spot in node communication,the inter-cluster relay clustering routing algorithm based on data distribution(IRDD)is proposed.This algorithm first derives an optimal formula for the number of cluster heads based on inter-cluster communication characteristics,and then optimizes the selection of cluster heads based on a non-uniform competition mechanism.Additionally,the reliable area of inter-cluster relays is determined based on an energy consumption analysis,and inappropriate cluster head nodes are filtered out.Finally,the idea of data distribution is introduced in inter-cluster routing selection,and a multi-objective decision matrix is used to determine the corresponding cost factors for relay cluster head selection.This effectively implements inter-cluster relay communication,avoiding uneven energy consumption between cluster heads caused by hot spot paths,and allowing the IRDD algorithm to better adapt to wireless sensor networks of different scales.Simulation results show that the IRDD algorithm can effectively extend the network’s lifespan even in large-scale networks and achieve energy balance between nodes. |
