Dynamic index coding for wireless broadcast networks

We consider a wireless broadcast station that transmits packets to multiple users. The packet requests for each user may overlap, and some users may already have certain packets. This presents a problem of broadcasting in the presence of side information, and is a generalization of the well known (and unsolved) index coding problem of information theory. Rather than achieving the full capacity region, we develop a code-constrained capacity region, which restricts attention to a pre-specified set of coding actions. We develop a dynamic max-weight algorithm that allows for random packet arrivals and supports any traffic inside the code-constrained capacity region. Further, we provide a simple set of codes based on cycles in the underlying demand graph. We show these codes are optimal for a class of broadcast relay problems.

[1]  Michael Langberg,et al.  On the Hardness of Approximating the Network Coding Capacity , 2011, IEEE Trans. Inf. Theory.

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

[3]  Vineeth Bala Sukumaran,et al.  Average-delay optimal policies for the point-to-point channel , 2009, 2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks.

[4]  Uri Stav,et al.  Non-Linear Index Coding Outperforming the Linear Optimum , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[5]  Tracey Ho,et al.  A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.

[6]  Sachin Katti,et al.  The Importance of Being Opportunistic: Practical Network Coding for Wireless Environments , 2005 .

[7]  Yunnan Wu,et al.  Information Exchange in Wireless Networks with Network Coding and Physical-layer Broadcast , 2004 .

[8]  Yitzhak Birk,et al.  Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients , 2006, IEEE Transactions on Information Theory.

[9]  Xuemin Chen,et al.  Error-Control Coding for Data Networks , 1999 .

[10]  M.A.R. Chaudhry,et al.  Efficient algorithms for Index Coding , 2008, IEEE INFOCOM Workshops 2008.

[11]  M. Neely.  Queue Stability and Probability 1 Convergence via Lyapunov Optimization , 2010, 1008.3519.

[12]  Michael J. Neely,et al.  Stability and Probability 1 Convergence for Queueing Networks via Lyapunov Optimization , 2012, J. Appl. Math..

[13]  Yunnan Wu,et al.  The Local Mixing Problem , 2006 .

[14]  Muriel Médard,et al.  XORs in the air: practical wireless network coding , 2008, TNET.

[15]  Ziv Bar-Yossef,et al.  Index Coding With Side Information , 2011, IEEE Trans. Inf. Theory.

[16]  Alexander Sprintson,et al.  On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory , 2008, IEEE Transactions on Information Theory.

[17]  Alexandros G. Dimakis,et al.  Bipartite index coding , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[18]  Yitzhak Birk,et al.  Informed-source coding-on-demand (ISCOD) over broadcast channels , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[19]  Noga Alon,et al.  Broadcasting with Side Information , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.