By Topic

Wireless Mesh Network Capacity Achievable Over the CSMA/CA MAC

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

4 Author(s)
Yu Cheng ; Dept. of Electr. & Comput. Eng., Illinois Inst. of Technol., Chicago, IL, USA ; Hongkun Li ; Peng-Jun Wan ; Xinbing Wang

This paper presents a theoretical analysis of the maximum throughput of a wireless mesh backhaul network that is achievable over a practical carrier sense multiple access with collision avoidance (CSMA/CA) medium access control (MAC) protocol. We resort to the multicommodity flow (MCF) formulation augmented with the conflict-graph constraints, whereas we use a novel approach to take into account the collision overhead in the distributed CSMA/CA MAC. Such overhead due to random access has been ignored by existing MCF-based capacity studies, which assume impractical centralized scheduling and result in aggressive capacity planning, which is unachievable over the CSMA/CA MAC. This paper makes the following three main contributions: 1) we develop a generic method of integrating the CSMA/CA MAC analysis with the MCF formulation for optimal network capacity analysis, which readily generates an upper bound of the network throughput; 2) we define a new concept of CSMA/CA clique and theoretically study its relationship to a CSMA/CA area in terms of throughput; and 3) using the CSMA/CA clique as a tool, we derive a lower bound of the network throughput achievable over the CSMA/CA MAC by clique-based MCF formulation. NS-2 simulation results are presented to demonstrate the tightness of the upper and lower bounds that are newly developed, compared to those based on the MCF formulation assuming a slotted system and centralized scheduling.

Published in:

Vehicular Technology, IEEE Transactions on  (Volume:61 ,  Issue: 7 )