Literature Database Entry

karadag2025rate

Jarge Cem Karadag, "Rate Adaptation for blockacknowledged Wi-Fi in mobile scenarios," Bachelor Thesis, School of Electrical Engineering and Computer Science (EECS), TU Berlin (TUB), October 2025. (Advisor: Sascha Rösler; Referees: Falko Dressler and Thomas Sikora)

Abstract

Rate adaption faces new difficulties as mobile Wi-Fi becomes more prevalent in places like public transportation and colleges. Although IEEE 802.11’s Block Acknowledgment (BA) reduces control overhead and increases MAC-layer performance, its delayed input can hinder adaptation in quickly changing channels. The popular Minstrel algorithm, which depends on prompt acknowledgments for precise rate selection, is impacted by this constraint. This was addressed by creating and implementing a modified Minstrel variation in the Network Simulator 3 (NS-3) that introduced intra-block Modulation and Coding Scheme (MCS) diversity. The method maintains aggregate efficiency while improving feedback freshness inside a block. According to simulation studies, the optimal trade-off between responsiveness and efficiency is achieved with moderate BA sizes (8–16). When compared to conventional Minstrel, the BlockTail Lower configuration improved throughput and had the best consistent performance during mobility. These results demonstrate that modest structural modifications and BA-aware feedback mechanisms are advantageous for rate adaptation in mobile Wi-Fi.

Quick access

BibTeX BibTeX

Contact

Jarge Cem Karadag

BibTeX reference

@phdthesis{karadag2025rate,
    author = {Karadag, Jarge Cem},
    title = {{Rate Adaptation for blockacknowledged Wi-Fi in mobile scenarios}},
    advisor = {R{\"{o}}sler, Sascha},
    institution = {School of Electrical Engineering and Computer Science (EECS)},
    location = {Berlin, Germany},
    month = {10},
    referee = {Dressler, Falko and Sikora, Thomas},
    school = {TU Berlin (TUB)},
    type = {Bachelor Thesis},
    year = {2025},
   }
   
   

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.

Last modified: 2026-07-13