By Topic

Performance Analysis of Block Acknowledgement Mechanisms for Next Generation 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
$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

3 Author(s)
Wen-Jiunn Liu ; Dept. of Electr. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan ; Chao-Hua Huang ; Kai-Ten Feng

The IEEE 802.11n standard has been proposed to provide enhanced throughput performance for the wireless local area networks. Most of the existing research work considers packet aggregation techniques for enhancing the network throughput from the medium access control perspective. Consequently, the large amount of small-sized acknowledgement (ACK) packets are aggregated via the block ACK mechanisms in order to improve the system throughput. In this paper, a block ACK classification is proposed to categorize the existing block ACK mechanisms into the greedy and the conservative schemes. Based on the Markovian techniques, the respective analytical models are constructed in order to measure the throughput-related metric of the window utilization under different packet error probabilities. Simulations are conducted to validate and compare the proposed analytical models associated with the two types of block ACK schemes. It can be observed from the numerical results that the greedy scheme outperforms the conservative approach with comparably higher window utilization.

Published in:

2010 IEEE Wireless Communication and Networking Conference

Date of Conference:

18-21 April 2010