无线Mesh网络中满足带宽需求的路由器部署方法

发布时间：2018-06-18 15:05

本文选题：无线Mesh网络 + Mesh路由器部署　；参考：《计算机学报》2014年02期

【摘要】：无线Mesh网络是移动互联网的一种重要接入方式,如何合理、高效地部署Mesh路由器(Mesh Router,MR),从而以较低的部署成本获得较好的网络性能,是当前的研究热点.文中首先给出一种分层的部署场景模型及相关假设,并在此基础上利用混合整数线性规划方法对MR部署问题进行形式化描述;然后提出一种基于网络流的MR部署贪心算法NF Greedy,该算法以迭代的方式从MR候选位置集中选择权重最大的节点进行相应的节点部署,其中节点权重定义为当前网络可满足的最大用户带宽需求的平均增量,可利用网络流方法进行求解;最后通过一系列仿真实验将NF Greedy算法与现有算法进行对比,实验结果表明该算法与基于MILP的算法相比,虽然所部署的MR数量略多,但是能适用于较大规模的WMN;而与启发式的ILSearch算法相比,则大大减少了所部署MR的数量.
[Abstract]:Wireless mesh network (WMN) is one of the most important access methods in mobile Internet. How to deploy mesh Router (MRN) reasonably and efficiently so as to achieve better network performance with lower deployment cost is a hot research topic at present. In this paper, a hierarchical deployment scenario model and related assumptions are presented, and then the mixed integer linear programming (MILP) is used to formalize the Mr deployment problem. Then, a greedy algorithm NF Greedy-based Mr deployment based on network flow is proposed. In this algorithm, the nodes with the largest weight are selected from the Mr candidate location set to deploy the nodes iteratively. The node weight is defined as the average increment of the maximum bandwidth requirement of the current network, which can be solved by the network flow method. Finally, the NF greedy algorithm is compared with the existing algorithm through a series of simulation experiments. Experimental results show that compared with MILP-based algorithm, the proposed algorithm can be applied to large scale WMNs, although the number of Mr deployed is a little larger, and compared with the heuristic ILSearch algorithm, the number of deployed Mr is greatly reduced.
【作者单位】：东南大学计算机科学与工程学院;
【基金】：国家“九七三”重点基础研究发展规划项目基金(2010CB328104) 国家自然科学基金(61272054,61202449,61320106007) 国家“八六三”高技术研究发展计划项目基金(2013AA013503) 国家科技支撑计划(2010BAI88B03,2011BAK21B02) 高等学校博士学科点专项科研基金(20110092130002) 中央高校基本科研业务费专项资金(2242014R30010)资助~~
【分类号】：TN929.5

【参考文献】