Routing Research Based On Multi-Leader Strategy And Multi-Path Technology In Wireless Sensor Network

As one of the top ten emerging technologies in the future,wireless sensor network provides people with a new and effective way to obtain information of objective world,which makes the internet of everything become a reality and attracts increasing research attention in recent years.However,due to the dynamic network topology and the limited energy resources,how to design an effective algorithm to reduce energy consumption and improve network performance has become one of the most hot topics in wireless sensor network.In this thesis,we mainly discuss the routing algorithms and protocols design for reducing energy consumption and improving data throughput.The main contributions of this thesis are summarized as follows:1.The optimization problem of hierarchical routing protocol LEACH is studied.We expand the two-layer network architecture in the LEACH protocol to three-layer by using different network clustering algorithms and node sorting algorithms,so as to ensure the energy consumption balance of nodes and extend the network life cycle.Firstly,we propose the network partition strategy based on clustering algorithms to solve the problem of excessive energy consumption and imbalance caused by the long communication distance and the lack of consideration of the distribution of sensor nodes in traditional routing protocols in large-scale network environment.And we optimize the partition number in the spectral method and the distance radius in the density and distance algorithm,and then we compare the influence of different clustering algorithms on network partitioning.Secondly,without considering the distribution of node's location,the energy consumption and data overhead problems caused by frequent communication times,data conflicts,data loss and data retransmission,exist in the most of the existing routing protocols.We construct a three-layer network architecture by using two different node ranking algorithms including Google PageRank algorithm and Closeness Centrality algorithm to select the leader node,and divide the nodes into three different groups:the leader nodes,the cluster head nodes and the common nodes.In addition,in order to guarantee the effectiveness of the new proposed algorithm,we design a dual feedback mechanism by monitoring the residual energy of the leader node and the number of surviving nodes in the region.Finally,through a series of simulation experiments,it is verified that the new algorithm can prolong the network life cycle while reducing energy consumption.2.The optimization problem of multi-path routing algorithm is studied,we design a new fitness function with comprehensive consideration the multi-dimensional factors such as energy consumption,residual energy and hop count.Genetic Algorithm is used to optimize multi-path routing to improve the network robustness and the reduce energy consumption.Firstly,for the problem of heavy load of some nodes and path failure in the single path routing algorithm,we propose a multi-path routing algorithm for parallel data transmission to reduce the load of nodes and prolong the life cycle of nodes.Secondly,for the problem of route unavailability caused by only considering a single factor in the traditional multi-path algorithms,such as the existence of a route is incapable of forwarding data due to the insufficient residual energy of some intermediate node,we propose a multi-dimensional multi-path algorithm to reduce the probability of route unavailability.Finally,the comparative simulations reveal that the new proposed approach provides better performance than the existing single path routing algorithm and traditional multipath routing algorithm.The new algorithm can effectively reduce energy consumption and improve network performance.