# A probabilistic approach to reduce the route establishment overhead in AODV algorithm for manet

Source: [A probabilistic approach to reduce the route establishment overhead in AODV algorithm for manet](<https://www.sota2.com/research/paper/68fa60841e209131ce9efa54>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-28T13:56:27.833Z

Authors: K. G. Preetha, A. Unnikrishnan, K. Poulose Jacob

Published: 2012-04-09T08:07:54.000Z

## Abstract

Mobile Ad-hoc Networks (MANETS) is a collection of wireless nodes without any infrastructure support. The nodes in MANET can act as either router or source and the control of the network is distributed among nodes. The nodes in MANETS are highly mobile and it maintains dynamic interconnection between those mobile nodes. MANTEs have been considered as isolated stand-alone network. This can turn the dream of networking "at any time and at any where" into reality. The main purpose of this paper is to study the issues in route discovery process in AODV protocol for MANET. Flooding of route request message imposes major concern in route establishment. This paper suggests a new approach to reduce the routing overhead during the route discovery phase. By considering the previous behaviour of the network, the new protocol reduces the unwanted searches during route establishment process

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1204.1820>)

[PDF](<https://arxiv.org/pdf/1204.1820.pdf>)
