By Topic

Novel adaptive DCF protocol using the computationally-efficient optimization with the feedback network information for wireless local-area 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)
Shih Yu Chang ; Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu ; Hsiao-Chun Wu

In this paper, we design a novel computationally-efficient linear programming (LP) algorithm to maximize the throughput with respect to the minimum contention window size for the IEEE 802.11 Distributed Coordination Function (DCF) protocol. Based on our LP scheme, a new DCF protocol which can select the best access mode and the optimal size of the minimum contention window is proposed by considering the channel condition and the number of competing stations jointly. The numerical results demonstrate that our proposed DCF protocol significantly outperforms the conventional method.

Published in:

IEEE Transactions on Wireless Communications  (Volume:8 ,  Issue: 6 )