Modified expanding ring search in common node scenario for AODV

Abstract

Mobile ad-hoc networks (MANET) are a collection of nodes without any static infrastructure. Ad-hoc networks establish connections between nodes without the help of centralized nodes but with the help of its neighbour nodes. The nodes are movable and can change its position frequently, so it maintains a dynamic interconnection between nodes in the network and adapts to dynamic topologies. MANETs are characterized by dynamic mobile nodes, with limited battery sourced power. These mobile nodes also act as routers taking its roles such as finding new routes, acting as an intermediate node, deciding best routes and keep a connection with mobile nodes. Any mobile node in the network can make the connection directly to any node within its transmission range, but due to its limited power, its transmission range also limited. Reactive routing protocols are effective than proactive routing protocols on MANETs since it can reduce extra overheads. However, reactive routing protocol suffers from excessive flooding in route discovery process. Authors focus on an existing solution called Expanding Ring Search (ERS) which decreases the flooding by manipulating Time to live (TTL) in AODV. ERS is also is inefficient in some scenarios. When the source is far from the destination ERS is worse than flooding [4]. Authors proposing a modification in ERS to avoid this problem which will make ERS efficient when the MANET consists a node (common node) that frequently accessed by most of the nodes.