Performance of Expanding Ring Search Scheme in AODV Routing Algorithm
2008
AODV (ad hoc on-demand distance vector) routing protocol provides communication between mobile nodes with minimal control overhead and minimal route acquisition latency. It is well-known as a reactive routing protocol along with OLSR (optimized link state routing). Its goal is to reduce the need for system-wide broadcasts to the furthest extent possible. To control network-wide broadcasts of RREQs, the source node uses an expanding ring search technique, which allows a search of increasingly larger areas of the network if a route to the destination is not found. In this paper, we investigate the effectiveness of this ring search scheme by comparing the number of routing messages during routing discovery procedure.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
6
References
13
Citations
NaN
KQI