Data Dissemination With Side Information and Feedback

Index coding (IC), which can be regarded as a special class of network coding, deals with the problem of sending a number of packets to a group of receivers, each of which requests one packet and may have some other packets in its cache. This paper generalizes the IC problem in that both the packet requested by a receiver and the packets in its cache can be linear combinations of the packets. To minimize the number of transmissions required, a heuristic algorithm based on the idea of partitioning the users into coding groups is designed. To realize this idea, a polynomial time algorithm to determine whether a set of users form a coding group over the binary field or a field with a size larger than the number of users is constructed. For users that form a coding group, the corresponding encoding vector can be also found. A lower bound is derived in order to evaluate the performance of the heuristic algorithm. Numerical results show that the number of transmissions required by the heuristic algorithm and the lower bound both grow roughly linearly with the number of users, and the heuristic algorithm outperforms some benchmark algorithms.

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

[2]  Mohammad Hamed Firooz,et al.  Collaborative downloading in VANET using Network Coding , 2012, 2012 IEEE International Conference on Communications (ICC).

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

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

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

[6]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[7]  Syed Ali Jafar,et al.  Index Coding - An Interference Alignment Perspective , 2014, IEEE Trans. Inf. Theory.

[8]  Shahrokh Valaee,et al.  An Adaptive Network Coded Retransmission Scheme for Single-Hop Wireless Multicast Broadcast Services , 2011, IEEE/ACM Transactions on Networking.

[9]  Uri Stav,et al.  Nonlinear Index Coding Outperforming the Linear Optimum , 2007, IEEE Transactions on Information Theory.

[10]  Victor C. S. Lee,et al.  Coding-Based Data Broadcast Scheduling in On-Demand Broadcast , 2011, IEEE Transactions on Wireless Communications.

[11]  Alexandros G. Dimakis,et al.  Local graph coloring and index coding , 2013, 2013 IEEE International Symposium on Information Theory.

[12]  Lele Wang,et al.  On the capacity region for index coding , 2013, 2013 IEEE International Symposium on Information Theory.

[13]  Michael Langberg,et al.  On the Hardness of Approximating the Network Coding Capacity , 2008, IEEE Transactions on Information Theory.

[14]  Alexandros G. Dimakis,et al.  Femtocaching and device-to-device collaboration: A new architecture for wireless video distribution , 2012, IEEE Communications Magazine.

[15]  Petar Popovski,et al.  Cell-Edge Multi-User Relaying with Overhearing , 2013, IEEE Communications Letters.

[16]  René Peeters,et al.  Orthogonal representations over finite fields and the chromatic number of graphs , 1996, Comb..

[17]  Alexander Sprintson,et al.  On the Minimum Number of Transmissions in Single-Hop Wireless Coding Networks , 2007, 2007 IEEE Information Theory Workshop.

[18]  Kenneth W. Shum,et al.  Broadcasting with coded side information , 2012, 2012 IEEE 23rd International Symposium on Personal, Indoor and Mobile Radio Communications - (PIMRC).

[19]  Hans Schönemann,et al.  SINGULAR: a computer algebra system for polynomial computations , 2001, ACCA.

[20]  Robert D. Kleinberg,et al.  Index coding via linear programming , 2010, ArXiv.

[21]  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.

[22]  Hamid Aghvami,et al.  A survey on mobile data offloading: technical and business perspectives , 2013, IEEE Wireless Communications.

[23]  Xuemin Shen,et al.  A Distributed Fault/Intrusion-Tolerant Sensor Data Storage Scheme Based on Network Coding and Homomorphic Fingerprinting , 2012, IEEE Transactions on Parallel and Distributed Systems.

[24]  Yeow Meng Chee,et al.  Optimal index codes with near-extreme rates , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[25]  Ishay Haviv,et al.  Linear Index Coding via Semidefinite Programming† , 2011, Combinatorics, Probability and Computing.

[26]  Shahrokh Valaee,et al.  Completion Delay Minimization for Instantly Decodable Network Coding with Limited Feedback , 2011, 2011 IEEE International Conference on Communications (ICC).

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

[28]  Xiaodong Wang,et al.  On Partial Downloading for Wireless Distributed Storage Networks , 2012, IEEE Transactions on Signal Processing.

[29]  Michael Langberg,et al.  Index coding with outerplanar side information , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[30]  Gyu Myoung Lee,et al.  Efficient Multicast Schemes Using In-Network Caching for Optimal Content Delivery , 2013, IEEE Communications Letters.

[31]  Petar Popovski,et al.  Coordinated Direct and Relay Transmission With Linear Non-Regenerative Relay Beamforming , 2012, IEEE Signal Processing Letters.

[32]  Michael Langberg,et al.  On the complementary Index Coding problem , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[33]  Chi Wan Sung,et al.  Linear Network Coding Strategies for the Multiple Access Relay Channel with Packet Erasures , 2013, IEEE Transactions on Wireless Communications.

[34]  Zhen Zhang,et al.  Dynamic Index Coding for Wireless Broadcast Networks , 2013, IEEE Transactions on Information Theory.

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

[36]  David A. Cox,et al.  Using Algebraic Geometry , 1998 .

[37]  Thomas E. Fuja,et al.  Capacity and Coding for Two Common Wireless Erasure Relay Networks with Optimal Bandwidth Allocation , 2012, IEEE Transactions on Wireless Communications.

[38]  Guangxi Zhu,et al.  Cooperative Caching Scheme for Content Oriented Networking , 2013, IEEE Communications Letters.

[39]  Omer Gurewitz,et al.  Coded unicast downstream traffic in a wireless network: analysis and WiFi implementation , 2013, EURASIP Journal on Advances in Signal Processing.

[40]  Lawrence Ong,et al.  Optimal index codes for a class of multicast networks with receiver side information , 2012, 2012 IEEE International Conference on Communications (ICC).

[41]  Muriel Médard,et al.  XORs in the Air: Practical Wireless Network Coding , 2006, IEEE/ACM Transactions on Networking.