A Novel Rebroadcast Technique for Reducing Routing Overhead In Mobile Ad Hoc Networks

Abstract

In mobile ad hoc networks (MANETs), the network topology changes frequently and unpredictably due to the arbitrary mobility of nodes. This feature leads to frequent path failures and route reconstructions, which causes an increase in the routing control overhead. The overhead of a route discovery cannot be neglected. Thus, it is imperative to reduce the overhead of route discovery in the design of routing protocols of MANETs. One of the fundamental challenges of MANETs is the design of dynamic routing protocols with good performance and less overhead. In a route discovery, broadcasting is a fundamental and effective data dissemination mechanism, where a mobile node blindly rebroadcasts the first received route request packets unless it has a route to the destination, and thus it causes the broadcast storm problem. This paper focuses on a probabilistic rebroadcast protocol based on neighbor coverage to reduce the routing overhead in MANETs. Keywords - Mobile Ad Hoc Networks, Neighbor Coverage, and Network Connectivity, Probabilistic Rebroadcast, Routing Overhead, AODV.