EEFA: Energy efciency frame aggregation scheduling algorithm for IEEE 802.11n wireless network

2014 ◽  
Vol 11 (3) ◽  
pp. 19-26 ◽  
Author(s):  
Ge Zhihui ◽  
Liang Anzhong ◽  
Li Taoshen
2015 ◽  
Vol 2015 ◽  
pp. 1-14 ◽  
Author(s):  
Minho Kim ◽  
Eun-Chan Park ◽  
Chong-Ho Choi

This paper deals with the problem of performance degradation in wireless local area networks (WLANs) based on IEEE 802.11n. When a wireless channel is shared by heterogeneous stations that have different data rates and packet sizes, each station occupies a different amount of airtime because the basic channel access mechanism of WLAN was originally designed to provide fair chance of channel access, regardless of packet size and data rate. This leads to the degradation of overall network throughput and airtime fairness among stations, which is known as performance anomaly. To resolve this problem, we firstly formulate an optimization problem for a generalized two-level frame aggregation whose objective is to maximize the achievable throughput under the constraint of airtime fairness. Then, we propose a frame size adaptation scheme that controls the number of packets in an aggregated frame. The proposed scheme is fully compatible with the IEEE 802.11 standard and works in a distributed manner, which neither modifies the channel access mechanism nor resorts to a centralized scheduling algorithm. The extensive simulation results confirm that the proposed scheme tightly regulates the airtime usage of each station to be almost the same and significantly improves the overall network throughput compared to other existing schemes.


2013 ◽  
Vol 36 (0) ◽  
pp. 49 ◽  
Author(s):  
Zhaolong Ning ◽  
Koji Okamura ◽  
Chengming Li

2015 ◽  
Vol 28 (2) ◽  
pp. e2942 ◽  
Author(s):  
Emna Charfi ◽  
Cédric Gueguen ◽  
Lamia Chaari ◽  
Bernad Cousin ◽  
Lotfi Kamoun

2013 ◽  
Vol 380-384 ◽  
pp. 2152-2156
Author(s):  
Ye Peng Ni ◽  
Xiao Sen Chen ◽  
Jian Bo Liu

Concurrent Multi-path Transfer extension of the Stream Control Transport Protocol (CMT-SCTP) has great potential to improve the utilization of scarce network bandwidth resource. Traditional CMT-SCTP adopts Round Robin (RR) algorithms to carry out packet scheduling that could affect the performance of SCTP traffic as unordered issues. In this paper, we discuss the unordered issues and propose a novel packet scheduling algorithm to improve the performance in heterogeneous wireless network. Our main idea is predicting the packet arriving time and then provides a path selection strategy. Through measuring round-trip time (RTT) and available bandwidth, we achieve an algorithm to predict the arriving time of data packets on one path, then give a reasonable path selection strategy to make sure that data arrives in the right order. By using proposed algorithm, the unordered packets and receive buffer blocking are reduced. We evaluate the performance of our algorithm by comparing it with the RR algorithm and show that it can resolve several performance issues.


Sign in / Sign up

Export Citation Format

Share Document