A preview of the PDF is not available
HYBRID RANDOM WALK-PARTIAL FLOODING TECHNIQUE OVER MANET
Abstract and Figures
Many routing protocols have been proposed for MANET, with the goal of achieving efficientrouting. Flooding technique is often used for r oute discovery in on-demand routing protocols inMANET such as AODV routing. Such technique coul d unnecessarily saturate most parts of thenetwork with route request packets. In addition, flooding has poor granularity, and does not scalewell. Random walks have been proposed as an alternative search technique. Searching bysimulating random walks reduces the message ove rhead compared to flooding across network.Additionally, the random walks method scales well and has excellent granularity. However, it isinherently sequential, which increases route establishment delay.To avoid the problem of wireless broadcast storm caused by flooding technique, and to reduceroute establishment delay in ra ndom walk techniques, we proposed a hybrid Sear ch technique,which combines the strength of random walk techniques with Delegation-Based Partial Flooding(D-BPF) techniques, and show how to use locally maintained network information to improveperformance of searching.Hybrid Search technique employs the Ad hoc On-demand Distance Vector (AODV) routingprotocol. We quantify performance in terms of the amount of control packets and routeestablishment delay. Simulation results showed that the Hybrid Search technique re duces theamount of route request packets and route estab lishment delay with large time-to-live value ascompared with the D-BPF technique (PDF) HYBRID RANDOM WALK-PARTIAL FLOODING TECHNIQUE OVER MANET. Available from: https://www.researchgate.net/publication/274705416_HYBRID_RANDOM_WALK-PARTIAL_FLOODING_TECHNIQUE_OVER_MANET [accessed Jun 26 2022].
Figures - uploaded by Souhad Daraghma
All figure content in this area was uploaded by Souhad Daraghma
Content may be subject to copyright.