https://scholars.lib.ntu.edu.tw/handle/123456789/413257
標題: | Approximation algorithms for a link scheduling problem in wireless relay networks with QoS guarantee | 作者: | Hong C.-Y. Pang A.-C. Hsiu P.-C. |
關鍵字: | Approximation algorithms;link scheduling;quality of service;wireless relay networks | 公開日期: | 2010 | 卷: | 9 | 期: | 12 | 起(迄)頁: | 1732-1748 | 來源出版物: | IEEE Transactions on Mobile Computing | 摘要: | The emerging wireless relay networks (WRNs) are expected to provide significant improvement on throughput and extension of coverage area for next-generation wireless systems. We study an optimization problem for multihop link scheduling with bandwidth and delay guarantees over WRNs. Our optimization problem is investigated under a more general interference model with a generic objective. The objective can be based on various kinds of performance indexes (e.g., throughput, fairness, and capacity), which can be determined by service providers. Through our theoretical analysis, the intractability and inapproximability of the optimization problem are shown. Due to the intractable computational complexity, we present efficient algorithms to provide a reasonable small approximation factor against any optimal solution even for a worst-case input. Furthermore, some experimental results indicate that our algorithms yield near-optimal performance in the average case. ? 2006 IEEE. |
URI: | https://scholars.lib.ntu.edu.tw/handle/123456789/413257 | ISSN: | 15361233 | DOI: | 10.1109/TMC.2010.142 |
顯示於: | 資訊工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。