On capacity regions of two-receiver broadcast packet erasure channels with feedback and memory

The two-receiver broadcast packet erasure channel with feedback and memory is studied. Memory is modelled using a finite-state Markov chain representing a channel state. Outer and inner bounds on the capacity region are derived when the channel state is strictly causally known at the transmitter. The bounds are both formulated in terms of feasibility problems and they are matching in all but one of the constraints. The results are extended to feedback with larger delay. Numerical results show that the gains offered through feedback can be quite large.

[1]  E. O. Elliott Estimates of error rates for codes on burst-noise channels , 1963 .

[2]  Robert G. Gallager,et al.  Capacity and coding for degraded broadcast channels , 1974 .

[3]  Leandros Tassiulas,et al.  Multiuser Broadcast Erasure Channel With Feedback—Capacity and Algorithms , 2010, IEEE Transactions on Information Theory.

[4]  Leandros Tassiulas,et al.  Scheduling and performance limits of networks with constantly changing topology , 1997, IEEE Trans. Inf. Theory.

[5]  Andrea J. Goldsmith,et al.  Capacity Theorems for Discrete, Finite-State Broadcast Channels With Feedback and Unidirectional Receiver Cooperation , 2010, IEEE Transactions on Information Theory.

[6]  Leandros Tassiulas,et al.  Resource Allocation and Cross-Layer Control in Wireless Networks , 2006, Found. Trends Netw..

[7]  Chih-Chun Wang,et al.  On the Capacity of Wireless 1-Hop Intersession Network Coding - A Broadcast Packet Erasure Channel Approach , 2012, IEEE Trans. Inf. Theory.

[8]  Michael Heindlmaier,et al.  The two-user broadcast packet erasure channel with feedback and memory , 2014, 2014 International Symposium on Network Coding (NetCod).

[9]  Chih-Chun Wang,et al.  Robust and optimal opportunistic scheduling for downlink 2-flow inter-session network coding with varying channel quality , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[10]  Michael J. Neely,et al.  Network utility maximization over partially observable Markovian channels , 2010, 2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks.

[11]  Leandros Tassiulas,et al.  Broadcast erasure channel with feedback - Capacity and algorithms , 2009, 2009 Workshop on Network Coding, Theory, and Applications.

[12]  Ahmed Iyanda Sulyman,et al.  High-speed satellite mobile communications: technologies and challenges , 2004, Proceedings of the IEEE.

[13]  Gerhard Kramer Capacity results for the discrete memoryless network , 2003, IEEE Trans. Inf. Theory.

[14]  Sibi Raj Bhaskaran,et al.  Gaussian Broadcast Channel With Feedback , 2008, IEEE Transactions on Information Theory.

[15]  Chih-Chun Wang,et al.  On the Capacity of 1-to- $K$ Broadcast Packet Erasure Channels With Channel Output Feedback , 2010, IEEE Transactions on Information Theory.

[16]  Muriel Médard,et al.  Scheduling for Network-Coded Multicast , 2012, IEEE/ACM Transactions on Networking.

[17]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[18]  Chih-Chun Wang On the Capacity of 1-to-K Broadcast Packet Erasure Channels With Channel Output Feedback , 2012, IEEE Trans. Inf. Theory.

[19]  Abbas El Gamal,et al.  The feedback capacity of degraded broadcast channels (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[20]  Babak Hassibi,et al.  The capacity region of multiple input erasure broadcast channels , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[21]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[22]  Maria Angeles Vázquez-Castro,et al.  Statistical modeling of the LMS channel , 2001, IEEE Trans. Veh. Technol..

[23]  R. Gallager Stochastic Processes , 2014 .

[24]  Daniel Cygan,et al.  The land mobile satellite communication channel-recording, statistics, and channel model , 1991 .

[25]  Ramji Venkataramanan,et al.  Achievable rates for the broadcast channel with feedback , 2010, 2010 IEEE International Symposium on Information Theory.

[26]  Christina Fragouli,et al.  Feedback-based coding algorithms for broadcast erasure channels with degraded message sets , 2012, 2012 International Symposium on Network Coding (NetCod).

[27]  Lawrence H. Ozarow,et al.  An achievable region and outer bound for the Gaussian broadcast channel with feedback , 1984, IEEE Trans. Inf. Theory.

[28]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[29]  Gunter Dueck,et al.  Partial Feedback for Two-Way and Broadcast Channels , 1980, Inf. Control..

[30]  Leandros Tassiulas,et al.  Dynamic server allocation to parallel queues with randomly varying connectivity , 1993, IEEE Trans. Inf. Theory.

[31]  Leandros Tassiulas Scheduling and performance limits of networks with constantly changing topology , 1997 .

[32]  Leandros Tassiulas,et al.  Resource Allocation and Cross Layer Control in Wireless Networks (Foundations and Trends in Networking, V. 1, No. 1) , 2006 .

[33]  Anthony Ephremides,et al.  A cross-layer approach for stable throughput maximization under channel state uncertainty , 2009, Wirel. Networks.

[34]  Eytan Modiano,et al.  Dynamic power allocation and routing for time varying wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[35]  Lei Ying,et al.  On Throughput Optimality With Delayed Network-State Information , 2008, IEEE Transactions on Information Theory.

[36]  Michele A. Wigger,et al.  On the Capacity of the Discrete Memoryless Broadcast Channel With Feedback , 2010, IEEE Transactions on Information Theory.

[37]  Chih-Chun Wang,et al.  The Capacity Region of Two-Receiver Multiple-Input Broadcast Packet Erasure Channels With Channel Output Feedback , 2014, IEEE Transactions on Information Theory.

[38]  E. Gilbert Capacity of a burst-noise channel , 1960 .

[39]  P. Sadeghi,et al.  Finite-state Markov modeling of fading channels - a survey of principles and applications , 2008, IEEE Signal Processing Magazine.

[40]  Patrick P. Bergmans,et al.  Random coding theorem for broadcast channels with degraded components , 1973, IEEE Trans. Inf. Theory.

[41]  Michael J. Neely,et al.  Exploiting channel memory for multi-user wireless scheduling without channel measurement: Capacity regions and algorithms , 2010, 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks.