FRA:基于帧长和发送速率的信道竞争算法  

FRA:Channel Contending Algorithm Based on Frame Size and Transmission Rate

作　　者：赵红敏[1,2] 王建新[1] 黄家玮[1] 

机构地区：[1]中南大学信息科学与工程学院,长沙410083 [2]中南林业科技大学计算机科学学院,长沙410004

出　　处：《计算机工程》2010年第17期123-125,128,共4页Computer Engineering

基　　金：国家自然科学基金资助项目(60673164);湖南省杰出青年基金资助项目(06JJ10009);新世纪优秀人才支持计划基金资助项目(NCET-05-0683);长江学者和创新团队发展计划基金资助项目(IRT0661)

摘　　要：提出一种MAC层竞争信道的FRA算法。FRA算法以实验测得的数据帧长和信道速率作为调节CWmin的因子,提高了发送大数据帧或高速信道节点的信道占用时间。实验结果表明,该算法在速率、帧长各异的无线网络环境中,网络总吞吐率比DCF协议提高约70%。A MAC algorithm Frame-cum-Rate Adjustment（FRA） is proposed to contend for the wireless channel. In FRA, the value of CWmin is adjusted based on frame size acquired by lots of experiments and transmission rate. The wireless station with large frame size and high transmission rate can obtain high probability to access wireless channel. Simulation results show that compared with DCF, FRA increases the network throughput by 70% when different frame sizes and transmission rates coexist.

关 键 词：数据帧长 发送速率 无线局域网 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]