A new polynomial-time algorithm for linear programming
Combinatorica
A note on greedy algorithms for the maximum weighted independent set problem
Discrete Applied Mathematics
Interference-aware topology control and QoS routing in multi-channel wireless mesh networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Algorithms for routing and centralized scheduling to provide QoS in IEEE 802.16 mesh networks
WMuNeP '05 Proceedings of the 1st ACM workshop on Wireless multimedia networking and performance modeling
Proceedings of the 12th annual international conference on Mobile computing and networking
Efficient interference-aware TDMA link scheduling for static wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
MIMO Configurations for Relay Channels: Theory and Practice
IEEE Transactions on Wireless Communications
Relay-based deployment concepts for wireless and mobile broadband radio
IEEE Communications Magazine
Broadband wireless access with WiMax/802.16: current performance benchmarks and future potential
IEEE Communications Magazine
Throughput-range tradeoff of wireless mesh backhaul networks
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Wireless Communications & Mobile Computing
Minimizing multiplayer interactive delay in multihop wireless networks
International Journal of Communication Systems
A placement mechanism for relay stations in 802.16j WiMAX networks
Wireless Networks
Hi-index | 0.01 |
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.