5,161 research outputs found
Modeling Routing Overhead Generated by Wireless Proactive Routing Protocols
In this paper, we present a detailed framework consisting of modeling of
routing overhead generated by three widely used proactive routing protocols;
Destination-Sequenced Distance Vector (DSDV), Fish-eye State Routing (FSR) and
Optimized Link State Routing (OLSR). The questions like, how these protocols
differ from each other on the basis of implementing different routing
strategies, how neighbor estimation errors affect broadcast of route requests,
how reduction of broadcast overhead achieves bandwidth, how to cope with the
problem of mobility and density, etc, are attempted to respond. In all of the
above mentioned situations, routing overhead and delay generated by the chosen
protocols can exactly be calculated from our modeled equations. Finally, we
analyze the performance of selected routing protocols using our proposed
framework in NS-2 by considering different performance parameters; Route
REQuest (RREQ) packet generation, End-to-End Delay (E2ED) and Normalized
Routing Load (NRL) with respect to varying rates of mobility and density of
nodes in the underlying wireless network
Neighbour coverage: a dynamic probabilistic route discovery for mobile ad hoc networks
Blind flooding is extensively use in ad hoc routing protocols for on-demand route discovery, where a mobile node blindly rebroadcasts received route request (RREQ) packets until a route to a particular destination is established. This can potentially lead to high channel contention, causing redundant retransmissions and thus excessive packet collisions in the network. Such a phenomenon induces what is known as broadcast storm problem, which has been shown to greatly increase the network communication overhead and end-to-end delay. In this paper, we show that the deleterious impact of such a problem can be reduced if measures are taken during the dissemination of RREQ packets. We propose a generic probabilistic method for route discovery, that is simple to implement and can significantly reduce the overhead associated with the dissemination of RREQs. Our analysis reveals that equipping AODV with probabilistic route discovery can result in significant reduction of routing control overhead while achieving good throughput
An Adaptive Probabilistic Model for Broadcasting in Mobile Ad Hoc Networks
Ad hoc peer-to-peer mobile phone networks (phone MANETs) enable cheap village level telephony for cash-strapped, off-the-grid communities. Broadcasting is a fundamental operation in such manets and is used for route discovery. This paper proposed a new broadcast technique that is lightweight, efficient and incurs low latency. Using extensive simulations, we compare our proposed technique to existing lightweight protocols. The results show that our technique is successful in outperforming existing lightweight techniques on the criteria that are critical for a phone-MANET.
- …