一种新颖的多信道多接口无线Mesh网络的接入调度算法  

A novel access scheduling algorithm in multi-channel multi-radio wireless mesh networks

作　　者：程红举[1] 庄小芳[1] 

机构地区：[1]福州大学数学与计算机科学学院,福建福州350108

出　　处：《福州大学学报（自然科学版）》2009年第6期812-817,共6页Journal of Fuzhou University(Natural Science Edition)

基　　金：教育部科技重点资助项目(209062);福建省教育厅科研资助项目(JA08002);国家自然科学基金资助项目(10871221);福建省自然科学基金重点资助项目(A0820002)

摘　　要：无线Mesh网络信道接入调度问题是指在一个调度周期内为网络中每个节点在信道上分配时隙,在该时隙上节点可以向邻居发送控制信息,问题的目标是最小化调度周期长度.提出采用饱和度(staturation degree)的方法来研究这个问题,与现有方法关键不同之处是,饱和度算法的每一步不是对节点本身,而是对节点的邻居依次分配时隙.在第一步完成对网络中邻居最多的节点的分配后,调度周期的长度已逼近理论下界,从而在随后分配过程中可充分实现时隙的空间复用.同时也提出了该算法的分布式实现,并对算法性能进行了理论分析.仿真实验结果表明,算法在各种情况下实验结果均非常接近理论的下限.The channel access scheduling in wireless mesh networks is to assign time -slots for each node on the channel in one scheduling cycle which can used to send control message to the neighbors. The aim is to minimize the length of the scheduling cycle. A novel method based on the Saturation Degree is proposed in this paper. The key difference from other works is that the proposed method consequently assigns time - slots for the neighbors instead of the node itself. When neighbors of the node with maximum node degree are assigned in the first step, the cycle length is close to the theoretical lower bound, and thus more time - slots are available for spatial reuse in the following steps. The distributed version of the algorithm is proposed in this paper too. Theoretic analysis is also done on the algorithm performance. Simulation results have shown that the scheduling cycle length is very close to the theoretic lower bound.

关 键 词：信道接入调度 分布式算法 时分多址(TDMA) 无线MESH网络 

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