Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Tight approximation algorithms for maximum general assignment problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Proceedings of the 12th annual international conference on Mobile computing and networking
Proceedings of the 12th annual international conference on Mobile computing and networking
Scheduling algorithms for multi-carrier wireless data systems
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Cross-layer optimization for OFDM wireless networks-part I: theoretical framework
IEEE Transactions on Wireless Communications
Performance of cellular networks with relays and centralized scheduling
IEEE Transactions on Wireless Communications
Transmit power adaptation for multiuser OFDM systems
IEEE Journal on Selected Areas in Communications
Low-overhead scheduling algorithms for OFDMA relay networks
Proceedings of the 4th Annual International Conference on Wireless Internet
Interference aware relay station location planning for IEEE 802.16j mobile multi-hop relay network
Proceedings of the 4th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Interference aware routing and scheduling in wireless backhaul networks with smart antennas
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Exploiting cooperative diversity and spatial reuse in multihop cellular networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Resource allocation in multi-cell OFDMA-based relay networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Cooperation vs. multiplexing: multicast scheduling algorithms for ofdma relay networks
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Delay analysis and optimality of scheduling policies for multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
Design a novel fairness model in WiMAX mesh networks
Computer Communications
Feasibility of SINR guarantees for downlink transmissions in relay-enabled OFDMA networks
Automatica (Journal of IFAC)
Efficient and adaptive resource scheduling in IEEE 802.16j transparent relay networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Relay-enabled wireless networks (eg. WIMAX 802.16j) represent an emerging trend for the incorporation of multi-hop networking solutions for last-mile broadband access in next generation wireless networks. The adoption of more sophisticated access technologies such as OFDM (orthogonal frequency division multiplexing) coupled with the relay-induced two-hop nature, provides two key benefits to these networks in the form of diversity and spatial reuse gains. However, leveraging these benefits calls for more sophisticated solutions, among which, user scheduling forms a key component. We consider the specific problem of scheduling users with finite buffers on the multiple OFDM carriers (channels over the two hops of the relay-enabled network. We propose scheduling algorithms that help leverage diversity and spatial reuse gains from these networks. We show that even the scheduling problem to exploit diversity gains alone is NP-hard and provide both theoretically and practically efficient polynomial-time algorithms with approximation guarantees. Building on the diversity solutions, we also propose an efficient polynomial-time scheduling algorithm for exploiting both spatial reuse as well as diversity. The proposed solutions are evaluated to highlight the relative significance of diversity and spatial reuse gains with respect to varying network conditions.