Performance evaluation of dynamic probabilistic flooding under different mobility models in MANETs

Authors:
Abdalla M. Hanashi;Aamir Siddique;Irfan Awan;Mike Woodward
Affiliations:
Mobile Computing, Networks and Security Research Group, School of Informatics, University of Bradford, BD7 1DP, U.K.;Mobile Computing, Networks and Security Research Group, School of Informatics, University of Bradford, BD7 1DP, U.K.;Mobile Computing, Networks and Security Research Group, School of Informatics, University of Bradford, BD7 1DP, U.K.;Mobile Computing, Networks and Security Research Group, School of Informatics, University of Bradford, BD7 1DP, U.K.
Venue:
ICPADS '07 Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02
Year:
2007

Citing 0
Cited 5

Stochastic broadcast for VANET

CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Performance comparison of OLSR and BATMAN routing protocols by a MANET testbed in stairs environment

Computers & Mathematics with Applications
End-to-end single and multiple flows fairness in mobile ad-hoc networks

Journal of Mobile Multimedia
Experimental results from a MANET testbed in outdoor bridge environment considering BATMAN routing protocol

Computing
Investigation of TCP and UDP multiple-flow traffic in wireless mobile ad-hoc networks

Journal of High Speed Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In mobile ad hoc networks (MANET), broadcasting is widely used in route discovery and many other network services. The efficiency of broadcasting protocol can affect the performance of the entire network. As such, the simple flooding algorithm aggravates a high number of unnecessary packet rebroadcasts, causing contention and packet collisions. Proper use of probabilistic method can reduce the number of rebroadcasting, therefore reduce the chance of contention and collision among neighbouring nodes. A good probabilistic broadcast protocol can achieve high save rebroadcast and low collision. In this paper, we propose a dynamic probabilistic approach when nodes move according to different mobility models and compare it with simple flooding AODV and fixed probabilistic scheme. Our approach dynamically set the rebroadcast probability according to the number of neighbour nodes distributed in the ad hoc network. Simulation results show our approach performs better than both simple flooding and fixed probabilistic flooding.