Improving route discovery in on-demand routing protocols using local topology information in MANETs

Most existing routing protocols proposed for MANETs use flooding as a broadcast technique for the propagation of network control packets; a particular example of this is the dissemination of route requests (RREQs), which facilitate route discovery. In flooding, each mobile node rebroadcasts received packets, which, in this manner, are propagated network-wide with considerable overhead. This paper improves on the performance of existing routing protocols by reducing the communication overhead incurred during the route discovery process by implementing a new broadcast algorithm called the adjusted probabilistic flooding on the Ad-Hoc on Demand Distance Vector (AODV) protocol. AODV [3] is a well-known and widely studied algorithm which has been shown over the past few years to maintain an overall lower routing overhead compared to traditional proactive schemes, even though it uses flooding to propagate RREQs. Our results, as presented in this paper, reveal that equipping AODV with fixed and adjusted probabilistic flooding, instead, helps reduce the overhead of the route discovery process whilst maintaining comparable performance levels in terms of saved rebroadcasts and reachability as achieved by conventional AODV\@. Moreover, the results indicate that the adjusted probabilistic technique results in better performance compared to the fixed one for both of these metrics

A performance comparison of smart probabilistic broadcasting of ad hoc distance vector (AODV).

Broadcast is a common operation used in Mobile Ad hoc Networks (MANETs) for many services, such as, routdiscovery and sending an information messages. The direct method to perform broadcast is simple flooding, which itcan dramatically affect the performance of MANET. Recently, a probabilistic approach to flooding has beenproposed as one of most important suggested solutions to solve the broadcast storm problem, which leads to thecollision, contention and duplicated messages. This paper proposed new probabilistic method to improve theperformance of existing on-demand routing protocol by reduced the RREQ overhead during rout discoveryoperation. The simulation results show that the combination of AODV and a suitable probabilistic rout discoverycan reduce the average end- to- end delay as well as overhead and still achieving low normalized routing load,comparing with AODV which used fixed probability and blind floodin

Applications of Highly Adjusted Probabilistic Broadcasting in

The broadcasting protocol can dramatically affect the performance of a MANET. Proper use of a probabilistic broadcasting method can reduce the number of rebroadcasts, and as a result reduce the chance of contention and collision among neighboring nodes. While most previous studies have used a FIXED re-broadcasting probability irrespective of node/network status, this research demonstrates that dynamically adjusting the re-broadcasting probability to take into account node status (e.g. neighborhood information over one hop) greatly improves network performance in terms of both saved rebroadcasts and degree of reachability. This paper evaluate the performance of Highly Adjusted Probabilistic by implement it on Ad Hoc on Demand Distance Vector (AODV) protocol which is based on simple flooding as well as a fixed probabilistic approach in the. The results show that the Highly Adjusted Probabilistic exhibits superior performance in terms of both the reachability and saved rebroadcasts

On the effect of Mobility and Density on Probabilistic Flooding in MANETs

Broadcasting is a fundamental and effective data dissemination mechanism, which has several applications such as route discovery, address resolution, as well as many other network services. While data broadcasting has many advantages, it induces some difficulties known as broadcast storm problems, which are natural consequences of redundant retransmission, collision, and contention. Data broadcasting has traditionally been based on the flooding protocol, which floods the network with high number of packet rebroadcasts until the desired routs are discovered [6]. Density is the number of network nodes per unit area for a given transmission range. This paper investigates the effect of density with different speeds on the behaviour of probabilistic flooding in mobile ad hoc networks (MANETs). This investigation is conducted through extensive simulation on a network of size 25 to 100 nodes. The obtained results reveal that the effect of density with different speeds has a critical impact on the levels of rebroadcast and reachability achieved by probabilistic flooding

Performance Evaluation of Adjusted Probabilistic Broadcasting in MANETs

Appropriate use of a probabilistic broadcasting method in MANETs can decrease the number of rebroadcasts, and as a result reduce the opportunity of contention and collision among neighbouring nodes. In this paper we evaluate the performance of Adjusted Probabilistic flooding by comparing it to “simple ” flooding as used with the Ad Hoc on Demand Distance Vector (AODV) routing protocol as well as a fixed probabilistic approach. The results reveal that the Adjusted Probabilistic flooding exhibits superior performance in terms of both reachability and saved rebroadcasts. 1