Probabilistic counter-based route discovery for mobile ad hoc networks

Authors:
Aminu Mohammed;Mohamed Ould-Khaoua;Lewis M. Mackenzie;Colin Perkins;Jamal-Deen Abdulai
Affiliations:
University of Glasgow, Glasgow, United Kingdom;Sultan Qaboos University, Muscat, Oman;University of Glasgow, Glasgow, United Kingdom;University of Glasgow, Glasgow, United Kingdom;University of Glasgow, Glasgow, United Kingdom
Venue:
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Year:
2009

Citing 13
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
Location-aided routing (LAR) in mobile ad hoc networks

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
The broadcast storm problem in a mobile ad hoc network

Wireless Networks - Selected Papers from Mobicom'99
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Ad hoc Networking

Ad hoc Networking
Dynamic probabilistic broadcasting in MANETs

Journal of Parallel and Distributed Computing
A greedy approximation for minimum connected dominating sets

Theoretical Computer Science
The random trip model: stability, stationary regime, and perfect simulation

IEEE/ACM Transactions on Networking (TON)
Intelligent broadcasting inmobile ad hoc networks: three classes of adaptive protocols

EURASIP Journal on Wireless Communications and Networking
Approximation Algorithms for Connected Dominating Sets

Algorithmica
An Adjusted Counter-Based Broadcast Scheme for Mobile Ad Hoc Networks

UKSIM '08 Proceedings of the Tenth International Conference on Computer Modeling and Simulation
An efficient counter-based broadcast scheme for mobile ad hoc networks

EPEW'07 Proceedings of the 4th European performance engineering conference on Formal methods and stochastic models for performance evaluation
Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Conventional on-demand route discovery for ad hoc routing protocols extensively use simple flooding, which could potentially lead to high channel contention, causing redundant retransmissions and thus excessive packet collisions in the network. This phenomenon has been shown to greatly increase the network communication overhead and end to end delay. This paper proposes a new probabilistic counter-based method that can significantly reduce the number of RREQ packets transmitted during route discovery operation. Our simulation results reveal that equipping AODV routing protocol with the proposed probabilistic counter-based route discovery method can result in significant performance improvements in terms of routing overhead, MAC collisions and end-to-end delay while still achieving a good throughput.