基于连通性的动态固定信道分配算法  

Dynamic Fixed Channel Allocation Algorithm Based on Connectivity

作　　者：尹凤杰[1] 梅丙乾 杨晖[1] 张颖 

机构地区：[1]辽宁大学信息学院,辽宁沈阳110036

出　　处：《辽宁大学学报（自然科学版）》2017年第4期294-301,共8页Journal of Liaoning University：Natural Sciences Edition

基　　金：辽宁省教育厅科学研究一般项目资助(项目编号:L2015204)

摘　　要：随着跳数的增加,无线Mesh网络的延迟开始增大,吞吐量开始降低,QoS难以得到保证.基于多信道多接口的信道分配策略可以很好地解决上述问题,但目前对多信道Mesh网络的研究往往忽视了节点之间的连通性问题.在原有的宽带优先搜索(BFS,Breadth First Search)算法的基础上,针对动态固定信道分配(DFCA,Dynamic Fixed Channel Allocation)算法进行研究,在保证连通性的前提下,为每个节点动态的分配固定信道,减少了链路之间干扰,提高了传输效率,同时考虑了新加入节点以及失效节点带来的问题.仿真结果表明,在发送速率较大、数据流数较多的情况下,DFCA算法较传统算法在吞吐量方面得到很大提高.With the increase of hop,delay of WMN began to increase,throughput began to reduce,and the QoS is also difficult to guarantee.In numerous solutions to solve these problems,the channel allocation strategy based on multi-channel multi-interface technology can well solve the interference and the transmission rate problems in traditional WMN.But at present the study of multi-channel WMN tend to ignore the premise of mutual communication between nodesconnectivity.On the basis of the original breadth first search（ BFS） algorithm,this paper put forward the dynamic fixed channel allocation（ DFCA） algorithm.On the premise of guarantee connectivity,the algorithm allocated fixed channel for each node dynamically,reduced the interference between links,and improved the transmission efficiency.The condition which nodes are newor failure was also considered.Simulation results demonstrate that the algorithm of DFCA can improve thethroughput than traditional algorithms in the case of large sending rate and more data flow.

关 键 词：MESH网络 多信道 多接口 动态分配 固定信道 

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