An Improved Greedy Forwarding Scheme in MANETs

Abstract

Position-based routing protocols are widely accepted efficient solution for routing in MANETs. The main feature of position-based routing protocols is to use greedy forwarding methods to route data. The greedy forwarding methods select a node, either having maximum progress towards destination (distance-based principle) or minimum deviation with line between source and destination (direction-based strategy). The first method minimizes the hopcount in a path and on the other hand, second method minimizes the spatial distance between source and destination. The distance-based routing has a great impact on the selection of reliable node and the direction based routing plays a major role to increase the stability of route towards destination. Therefore, in this paper authors propose a weighted forwarding method, which combines both the selection, schemes to select an optimal next forwarding node in a range. The simulation results show that the proposed scheme performs better than existing position-based routing protocols.

Keywords

• MANET
• distance-based routing
• direction-based routing
• greedy forwarding