IEEE 802.11n MAC frame aggregation mechanisms for next-generation high-throughput WLANs [Medium access control protocols for wireless LANs]

IEEE 802.11n is an ongoing next-generation wireless LAN standard that supports a very highspeed connection with more than 100 Mb/s data throughput measured at the medium access control layer. This article investigates the key MAC enhancements that help 802.11n achieve high throughput and high efficiency. A detailed description is given for various frame aggregation mechanisms proposed in the latest 802.11n draft standard. Our simulation results confirm that A-MSDU, A-MPDU, and a combination of these methods improve extensively the channel efficiency and data throughput. We analyze the performance of each frame aggregation scheme in distinct scenarios, and we conclude that overall, the two-level aggregation is the most efficacious

Two-level frames aggregation with enhanced A-MSDU for IEEE 802.11n WLANs

IEEE 802.11n defines two schemes of frames aggregation aimed at maximize utilizing WLAN PHY efficiency at MAC level, through sharing headers and timings overheads. Despite their efficiencies in enhancing the MAC throughput, the schemes are characterized with yet other overheads due to the aggregation. Moreover, none of the two schemes is optimal in every condition: Both should work together to achieve this. In this paper, in order to optimize channel’s bandwidth utilization, we proposed an enhanced A-MSDU with minimal headers overhead, and an efficient two-level aggregation scheme utilizing the enhanced A-MSDU. Results from the simulation show superiority of the proposed two-level aggregation in respect of throughput and overall channel utilization

Evaluations and Enhancements in 802.11n WLANs – Error-Sensitive Adaptive Frame Aggregation

IEEE 802.11n is a developing next-generation standard for wireless local area network (LAN). Seamless multimedia traffic connection will become possible with the 802.11n improvement in the Physical and MAC layer. The new 802.11n frame aggregation technique is particularly important for enhancing MAC layer efficiency under high speed wireless LAN. Although the frame aggregation can increase the efficiency in the MAC layer, it does not provide good performance in high BER channels when using large frame aggregation size. An Optimal Frame Aggregation (OFA) technique for AMSDU frame under different BERs in 802.11n WLANs was proposed. However, the suggested algorithm does not take into account the loss rate and the delay performance requirements for Voice or Video multimedia traffic in various BER channels. The optimal frame size can provide good throughput in the network, but the delay might exceed the Quality of Service (QoS) requirement of Voice traffic or the Frame-Error-Rate (FER) might exceed the maximum loss rate tolerable by the streaming Video traffic. We propose an Error- Sensitive Adaptive Frame Aggregation (ESAFA) scheme which can dynamically set the size of AMSDU frame based on the maximum Frame-Error-Rate (FER) tolerable by a particular multimedia traffic. The simulations show that our adaptive algorithm outperforms the optimal frame algorithm by improving both the delay and the loss rate in the 802.11n WLANs. The measured FER of the Error-Sensitive Adaptive Frame Aggregation scheme can be kept at about the same as the loss rate requirement for Video traffic even under high Bit-Error-Rate (BER) channel. The delay compared to OFA is also decreased by around 50% under different channel conditions. Moreover, the results show that the Error-Sensitive Adaptive Frame Aggregation scheme works particularly well in error-prone wireless networks

Experimental Performance Evaluation and Frame Aggregation Enhancement in IEEE 802.11n WLANs

The IEEE 802.11n standard promises to extend today’s most popular WLAN standard by significantly increasing reach, reliability, and throughput. Ratified on September 2009, this standard defines many new physical and medium access control (MAC) layer enhancements. These enhancements aim to provide a data transmission rate of up to 600 Mbps. Since June 2007, 802.11n products are available on the enterprise market based on the draft 2.0. In this paper we investigate the effect of most of the proposed 802.11n MAC and physical layer features on the adhoc networks performance. We have performed several experiments in real conditions. The experimental results demonstrated the effectiveness of 802.11n enhancement. We have also examined the interoperability and fairness of 802.11n. The frame aggregation mechanism of 802.11n MAC layer can improve the efficiency of channel utilization by reducing the protocol overheads. We focused on the effect of frame aggregation on the support of voice and video applications in wireless networks. We also propose a new frame aggregation scheduler that considers specific QoS requirements for multimedia applications. We dynamically adjust the aggregated frame size based on frame's access category defined in 802.11e standard

Performance analysis of 802.11ac with frame aggregation using NS3

