Research Of An Energy-efficient Routing Algorithm Based On Improved GAF In WSN

Wireless Sensor Networks(WSN)is a distributed sensing network.The sensors in WSN communicate in a wireless way,so the network is flexible,the location of the device can be changed at any time,and it can also be wired or wirelessly connected to the Internet.A multi hop ad hoc network is formed through wireless communication.At present,WSN is widely used in defense,military,environmental monitoring and other industries.According to the characteristics of WSN,WSN can generally be deployed in an environment with relatively poor environment to accomplish applications that are not suitable for general computer networks.In this paper,the classical algorithm(LEACH algorithm and GAF algorithm)in WSN is analyzed.The LEACH algorithm is a hierarchical protocol aimed at minimizing the energy loss of the sensor network.By randomly selecting cluster head nodes,the algorithm can share energy losses in the network and achieve the goal of data collection effectively.GAF algorithm is a routing algorithm based on node geographical location for clustering and selectively sleeping nodes.In the GAF algorithm,the nodes in the network determine which nodes activate,close and sleep by negotiation,and the nodes balance the energy consumption by changing roles.In this way,the GAF algorithm prolongs the lifetime of the network.However,the GAF algorithm does not optimize the cluster head nodes,which can easily lead to the premature death of nodes in a certain area.Secondly,this paper describes IGAF(an improved GAF algorithm),and IGAF is an algorithm based on distance and energy integration.Compared with the idea of LEACH and GAF,the IGAF algorithm makes an optimal routing choice between cluster heads for data routing.In this way,the IGAF algorithm can make use of the energy in the network more evenly and prolong the network life cycle.IGAF algorithm is divided into three stages: cell division,cluster head selection and data transmission between cluster heads.Cell division is the division of the whole network into a virtual cell with equal border length;in the election phase of the cluster head,the node will periodically transform three states of discovery,activity and sleep.In the transmission phase of the cluster head,the sensor network will derive the residual energy from the node and the projection of the distance between the node and the current node.Consider the two factors and choose an optimal path.Finally,the three algorithms are simulated by MATLAB,and the number of remaining nodes and residual energy in each round of the three algorithms are compared.Throughexperimental comparison,it is found that the IGAF algorithm outperforms the LEACH algorithm and GAF algorithm in the number of nodes and residual energy in each cycle.