Computer Science – Networking and Internet Architecture
Scientific paper
2010-09-30
International Journal of Ad hoc, Sensor & Ubiquitous Computing, Vol 1, No.3,Sep 2010
Computer Science
Networking and Internet Architecture
Probabilistic Route Discover Algorithm for DENSE MANETs
Scientific paper
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 phase when the network is denser.
Sankar Sharmila
Sankaranarayanan Dr. V.
No associations
LandOfFree
A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for Dense MANETs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for Dense MANETs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for Dense MANETs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-242605