3-Approximation Algorithm for Joint Routing and Link Scheduling in Wireless Relay Networks
Resource
IEEE Transactions on Wireless Communications 8 (2): 856-861
Journal
IEEE Transactions on Wireless Communications
Pages
856-861
Date Issued
2009
Date
2009
Author(s)
Hong, Chi-Yao
Abstract
In emerging wireless relay networks (WRNs) such as IEEE 802.16j, efficient resource allocation is becoming a substantial issue for throughput optimization. In this paper, we propose an algorithm for joint routing and link scheduling in WRNs. The developed theoretical analysis indicates that the performance of the proposed algorithm is within a factor of three of that of any optimal algorithm in the worst case. Through simulation experiments, the numerical results show that our algorithm outperforms the previously proposed routing and link-scheduling algorithms. Furthermore, the proposed algorithm can effectively achieve near-optimal performance, and provide much better throughput than the theoretical worst-case bound in the average case.
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
14.pdf
Size
276.62 KB
Format
Adobe PDF
Checksum
(MD5):cbc3794ac005ff243bb0020e8be52ef0