首页> 外文会议>IEEE International Conference on Advanced Infocomm Technology >Backhaul Topology Design and Weighted Max-Min Fair Capacity Allocation in Wireless Mesh Networks
【24h】

Backhaul Topology Design and Weighted Max-Min Fair Capacity Allocation in Wireless Mesh Networks

机译:无线网状网络中回程拓扑设计和加权MAX-MIN公平容量分配

获取原文

摘要

In this paper we focus on the Multi-Channel, Multi-Radio Wireless Mesh Network design issue. We propose an effective planning approach which considers two folds. First, to determine the backhaul topology by interconnecting wirelessly the mesh routers (MRs). Second, to share based on the weighted max-min fair scheme the available capacity between connected mesh routers. We formulate both aspects as a global problem. Due to the high computational complexity, we deal with the global problem by decoupling it into two separated problems: bakhaul topology formation and the weighted max-min fair capacity allocation problems. These latter aspects are treated sequentially where we adopt local search heuristics in order to address the scalability issue. Numerical results are presented to demonstrate the effectiveness of our proposition. Thus, we evaluate the proposed heuristics according to the exact solution of the global problem, and we discuss their opportunities.
机译:在本文中,我们专注于多通道,多无线无线网状网络设计问题。我们提出了一种有效的规划方法,旨在考虑两倍。首先,通过无线互连网状路由器(MRS)来确定回程拓扑。其次,基于加权MAX-MIN公平方案共享连接网状路由器之间的可用容量。我们将两个方面作为全局问题。由于计算复杂性高,我们通过将其与两个分开的问题解耦来处理全局问题:Bakhaul拓扑形成和加权MAX-MIN公平容量分配问题。这些后一种方面是顺序对待的,在那里我们采用本地搜索启发式方法以解决可扩展性问题。提出了数值结果以证明我们主张的有效性。因此,我们根据全球问题的确切解决方案评估了提议的启发式机会,我们讨论了他们的机会。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号