The Comparison Between Reliable Proposed Position Based Routing Protocols And Greedy

Position based routing protocols are branch of routing protocols, which use nodes location information, instead of links information to routing. In position based routing protocols, it supposed that the packet source node has position information of itself and it's neighbors and the packet destination node. Greedy is an important position based routing protocol. In one of it's kinds, named MFR (Most Forward Within Radius), the source node or the packet forwarder node, sends packet to one of it's neighbors with most forward progress towards destination node (closest neighbor to destination). Using distance deciding metric in Greedy to forward packet to a neighbor node, is not suitable for all conditions. If closest neighbor to destination node, has high speed, in comparison with source node or the intermediate packet forwarder node speed or has very low remained battery power, then packet loss probability is increasing. In this paper, the proposed strategies are compared ,the first proposed method uses the combination of metrics distance-velocity similarity and the second one uses the combination of metrics distance-power, and the third one uses combination of metrics distance-velocity similarity-power, to deciding about giving the packet to which neighbor. Simulation results show that the third proposed strategy has the lowest lost packets average than Greedy and two other proposed methods, so it has the most reliability.

The Comparison Between Reliable Proposed Position Based Routing Protocols And Greedy Keywords:

Mobile Ad Hoc Network , Position Based , Reliability , Routing