Resarch And Improved Algorithm On Wireless Sensor Routing Protocol Based On Energy Optimization

Wireless Sensor Networks(WSN)consists of SINK node with data collection capabilities and a large number of sensor nodes deployed randomly in a complex environment,in which nodes communicate with other nodes by self-organization.Since wireless sensor networks were raised in the seventies of the 20 th century,WSNs have been increasingly recognized and applied.Especially in recent years,with the rise of “Internet of things”,wireless sensor networks have penetrated into many fields,such as aviation,military,agriculture,furniture,industry and so on.Wireless sensor nodes are assembled with calculation modules,communication module and perception module.The main energy consumption of sensor nodes is CPU and wireless transceiver.According to statistics,the energy consumption of data transmission reached to 80% of the entire sensor networks energy consumption.However,the senor nodes are usually powered by batteries.In other words,when sensor nodes are deployed,it is very difficult to replace or charge the batteries in complex environment.So it's important to design a enery-balanced wireless sensor routing protocol.In this thesis,the related works of domestic and international routing protocols are studied,and proposes an improved algorithm based on the clustering routing protocol.The main research contents of this thesis are as follows:(1)Aiming at reducing the number or redundant nodes,this thesis introduces a type of sleep schedule algorithm based on nodes' location.This algorithm calculate the redundant coverage based on the information of it's neighbors.The algorithm will let the sensor nodes go sleep by judging whether it is redundant in the algorithm.The simulation results and theoretical analysis show that the algorithm can effectively reduce the number of the redundant nodes.(2)The energy consumption of some nodes in the wireless sensor networks is unbalanced,resulting in some sensor nodes consume more energy than others and leading to “hot zone” problem.Considering the energy and distribution of nodes in the network,the thesis propose an uneven clustering routing based on energy optimization to solve the problem.It forms the uneven competition radius of nodes in the Clustering competition stage.Furthermore,the energy and the average of distance factors of nodes are calculated using the information of neighbors.With these factors,nodes with higher energy and more evenly distributed neighbor nodes are more likely to be cluster head.Using cluster head's residual energy,distance and intra-cluster residual energy to select the relay nodes,then built data routing tree for data transmission.The path is established by selecting clusters,which ensures that the energy consumption of the route is more balanced.Finally,the proposed sleep scheduling algorithm is introduced to make the redundant sleep.The computer simulation proved that comparing with LEACH and EEUC,this routing protocol can reduce and balance the energy consumption efficiently,prolonging the wireless sensor network survival period.