TY - GEN
T1 - Optimal frame size analysis for fragmentation and aggregation algorithm
AU - Ku, Eunbi
AU - Chung, Chulho
AU - Kang, Byungcheol
AU - Kim, Jaeseok
N1 - Publisher Copyright:
© 2016 IEEE.
Copyright:
Copyright 2017 Elsevier B.V., All rights reserved.
PY - 2017/2/8
Y1 - 2017/2/8
N2 - In the IEEE 802.11 medium access control (MAC) layer, the reliability as well as the throughput is also important. The fragmentation and aggregation (F&A) algorithm to improve the throughput while ensuring the reliability in the environment with error uses the MAC service data unit (MSDU) fragmentation scheme of the upper layer and the MAC protocol data unit (MPDU) aggregation scheme of the MAC layer. The aggregation technique reduces the overhead of the frame format and improves the throughput. The fragmentation technique increases the transmission success probability and improves the reliability. When using F&A algorithm, the network throughput can be further improved. Although there were a lot of research on the F&A algorithm, these didn't cover the fragment size. Then it is left as user's choice. Furthermore, there is always a tradeoff between fragmentation and aggregation for wireless local area network (WLAN). We study this tradeoff and propose an optimal fragment size for aggregate-MPDU (A-MPDU), which can maximize the throughput by selecting the optimized fragment length based on different channel conditions.
AB - In the IEEE 802.11 medium access control (MAC) layer, the reliability as well as the throughput is also important. The fragmentation and aggregation (F&A) algorithm to improve the throughput while ensuring the reliability in the environment with error uses the MAC service data unit (MSDU) fragmentation scheme of the upper layer and the MAC protocol data unit (MPDU) aggregation scheme of the MAC layer. The aggregation technique reduces the overhead of the frame format and improves the throughput. The fragmentation technique increases the transmission success probability and improves the reliability. When using F&A algorithm, the network throughput can be further improved. Although there were a lot of research on the F&A algorithm, these didn't cover the fragment size. Then it is left as user's choice. Furthermore, there is always a tradeoff between fragmentation and aggregation for wireless local area network (WLAN). We study this tradeoff and propose an optimal fragment size for aggregate-MPDU (A-MPDU), which can maximize the throughput by selecting the optimized fragment length based on different channel conditions.
UR - http://www.scopus.com/inward/record.url?scp=85015457525&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85015457525&partnerID=8YFLogxK
U2 - 10.1109/TENCON.2016.7848646
DO - 10.1109/TENCON.2016.7848646
M3 - Conference contribution
AN - SCOPUS:85015457525
T3 - IEEE Region 10 Annual International Conference, Proceedings/TENCON
SP - 3228
EP - 3231
BT - Proceedings of the 2016 IEEE Region 10 Conference, TENCON 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2016 IEEE Region 10 Conference, TENCON 2016
Y2 - 22 November 2016 through 25 November 2016
ER -