基于遺傳算法的自適應(yīng)CSMA/CA包調(diào)度

隨著無線通信的發(fā)展，網(wǎng)絡(luò)業(yè)務(wù)將逐漸由語音業(yè)務(wù)為主過渡到以不同QoS 要求的數(shù)據(jù)業(yè)務(wù)占主導(dǎo)地位, 簡(jiǎn)單的無線包調(diào)度算法如 max.C/I（最大信噪比）和WRR（公平輪循）
將無法滿足不同數(shù)據(jù)業(yè)務(wù)QoS 需求。本文提出一種適應(yīng)無線局域網(wǎng)特點(diǎn)的基于遺傳算法的自適應(yīng)包調(diào)度算法（AGAPS），該算法工作在數(shù)據(jù)鏈路層，這種算法適應(yīng)無線網(wǎng)絡(luò)；AGAPS根據(jù)信道狀態(tài)、業(yè)務(wù)的QoS 需求、隊(duì)列長(zhǎng)度等參數(shù)來決定系統(tǒng)資源的分配，保護(hù)基站免受一些信息包流量的過度輪詢，減少系統(tǒng)延時(shí)，提高系統(tǒng)的吞吐量。仿真結(jié)果表明AGAPS 算法對(duì)比max.C/I 算法有更好的用戶公平性，而且系統(tǒng)吞吐量比WRR 算法高。
關(guān)鍵字：自適應(yīng)包調(diào)度；QoS ；遺傳算法
Abstract:With the development of wireless communications, network business will transit gradually from the Voice mainly to the different QoS requirements data-dominated business. Simple wireless packet scheduling algorithm as max.C/I and? WRR will not be able to meet the needs of different data QoS. A GA based adaptive packet scheduling algorithm (AGAPS) for WLAN was proposed in this paper, this algorithm worked in the data link layer, this algorithm adapt wireless networks. AGAPS according to the channel state, the QoS needs of business and the length of the queue to determine the allocation of the system resources. To protection of base stations from some of the packets flow over polling, reduce system latency and improve the throughput. Simulation results show that the proposed AGAPS have better user fairness than max .C/I and higher system throughput than WRR.
Keywords: adaptive packet scheduling；QoS； GA；