A Bi-Scheduler Algorithm for Frame Aggregation in IEEE 802.11n

TL;DR

This paper proposes a Bi-Scheduler algorithm to enhance throughput in IEEE 802.11n WLANs by intelligently applying frame aggregation techniques based on traffic categories.

Contribution

It introduces a novel scheduler that segregates frames by access category to optimize aggregation and improve overall network performance.

Findings

Increased throughput in saturated traffic scenarios

Effective segregation of delay-sensitive and insensitive traffic

Improved utilization of aggregation techniques

Abstract

IEEE 802.11n mainly aims to provide high throughput, reliability and good security over its other previous standards. The performance of 802.11n is very effective on the saturated traffic through the use of frame aggregation. But this frame aggregation will not effectively function in all scenarios. The main objective of this paper is to improve the throughput of the wireless LAN through effective frame aggregation using scheduler mechanism. The Bi-Scheduler algorithm proposed in this article aims to segregate frames based on their access categories. The outer scheduler separates delay sensitive applications from the incoming burst of multi-part data and also decides whether to apply Aggregated - MAC Service Data Unit (A-MSDU) aggregation technique or to send the data without any aggregation. The inner scheduler schedules the remaining (delay-insensitive, background and best-effort) packets using Aggregated-MAC Protocol Data unit (A-MPDU) aggregation technique