A qualitative comparison evaluation of the greedy forwarding strategies in Mobile Ad Hoc Network
Journal of Network and Computer Applications
| Hi-index | 0.00 |
The goal is to utilize position information to provide more reliable as well as efficient routing for certain applications. Thus extensions to existing position based routing algorithm have been described to work more efficiently even in cases where they are not working at present. In this paper an algorithm is proposed, which removes some of the drawbacks of the existing GPSR (Greedy perimeter stateless routing) position based routing algorithm. In proposed algorithm different algorithm has been used to planarize the graph so that it will not disconnect the route in case of location inaccuracy in perimeter mode whereas in GPSR in certain cases of location inaccuracy it will disconnect the graph and hence the packets will not be routed thereby decreasing packetdelivery ratio.