GRB: Greedy Routing Protocol with Backtracking for Mobile Ad Hoc Network (Extended Version)
Baban A. Mahmood, D. Manivannan

TL;DR
This paper introduces GRB, a new position-based routing protocol for MANETs that uses backtracking to handle voids, resulting in improved delivery ratio, lower delay, and fewer control packets compared to existing protocols.
Contribution
The paper proposes a novel backtracking-based routing protocol, GRB, which effectively manages voids and outperforms GPSR, AODV, and DSR in key performance metrics.
Findings
Higher packet delivery ratio than AODV.
Lower end-to-end delay compared to AODV.
Fewer routing-control packets than DSR, AODV, and GPSR.
Abstract
Routing protocols for Mobile Ad Hoc Networks (MANETs) have been extensively studied for more than fifteen years. Position-based routing protocols route packets towards the destination using greedy forwarding (i.e., an intermediate node forwards packets to a neighbor that is closer to the destination than itself). Different position-based protocols use different strategies to pick the neighbor to forward the packet. If a node has no neighbor that is closer to the destination than itself, greedy forwarding fails. In this case, we say there is void (no neighboring nodes) in the direction of the destination. Different position-based routing protocols use different methods for dealing with voids. In this paper, we use a simple backtracking technique to deal with voids and design a position-based routing protocol called "Greedy Routing Protocol with Backtracking (GRB)". We compare the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMobile Ad Hoc Networks · Opportunistic and Delay-Tolerant Networks · Cooperative Communication and Network Coding
