...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Network Management >Efficient routing and centralized scheduling algorithms for IEEE 802.16 Mesh Networks†
【24h】

Efficient routing and centralized scheduling algorithms for IEEE 802.16 Mesh Networks†

机译：IEEE 802.16网状网络的高效路由和集中式调度算法†

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

An IEEE 802.16 wireless system can provide broadband wireless access to subscriber stations and operate in mesh mode. The communication between a subscriber station and a base station can pass through one or more intermediate subscriber stations. The IEEE 802.16 standard provides a centralized scheduling mechanism that supports contention-free and resource-guarantee transmission services in mesh mode. However, the corresponding algorithm to this schedule is quite primitive in the standard. In this paper, we propose a more efficient way to realize this schedule by maximizing channel utilization. Our designs are divided into two phases: routing and scheduling. First, a routing tree topology is constructed from a given mesh topology by our proposed tree construction algorithm. Secondly, we allocate channel resources to the edges in the routing tree by our proposed scheduling algorithm. To further support the quality-of-service schedule, we extend our designs by addressing some issues such as service class, admission control and fairness. Simulation results show the superiority of our proposed algorithms over others. Copyright © 2011 John Wiley & Sons, Ltd.
机译：IEEE 802.16无线系统可以为订户站提供宽带无线访问，并以网状模式运行。用户站和基站之间的通信可以通过一个或多个中间用户站。 IEEE 802.16标准提供了集中式调度机制，该机制支持网状模式下的无竞争和资源保证的传输服务。但是，此计划的相应算法在标准中是非常原始的。在本文中，我们提出了一种通过最大化信道利用率来实现此调度的更有效方法。我们的设计分为两个阶段：路由和调度。首先，通过我们提出的树构建算法，从给定的网格拓扑构建路由树拓扑。其次，通过我们提出的调度算法，将信道资源分配到路由树的边缘。为了进一步支持服务质量计划，我们通过解决服务等级，准入控制和公平性等问题来扩展我们的设计。仿真结果表明我们提出的算法优于其他算法。版权所有©2011 John Wiley＆Sons，Ltd.

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号