| 无线中继网络的联合路由与调度的近似最优算法 |
| |
| 作者姓名： | 孙绍峰 卫国 |
| |
| 作者单位： | 中国科学技术大学无线网络通信安徽省重点实验室,合肥 230027 |
| |
| 基金项目： | 国家重点基础研究973计划(2007CB310602)资助 |
| |
| 摘 要： | 在基于802.16j的无线中继网络中,考虑路由和调度的联合优化问题,最小化系统总调度时间. 首先采用线性规划的方法建立路由,进行链路业务速率分配,然后基于平移和交换思想提出一种链路调度算法. 理论分析证明所提算法的性能在最坏情况下,不会超过最优性能的1.5倍. 仿真结果表明,所提算法的平均性能非常接近最优性能.
|
| 关 键 词： | 无线中继网络 路由 调度 近似算法 |
| 收稿时间： | 2009-12-02 |
| 修稿时间： | 2010-02-20 |
Approximate algorithm for joint routing and scheduling in wireless relay networks |
| |
| Authors: | SUN Shao-Feng WEI Guo |
| |
| Institution: | Wireless Information Network Laboratory, University of Science and Technology of China, Hefei 230027, China |
| |
| Abstract: | The problem of joint routing and scheduling in 802.16j based wireless relay networks is studied to minimize the traffic time. The routing problem is solved by linear programming method, and the traffic is allocated to links. A novel link scheduling algorithm based on shifting and switching is proposed. Theoretical analysis indicates that the performance of the proposed algorithm is within a factor of 1.5 of that of any optimal algorithm in the worst case. Simulation results show that with the proposed algorithm near-optimal performance can be effectively achieved. |
| |
| Keywords: | wireless relay networks routing scheduling approximate algorithm |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《》浏览原始摘要信息 |
| 点击此处可从《》下载免费的PDF全文 |
