A dynamic probabilistic route discovery for mobile ad hoc networks

Authors:
Jamal-Deen Abdulai;Mohamed Ould-Khaoua;Lewis M. Mackenzie;Aminu Mohammed
Affiliations:
Department of Computing Science, University of Glasgow, Glasgow, G12 8RZ, UK.;Department of Electrical & Computer Engineering, Sultan Qaboos University, AL--Khodh 123, Muscat, Oman.;Department of Computing Science, University of Glasgow, Glasgow, G12 8RZ, UK.;Department of Computing Science, University of Glasgow, Glasgow, G12 8RZ, UK
Venue:
International Journal of Communication Networks and Distributed Systems
Year:
2010

Citing 6
Cited 0

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Ad Hoc Wireless Networks: Protocols and Systems

Ad Hoc Wireless Networks: Protocols and Systems
Analysis of a randomized congestion control scheme with DSDV routing in ad Hoc wireless networks

Journal of Parallel and Distributed Computing - Special issue on wireless networks
Dynamic probabilistic broadcasting in MANETs

Journal of Parallel and Distributed Computing
Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network

IEEE Transactions on Computers
Flooding in wireless ad hoc networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Blind flooding has been extensively used 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 the 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 considerably reduced if measures are taken during the dissemination of RREQ packets. We propose a generic probabilistic method for route discovery that dynamically computes the forwarding probability at a given node and can significantly reduce the overhead associated with the dissemination of RREQs. Our analysis reveals that equipping a routing protocol with the proposed probabilistic route discovery can result in a significant reduction of routing control overhead while achieving good throughput.