A Network Coding Scheme to Improve Throughput for IEEE 802.11 WLAN

作     者：Chi, Kaikai Zhu, Yi-hua Wu, Yongchao Leung, Victor C. M. 

作者机构：Zhejiang Univ Technol Sch Comp Sci & Technol Hangzhou 310023 Zhejiang Peoples R China Univ British Columbia Dept Elect & Comp Engn Vancouver BC V6T 1Z4 Canada 

出 版 物：《MOBILE NETWORKS & APPLICATIONS》 (移动网络与应用)

年 卷 期：2016年第21卷第3期

页      面：425-435页

核心收录：

学科分类：0810[工学-信息与通信工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：Society for Experimental Mechanics, SEM National Natural Science Foundation of China, NSFC, (61379124, 61432015, 61472367) Ministry of Education of the People's Republic of China, MOE, (20123317110002) Smoking Research Foundation, SRF Natural Science Foundation of Zhejiang Province, ZJNSF, (LY13F020025) 

主　　题：WLAN Network coding Throughput IEEE 802.11 standard 

摘      要：In IEEE 802.11 infrastructure wireless local area network (WLAN), the communication between any two nodes is relayed by an access point (AP), which becomes the bottleneck of WLAN and severely restricts the overall throughput. It is well known that network coding technique is able to greatly improve the throughput of wireless networks. But, the available coding schemes do not make full advantage of channel capacity due to the fact that they pick at most one packet from each data flow for coding and the picked packets may have a great difference in packet size, wasting some channel capacity. To remedy the problem, in this paper, we propose the coding scheme that combines multiple buffered packets in one flow into a larger packet for coding so that the packets participating in coding have close sizes. We formulate an integer programming problem to find the optimal packet coding, which is solved by an optimal algorithm with relative high time complexity together with a heuristic algorithm with relative low time complexity. Simulation results show that the proposed coding scheme is able to greatly improve the throughput of WLAN and the throughput gain increases with the growth of the number of coding flows.