High-performance Wireless Sensor Networks Clustering Routing Algorithm Research

Wireless sensor network is an intelligent private network which is composed of a largenumber of sensor nodes with specific functions by self-organizing wireless communication mode.These nodes can convey information and complete specific functions together. Due to itscharacteristics, wireless sensor network has been widely used in many areas. It has greatapplication value. And it is because of its broad application prospect and huge application value,in recent years it has caused wide attention in the world, and more and more people are involvedin the research of wireless sensor network technology. But, transmission between nodes inwireless sensor network, processing data and others all need to rely on battery power.At thesame time, the replacement of battery is difficult or even impossible because of the specialworking environment of wireless sensor network. Therefore, designing an efficient routingalgorithm to minimize the average energy consumption and prolong the lifetime of network isthe key problem for wireless sensor network.Aiming at the problem of energy limited and load imbalance in wireless sensor network,and in order to improve energy utilization efficiency and prolong the network life cycle, we putforward a kind of energy saving routing strategy based on clustering. First of all, divide thenetwork with longitudes and latitudes. Using the idea of non-uniform clustering the network isdivided into areas with different size, those areas which are closer from the gathering node formsmaller and more clusters, in this way the energy consumption used for communication withinthe cluster and data aggregation of the cluster head is less, so that it can compensate the energywhich is used in transmitting cluster head packets of the outer area, and realize the balancedenergy consumption. After the completion of the partition select the optimal cluster-head foreach partition based on the geographic location and residual energy of nodes. Then, thenon-cluster-head nodes join the cluster-head with smaller distance and larger residual energy tobuild clusters. Finally, complete the data transmission process. Because the factors of distanceand residual energy are considered when organizing into clusters and selecting relaying nodes,the energy consumption of the network is further balanced to a certain extent. In addition, thedata fusion algorithm is studied. On the basis of dividing network with the LEACH algorithm,first through the setting of threshold to reduce the data flow and energy of non-cluster-headnodes. And then in order to ensure the accuracy of the data, through the setting of delay time,cluster-head can receive enough data for data fusion. Finally, averaging the data collected bycluster-head greatly reduce the communication traffic between the cluster-head and base station. At the same time, the energy consumption of cluster-head is greatly reduced. The simulationresults show that the two algorithms can optimize the network energy consumption and prolongthe network life cycle.