Research On Energy-balanced Hierarchical Multi-hop WSN Routing Protocol

Wireless sensor network(WSN)is a self-organized network formed by micro wireless sensor nodes,which is usually used to perform communication,monitoring,positioning and tracking tasks.It is widely used in agricultural monitoring,disaster management,military reconnaissance,forest fire tracking,security monitoring,medical and health diagnosis and other occasions.Hierarchical routing protocol is an efficient routing protocol,which has the characteristics of low overhead,low latency,low energy consumption,and high scalability.It has unique advantages in wireless sensor network routing protocols.In order to solve the problem of data collision caused by the introduction of inter-cluster multi-hop in the hierarchical routing protocol,this paper proposes two feasible methods based on the analysis of the source code of the MIT uAMPS LEACH protocol and the study of data collision problem by Heinzelman and other researchers.The solutions of the data collision problem are: the same-cluster different-frequency scheme based on multiple cluster heads and the time-division multiplexing scheme based on unified frame.Corresponding to the proposed scheme,this paper further proposes two routing protocols LEACH-DC and LEACH-TD and implements them on NS2.These two schemes can solve the problem of data collision caused by multi-hop between clusters to varying degrees.The former makes the busy state of the outer cluster head as scattered as possible,reducing the probability of data collision,and is suitable for those that do not require the cluster head and its relay cluster head.It is relatively simple to implement on the LEACH protocol;the latter unifies the frames,the intra-cluster data collection stage is completely separated from the inter-cluster data transmission stage,which can almost avoid data collisions.This method is suitable for occasions where the transmission frequency of the cluster head and its relay cluster head need to the same.The solutions proposed in this paper are to solve the data collision problem from the perspective of practical application.It is a key step to realize inter-cluster multi-hop routing on the LEACH protocol.It is of great significance for the scale expansion of the wireless sensor network and the improvement of the life of the network.In the hierarchical routing protocol for WSN,the cluster head assumes the role of a local gateway.It needs to collect the data in the cluster without sleep and send the fused data to the base station.It tends to fail first,which will cause the network energy consumption to be reduced.Balance is not conducive to the extension of network life.Aiming at this problem,this paper proposes a WSN hierarchical multi-hop routing protocol LEACH-CMF based on a multi-origin minimum generating forest algorithm.The protocol uses a multi-hop mechanism in the cluster and between the clusters at the same time,so that other nodes share the load of the cluster head,so as to achieve the purpose of balancing network energy consumption and extending network life.In addition,this paper uses the time-division multiplexing scheme based on unified frame to improve the allocation of TDMA time slots.It not only avoids data collisions,but makes also all nodes,including the cluster head,sleep as much as possible during the non-working phase,further saving energy consumption.Performance evaluation of the LEACH-CMF protocol by NS2 simulation software shows that the proposed algorithm can effectively balance the energy consumption of nodes and extend the life of the entire network.