首页> 外文会议>Sensor, Mesh and Ad Hoc Communications and Networks Workshops, 2009. SECON Workshops '09 >Clique-Based Utility Maximization in Wireless Mesh Networks-Algorithm, Simulation, and Mathematical Analysis
【24h】

Clique-Based Utility Maximization in Wireless Mesh Networks-Algorithm, Simulation, and Mathematical Analysis

机译:无线网状网络中基于集团的效用最大化-算法,仿真和数学分析

获取原文

摘要

Compared with cellular networks, wireless mesh networks (WMNs) need more careful design for resource allocation. To this end, we develop a clique-based proportional fair scheduling (CBPFS) algorithm for WMNs. Furthermore, we obtain a closed-form model to quantify the throughput of connection links and traffic flows in multi-hop transmissions. We use the derived analytical framework to estimate the throughput of CBPFS and compared it with simulations. It is the first time a mathematical model is developed to quantify the throughput of links and end-to-end flows in a multi-hop network where links are proportionally fair scheduled.
机译:与蜂窝网络相比,无线网状网络(WMN)需要更仔细的资源分配设计。为此,我们为WMN开发了基于派系的比例公平调度(CBPFS)算法。此外,我们获得了一个封闭形式的模型来量化多跳传输中连接链路的吞吐量和流量。我们使用派生的分析框架来估计CBPFS的吞吐量,并将其与仿真进行比较。这是首次开发数学模型来量化链路按比例公平调度的多跳网络中链路和端到端流的吞吐量。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号