检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张云春[1] 王玉婧 姚绍文[1] 李娜[1] 胡建陶
机构地区:[1]云南大学软件学院,昆明650095
出 处:《电子科技大学学报》2017年第5期728-733,746,共7页Journal of University of Electronic Science and Technology of China
基 金:国家自然科学基金(61363021);云南省应用基础研究计划青年项目(2012FD004)
摘 要:多信道多天线(MCMR)广泛被用于提升无线Mesh网络的性能,但现有信道分配算法存在两方面问题:算法的时间太长和空间复杂度过高,无法获得全局最优解;算法可扩展性差,无法适用于大规模的网络。为解决上述问题,该文借鉴粒子群优化算法在收敛快、开销小等方面的优势,以建模无线Mesh网络中的信道分配问题。通过网络信息的交换和干扰模型的定义,以最小化适应度函数为优化目标,以天线、可用信道数量、信号干扰等为约束条件,设计并实现了基于粒子群优化的信道分配算法(PSOCA)。仿真实验表明了算法的可行性,且与同类算法相比,该算法在网络吞吐量和丢包率两个方面具有明显的改善。Multi-channel multi:radio (MCMR) has been widely used in wireless mesh networks for improving the network performance. Two primary problems are faced in existing channel assignment algorithms. One is that it is impossible to achieve global optimization because both the time and space complexity are high. The other problem is that those algorithms can not be scaled flexibly and, thus, cannot be applied to large networks. To solve the above problems, this paper models the channel assignment problem with particle swarm optimization model by utilizing its advantages of fast convergence and low cost. Based on the network message exchange and interference model, a particle swarm optimization based channel assignment algorithm (PSOCA) is proposed. This algorithm aims at minimizing the fitness function with constraints of radios, channels, interference and so on. Through intensive simulations, the algorithm proposed is proved feasible, both the network throughput and packet drop ratio are remarkably improved in comparison with other similar algorithms.
关 键 词:信道分配 适应度函数 多信道多天线 粒子群优化 无线MESH网络
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.36