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

TL;DR

This paper proposes a probabilistic method to decrease route discovery overhead in AODV for MANETs by leveraging network behavior history, aiming to improve efficiency in dynamic mobile environments.

Contribution

It introduces a novel probabilistic approach that reduces route request flooding in AODV, enhancing route discovery efficiency in MANETs.

Findings

Significant reduction in route request flooding.

Improved route discovery time.

Enhanced network performance under mobility.

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