High-SNR Analysis of Outage-Limited Communications With Bursty and Delay-Limited Information

This work analyzes the high-SNR asymptotic error performance of outage-limited communications with fading, where the number of bits that arrive at the transmitter during any timeslot is random but the delivery of bits at the receiver must adhere to a strict delay limitation. Specifically, bit errors are caused by erroneous decoding at the receiver or violation of the strict delay constraint. Under certain scaling of the statistics of the bit-arrival process with SNR, this paper shows that the optimal decay behavior of the asymptotic total probability of bit error depends on how fast the burstiness of the source scales down with SNR. If the source burstiness scales down too slowly, the total probability of error is asymptotically dominated by delay-violation events. On the other hand, if the source burstiness scales down too quickly, the total probability of error is asymptotically dominated by channel-error events. However, at the proper scaling, where the burstiness scales linearly with 1/ radic(log SNR) and at the optimal coding duration and transmission rate, the occurrences of channel errors and delay-violation errors are asymptotically balanced. In this latter case, the optimal exponent of the total probability of error reveals a tradeoff that addresses the question of how much of the allowable time and rate should be used for gaining reliability over the channel and how much for accommodating the burstiness with delay constraints.

[1]  Nick G. Duffield,et al.  Large deviations, the shape of the loss curve, and economies of scale in large multiplexers , 1995, Queueing Syst. Theory Appl..

[2]  Shlomo Shamai,et al.  Optimal Power and Rate Control for Minimal Average Delay: The Single-User Case , 2006, IEEE Transactions on Information Theory.

[3]  Pramod Viswanath,et al.  Approximately universal codes over slow-fading channels , 2005, IEEE Transactions on Information Theory.

[4]  P. Vijay Kumar,et al.  Perfect Space–Time Codes for Any Number of Antennas , 2007, IEEE Transactions on Information Theory.

[5]  Yannis Viniotis Probability and random processes for electrical engineers , 1997 .

[6]  Shlomo Shamai,et al.  Information theoretic considerations for cellular mobile radio , 1994 .

[7]  Tara Javidi,et al.  Optimal Operating Point in MIMO Channel for Delay-Sensitive and Bursty Traffic , 2006, 2006 IEEE International Symposium on Information Theory.

[8]  Tara Javidi,et al.  On the Responsiveness-Diversity-Multiplexing Tradeoff , 2007, 2007 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks and Workshops.

[9]  P. Vijay Kumar,et al.  Explicit, Minimum-Delay Space-Time Codes Achieving The Diversity-Multiplexing Gain Tradeo , 2004 .

[10]  Giuseppe Caire,et al.  Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels , 2004, IEEE Transactions on Information Theory.

[11]  Philip Schniter,et al.  On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels , 2005, IEEE Transactions on Information Theory.

[12]  Emre Telatar,et al.  Capacity of Multi-antenna Gaussian Channels , 1999, Eur. Trans. Telecommun..

[13]  Ashutosh Sabharwal,et al.  Delay-bounded packet scheduling of bursty traffic over wireless channels , 2004, IEEE Transactions on Information Theory.

[14]  P. Vijay Kumar,et al.  Perfect space-time codes with minimum and non-minimum delay for any number of antennas , 2005, 2005 International Conference on Wireless Networks, Communications and Mobile Computing.

[15]  Lizhong Zheng,et al.  Diversity-multiplexing tradeoff in multiple-access channels , 2004, IEEE Transactions on Information Theory.

[16]  Tara Javidi,et al.  Cooperative Diversity in Wireless Networks with Stochastic and Bursty Traffic , 2007, 2007 IEEE International Symposium on Information Theory.

[17]  A. Weiss A new technique for analyzing large traffic systems , 1986, Advances in Applied Probability.

[18]  Giuseppe Caire,et al.  The MIMO ARQ Channel: Diversity-Multiplexing-Delay Tradeoff , 2006, IEEE Trans. Inf. Theory.

[19]  Atm Switches,et al.  BUFFER OVERFLOW ASYMPTOTICS FOR A BUFFER HANDLING MANY TRAFFIC SOURCES , 1996 .

[20]  Jean-Claude Belfiore,et al.  Optimal Space–Time Codes for the MIMO Amplify-and-Forward Cooperative Channel , 2005, IEEE Transactions on Information Theory.

[21]  P. Vijay Kumar,et al.  Explicit Space–Time Codes Achieving the Diversity–Multiplexing Gain Tradeoff , 2006, IEEE Transactions on Information Theory.

[22]  Elza Erkip,et al.  User cooperation diversity. Part I. System description , 2003, IEEE Trans. Commun..

[23]  Amir Dembo,et al.  Large Deviations Techniques and Applications , 1998 .

[24]  J. Belfiore,et al.  Optimal Space-Time Codes for the Amplify-and-Forward Cooperative Channel , 2005 .

[25]  A. Robert Calderbank,et al.  Space-Time Codes for High Data Rate Wireless Communications : Performance criterion and Code Construction , 1998, IEEE Trans. Inf. Theory.

[26]  Dapeng Wu,et al.  Effective capacity: a wireless link model for support of quality of service , 2003, IEEE Trans. Wirel. Commun..

[27]  Tara Javidi,et al.  Relay Scheduling and Cooperative Diversity for Delay-Sensitive and Bursty Traffic , 2007 .

[28]  Andrea J. Goldsmith,et al.  Joint Source and Channel Coding for MIMO Systems: Is it Better to be Robust or Quick? , 2008, IEEE Transactions on Information Theory.

[29]  Lizhong Zheng,et al.  Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels , 2003, IEEE Trans. Inf. Theory.

[30]  Gregory W. Wornell,et al.  Cooperative diversity in wireless networks: Efficient protocols and outage behavior , 2004, IEEE Transactions on Information Theory.

[31]  Tara Javidi,et al.  Optimal operating point for MIMO multiple access channel with bursty traffic , 2007, IEEE Transactions on Wireless Communications.

[32]  Damon Wischik,et al.  Big Queues, Springer Lecture Notes in Mathematics , 2004 .

[33]  Rohit Negi,et al.  An information-theoretic approach to queuing in wireless channels with large delay bounds , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[34]  Parimal Parag,et al.  Resource Allocation and Quality of Service Evaluation for Wireless Communication Systems Using Fluid Models , 2007, IEEE Transactions on Information Theory.