A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for Dense MANETs
Sharmila Sankar, Dr. V. Sankaranarayanan

TL;DR
This paper introduces a low-overhead, probabilistic flooding-based route discovery protocol for dense MANETs that significantly reduces control packet traffic while maintaining high route discovery success rates.
Contribution
It presents a novel controlled flooding mechanism that adapts to network density, decreasing broadcast overhead without compromising route discovery success.
Findings
Up to 70% reduction in control packet traffic in dense networks
Maintains high route discovery success ratio
Adapts effectively to varying network conditions
Abstract
A crucial issue for a mobile ad hoc network is the handling of a large number of nodes. As more nodes join the mobile ad hoc network, contention and congestion are more likely. The on demand routing protocols which broadcasts control packets to discover routes to the destination nodes, generate a high number of broadcast packets in a larger networks causing contention and collision. We propose an efficient route discovery protocol, which reduces the number of broadcast packet, using controlled flooding technique. The simulation results show that the proposed probabilistic flooding decreases the number of control packets floating in the network during route discovery phase, without lowering the success ratio of path discoveries. Furthermore, the proposed method adapts to the normal network conditions. The results show that up to 70% of control packet traffic is saved in route discovery…
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 · Vehicular Ad Hoc Networks (VANETs) · Opportunistic and Delay-Tolerant Networks
