Throughput of QoS Guaranteed Wireless Systems With/Without Channel State Information

In this paper, we investigate the throughput of wireless systems in the presence of random data arrivals and quality-of-service (QoS) requirements, which are statistically characterized by the queueing-bound violation probability. By combining the concepts of effective capacity and effective bandwidth, we propose a unified analytical framework to investigate the achievable throughput. Employing the proposed unified framework, we further acquire the explicit expressions of the throughput of QoS guaranteed wireless systems with the channel state information (CSI) known/unknown at the transmitter. Specifically, the acquired throughput is characterized by the first-and second-order statistics of the random data arrivals, and it is shown that the QoS requirements affect the throughput by the second-order statistics of the random data arrivals and the random data transmissions. In addition, our theoretical analysis demonstrates that the throughput under QoS constraints is tighter than the conventional stable throughput, and that the first-order statistic of the random data arrivals is sufficient to characterize the throughput when the system can tolerate an arbitrarily long queueing delay. In particular, we prove that the queueing-bound violation probability decays exponentially with the queueing bound. Finally, simulation results corroborate the theoretical analysis.