Improvised tree selection algorithm in Greedy Distributed Spanning Tree Routing

The Geographic Perimeter Stateless Routing (GPSR)use location information to forward packets greedily. Nodes need to keep only this local information, hence called as stateless. When Greedy Forwarding is fails, the algorithm recovers by switching to face routing, which is based on the right-hand rule in planarized node graph, to route around the void. The Gabriel Graph(GG) and the Relative Neighbourhood Graph (RNG) are the two graphs used for planarization but may lead to graph partitioning. Alternatively, instead of switching to face routing and planarizition, the existing Greedy Distributed Spanning Tree Routing(GDSTR) scheme enables nodes to continue routing by traversing on a spanning tree until it reaches a point where greedy forwarding can take place. GDSTR sometimes incorporates two spanning trees although it uses only one. So, in this work, we proposed new tree selection algorithm in GDSTR which improves the performance in terms of path and hop stretch with the competitive schemes.