Link Scheduling with QoS Guarantee for Wireless Relay Networks

—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 multi-hop link scheduling with bandwidth and delay guarantee over WRNs. Our optimization problem is investigated under a general interference model with a generic objective. The objective can be based on various kinds of performance indexes (e.g., throughput, fairness and capacity) determined by service providers. Through the theoretical analysis, the intractability and in-approximability of the optimization problem are shown. Due to the intractable computational complexity, we present efficient algorithms to practically provide a small approximation factor against any optimal solution even for a worst-case input. Furthermore, the experimental results indicate that our presented algorithms yield near-optimal performance in the average case.

• Type: Conference
• Year: 2009
• Where: INFOCOM
• Authors: Chi-Yao Hong, Ai-Chun Pang
• Keywords: Communications, INFOCOM 2009, Multi-hop Link Scheduling, Optimization Problem, Wireless Relay Networks