Research On Energy-efficient Clustering Routing Technology Of WSN Based On Location

Wireless sensor network is one of self-organizing wireless networks mainlycomposed of a large number of low-power micro sensor nodes. It has broad applicationprospects in the military defense, ecological protection, and industrial control. Routingtechnology is one of the key technologies of wireless sensor networks used for findingthe optimal path between the source and destination, and data packets are correct to beforwarded along the optimal path. The routing protocol based on clustering hassignificant advantages in routing preservation and topology management. We cancontrol the number and the location of cluster heads generated by introducing thegeographical position information to the design of cluster routing protocol. What ismore, the known geographical position information can be used as routing oriented ofcluster, and avoid blind routing deliver of packets in the network. In addition, Sensornodes generally use the limited capacity of the battery as a power source, and the designof energy-efficient routing is one of the key performance indicators. Therefore, based onthe background of wireless sensor networks, this paper research location-basedenergy-efficient clustering routing technology of wireless sensor network, and the mainresearch achievements are as follows:First, in view of networking and clustering problem in wireless sensor networks insome special environment applications, this paper proposes a minimum node IDgeneration algorithm. Nodes sent one-hop broadcast packet in the local area, andcompare the ID itself with the ID carried in the packet. Then, the nodes with the smallerID in the local area are selected to send broadcast packet in the whole area freely. At last,the node with the smallest ID sends broadcast packet continuously, and this node can becalled as the unique smallest ID node in the whole area. The algorithm can quickly elect cluster head node and effectively reduce the number of broadcast nodes in the processof cluster head election. In addition, it will reduce the network overhead as well.Second, the distance between the cluster head in different divided square area isnot equal when running GAF algorithm, and GAF algorithm did not introduce theenergy factor when compete to select the head cluster as well. Therefore, the paperstudy location-based hierarchical routing technology and propose the improvedalgorithm GAF-I, to solve the two problems of GAF. In the GAF-I algorithm, target areais divided into different parts by round. Nodes run the smallest ID node generationalgorithm to select the initial cluster head. Nodes divided their left energy into manygrades, and replace the cluster head by comparing the grade of nodes. What is more, theconcept of virtual backbone network is introduced to the GAF-I algorithm and all thecluster heads compose virtual backbone network and take the responsibility ofdelivering data packets to the base station.Thirdly, Aiming at the hot spots and single path issues in GPSR, this paperproposes a new improved algorithm called GPSR-EA. Distance factor, energy factorand angle factor are introduced to the improved algorithm when nodes choosing the nesthop to forward packets. When greedy forwarding mode fails, a new routing mechanismfor handling void problem begins to work. Nodes maintain a neighbor table and selectone of neighbor nodes to be father. When a node encounters void, it will passed packetsdirectly to the parent node, and eventually routed to the base station.At last, in order to simulate and analyze the performance of GPSR-EA, the NS-2simulation environment was set up. Results of the experiment validate that theGPSR-EA algorithm can effectively balance the network energy consumption andimprove the network life-cycle. In addition, it can solve the void problem efficiently andperform better than GPSR.