By Topic

An Upper Bound on the Performance of Non-Repetitive Flooding over CSMA in Wireless Ad-Hoc Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
H. Shah-Mansouri ; Adv. Commun. Res. Inst., Sharif Univ. of Technol., Tehran, Iran ; M. R. Pakravan

Although flooding and its variants are widely deployed for broadcasting by different applications, there are limited results on a complete and comprehensive analytical framework describing their behavior in general cases. We have previously published results which provide an upper bound for the performance of flooding when flooded packets have the highest serving priority. In this paper, using a different and simpler approach, we develop an analytical framework for analysis of flooding in general cases where flooding packets do not receive any special priority treatment in the network. The analysis is performed for a static multi-hop ad hoc wireless network using CSMA as its MAC layer. The framework provides an upper bound on the network coverage and energy consumption of flooding and its popular variant, probabilistic flooding for any service time and queuing delay that flooded packets experience. The analytical upper bound is verified by extensive simulations which give evidence of its tightness in real scenarios.

Published in:

2009 IEEE International Conference on Communications

Date of Conference:

14-18 June 2009