Cart (Loading....) | Create Account
Close category search window
 

Analytical Modeling and Performance Analysis of Flooding in CSMA-Based Wireless 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
$31 $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

3 Author(s)
Mansouri, H.S. ; Dept. of Electr. Eng., Sharif Univ. of Technol., Tehran, Iran ; Pakravan, M.R. ; Khalaj, B.H.

Although different broadcasting techniques are widely deployed in wireless networks, there are limited comprehensive analytical frameworks to evaluate the performance of such schemes. In this paper, based on a rigorous theoretical analysis, upper bounds on the network coverage and the total number of transmissions (corresponding to network energy consumption) of flooding and its popular variant probabilistic flooding are derived. The analysis is performed for a static multihop ad hoc wireless network when the network is in saturated condition. To consider a realistic medium-access control (MAC) layer algorithm, successful signal reception is based on the protocol model, and nodes employ carrier-sense multiple access. Based on the concept of marked point process, two different approaches, i.e., hop based and time based, are proposed. In the hop-based approach, an upper bound on network coverage and energy consumption is derived for any serving policy and queuing delay that broadcasted packets experience. This approach can be easily extended to multiple-source scenarios. The time-based approach is appropriate for the case of known service policy and queuing delay, and it predicts the time-domain behavior of the broadcasting schemes, as well as other mentioned parameters. We show that the two bounds are very close to each other. The first approach has less complexity, whereas the second approach provides a tighter bound. As an interesting result, we analytically demonstrate that the disjoint analysis of MAC and network layers provides a much simpler solution, whereas the obtained results are also upper bounds on the network coverage. Simulation results validate our analytical model and demonstrate its tightness for real scenarios.

Published in:

Vehicular Technology, IEEE Transactions on  (Volume:60 ,  Issue: 2 )

Date of Publication:

Feb. 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.