Adaptive resource reuse scheduling for multihop relay wireless network based on multicoloring

被引：7

作者：

Guo, Xin ^{[1
]}

Ma, Wenchao ^{[2
]}

Guo, Zihua ^{[2
]}

Shen, Xuemin ^{[3
]}

Hou, Zifeng ^{[2
]}

机构：

[1] Univ Sci & Technol China, Dept Comp Sci & Technol, Hefei 230026, Peoples R China

[2] Lenovo Corp Res & Dev, Beijing, Peoples R China

[3] Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON N2L 3G1, Canada

来源：

IEEE COMMUNICATIONS LETTERS | 2008年 / 12卷 / 03期

关键词：

relay networks; scheduling; multimedia services; multicoloring; approximation algorithms; NP-hard;

D O I：

10.1109/LCOMM.2008.071743

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

In this paper, an adaptive resource reuse scheduling (ARRS) algorithm is presented with the goal of enhancing the system capacity for relay networks, which supports arbitrary topology and relay stations (RSs) mobility. Since one key step in ARRS is modeled as graph multicoloring, a fast inverted right perpenidcular Delta+1/2 inverted left perpendicular approximation algorithm named dual sorting greedy (DSG) is provided for the problem. Simulation results show that ARRS achieves high system capacity and hence satisfies the multimedia service QoS requirements of relay networks efficiently.

引用

页码：176 / 178

页数：3