802.11ac is an interesting standard of IEEE bringing multiple advantages than its predecessor 802.11n. 802.11ac is faster and more scalable version of 802.11n offering the capabilities of wireless Gigabit Ethernet. 802.11ac will enable access points (AP) to support more STAs with a better experience for clients and more channel bonding increasing from a maximum of 40 MHz with 802.11n up to 80 or 160 MHz with 802.11ac standard. In this paper, we analyze and evaluate the 802.11ac performance using NS3 simulator (v3.26) relying on several features like channel bonding, modulation and coding schemes, guard interval and frame aggregation. Then, we present the effect of the variation of distance between STAs and AP on the network performance in term of throughput. Finally, we capture the most relevant simulations outcomes and we indicate some research challenges for the future work

Design and optimization of QoS-based medium access control protocols for next-generation wireless LANs

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.In recent years, there have been tremendous advances in wireless & mobile communications, including wireless radio techniques, networking protocols, and mobile devices. It is expected that different broadband wireless access technologies, e.g., WiFi (IEEE 802.11) and WiMAX (IEEE 802.16) will coexist in the future. In the meantime, multimedia applications have experienced an explosive growth with increasing user demands. Nowadays, people expect to receive high-speed video, audio, voice and web services even when being mobile. The key question that needs to be answered, then, is how do we ensure that users always have the "best" network performance with the "lowest" costs in such complicated situations? The latest IEEE 802.11n standards attains rates of more than 100 Mbps by introducing innovative enhancements at the PHY and MAC layer, e.g. MIMO and Frame Aggregation, respectively. However, in this thesis we demonstrate that frame aggregation's performance adheres due to the EDCA scheduler's priority mechanism and consequently resulting in the network's poor overall performance. Short waiting times for high priority flows into the aggregation queue resolves to poor channel utilization. A Delayed Channel Access algorithm was designed to intentionally postpone the channel access procedure so that the number of packets in a formed frame can be increased and so will the network's overall performance. However, in some cases, the DCA algorithm has a negative impact on the applications that utilize the TCP protocol, especially the when small TCP window sizes are engaged. So, the TCP process starts to refrain from sending data due to delayed acknowledgements and the overall throughput drops. In this thesis, we address the above issues by firstly demonstrating the potential performance benefits of frame aggregation over the next generation wireless networks. The efficiency and behaviour of frame aggregation within a single queue, are mathematically analysed with the aid of a M=G[a;b]=1=K model. Results show that a trade-off choice has to be taken into account over minimizing the waiting time or maximizing utilization. We also point out that there isn't an optimum batch collection rule which can be assumed as generally valid but individual cases have to be considered separately. Secondly, we demonstrate through extensive simulations that by introducing a method, the DCA algorithm, which dynamically determines and adapts batch collections based upon the traffic's characteristics, QoS requirements and server's maximum capacity, also improves e ciency. Thirdly, it is important to understand the behaviour of the TCP ows over the WLAN and the influence that DCA has over the degrading performance of the TCP protocol. We investigate the cause of the problem and provide the foundations of designing and implementing possible solutions. Fourthly, we introduce two innovative proposals, one amendment and one extension to the original DCA algorithm, called Adaptive DCA and Selective DCA, respectively. Both solutions have been implemented in OPNET and extensive simulation runs over a wide set of scenarios show their effectiveness over the network's overall performance, each in its own way.This study was supported by the Engineering and Physical Sciences Research Council (EPSRC)

An Adaptive Packet Aggregation Algorithm (AAM) for Wireless Networks

Packet aggregation algorithms are used to improve the throughput performance by combining a number of packets into a single transmission unit in order to reduce the overhead associated with each transmission within a packet-based communications network. However, the throughput improvement is also accompanied by a delay increase. The biggest drawback of a significant number of the proposed packet aggregation algorithms is that they tend to only optimize a single metric, i.e. either to maximize throughput or to minimize delay. They do not permit an optimal trade-off between maximizing throughput and minimizing delay. Therefore, these algorithms cannot achieve the optimal network performance for mixed traffic loads containing a number of different types of applications which may have very different network performance requirements. In this thesis an adaptive packet aggregation algorithm called the Adaptive Aggregation Mechanism (AAM) is proposed which achieves an aggregation trade-off in terms of realizing the largest average throughput with the smallest average delay compared to a number of other popular aggregation algorithms under saturation conditions in wireless networks. The AAM algorithm is the first packet aggregation algorithm that employs an adaptive selection window mechanism where the selection window size is adaptively adjusted in order to respond to the varying nature of both the packet size and packet rate. This algorithm is essentially a feedback control system incorporating a hybrid selection strategy for selecting the packets. Simulation results demonstrate that the proposed algorithm can (a) achieve a large number of sub-packets per aggregate packet for a given delay and (b) significantly improve the performance in terms of the aggregation trade-off for different traffic loads. Furthermore, the AAM algorithm is a robust algorithm as it can significantly improve the performance in terms of the average throughput in error-prone wireless networks