An Algorithm Of Geographical Routing Based Hull Tree And Greedy

The Geographic routing algorithms in wireless sensor networks is an important class of routing algorithms. The Geographic routing algorithms based Greedy Forwarding Rule and Perimeters Forwarding all needed topological structure of the WSN, whether it is local or global topology. At now, how algorithms efficiently construct the topological structure in the initialization phase becomes particularly important.This paper focuses on analysis and research of the basic theories and methods of the geographic routing algorithms in WSN, and the description and analysis of panelizing network topological structure, the convex hull in graphics theory and its applications. On this basis, the paper propose a new Geographic routing algorithms which implement the Hull tree to store the multi-level convex hull structure, the local node as the center, and carry out discovering and configuratiing distributed network topology.First, implement the Hull tree to store the multi-level convex hull structure in native node. Nodes do not have to store the entire network planar topology, reducing the initialization packets to build the network to exchange, and the entire network storage space used to store the nodes.Second, through the native Hull tree search the middle of forwarding node. Data packets can be in the local node to determine a next forwarding node sequences. As long as in the sequence, you do not need to look again at this node’s next hop paths, reducing the consumption of the node resources.Third, When the data packet arrived in local fixed-point, forwarding has been suspended, the node directly to search convex hull node in Hull tree, the edge of the neutron position, thereby directly transmit data to a node outside the scope of direct communication and avoid duplication of the node with its neighbor nodes to exchange messages more state information.In the end, we simulate GHTHR and GPSR on MATLAB platform, comparing its effectiveness to GPSR. The results show that GHTGR algorithm not only finds the correct way to complete the routing of work, but also effective in reducing the number of network packet switching, reducing the network load.