Research On Hybrid Routing Algorithm Of Wireless Sensor Networks Based On ERouA

The wide application of wireless sensor network has changed the life style of human to some extent,and the prospect of this technology is very great.At present,the preferred path algorithm of wireless sensor network is mainly based on the research of the dynamic sensor network,mainly concentrated in the local routing update,the network life cycle,but there are still some problems: 1)the overall network energy distribution is not uniform;2)the randomness of intermediate node data collection tree selection is relatively large;3)the adjustment of the key node is not timely;4)the network is vulnerable to malicious attacks.In view of the problems of current wireless sensor network routing algorithm,this paper proposes a algorithm for updating local routing algorithm based on residual energy(R-ERouA),the network has the characteristics of long service life,high safety,mainly to solve problem of the network energy distribution is not uniform,the adjustment of the intermediate nodes is not timely and vulnerable to malicious attacks and other problems,after using simulation,and it achieved good results,the innovation of the algorithm is mainly reflected in the following three aspects:(1)In the process of selecting and constructing a data collection tree,the residual energy of the node is used as a parameter to select an intermediate node.The residual energy of nodes is introduced into the algorithm,and the location of nodes in data collection tree is allocated by remaining energy of nodes,so that the overall energy of the network is balanced,and the selection of intermediate nodes is more reasonable.(2)In order to maintain the energy balance of the network,this paper proposes a new local routing update trigger condition and update method,thereby increasing the flexibility of nodes,and nodes can adjust their locations timely according to their own conditions.(3)In order to ensure the security of the algorithm,this paper proposes security strategy of node security based on trust,we integrate the two research directions of routing update and network security,and determine the node security in the process of routing,so as to ensure the safety of the network.Finally through the experiment compared with other algorithms,this paper analyse the effectiveness of the network life cycle of the algorithm from the life cycle of the network and the remaining energy,this paper analyse the security of the algorithm from the effective data transfer rate and the time interval of the malicious nodes were found and removed in time.Finally,this paper analyse the influence of weight coefficient on the security experiment results.We can see that the algorithm proposed in this paper can prolong the lifetime of network,identify and delete malicious nodes quickly,and ensure the security of network.