Random access in coded wireless packet networks: Feasibility and distributed optimization

We study the throughput region of random access in coded wireless packet networks. We propose a distributed and robust fixed point algorithm that determines whether given coded information flow requirements are feasible with random access and computes the minimal required attempt probabilities supporting these requirements. Combined with linear coding subgraph and flow optimization, this yields a distributed algorithm for joint network coding and random access optimization for multicast networks. Numerical examples show that the proposed method reduces the gap of existing approaches to the optimal solution significantly.

[1]  J. Lei.  Monotone Dynamical Systems , 2013 .

[2]  Harish Viswanathan,et al.  Dynamic Algorithms for Multicast With Intra-Session Network Coding , 2009, IEEE Transactions on Information Theory.

[3]  Muriel Médard,et al.  On coding for reliable communication over packet networks , 2005, Phys. Commun..

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

[5]  Muriel Médard,et al.  Network Coding in Wireless Networks with Random Access , 2007, 2007 IEEE International Symposium on Information Theory.

[6]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[7]  Muriel Medard,et al.  Scheduling for Network Coded Multicast: A Distributed Approach , 2009, 2009 IEEE Globecom Workshops.

[8]  Norman Abramson,et al.  The ALOHA System-Another Alternative for Computer Communications , 1899 .

[9]  Sun-Yuan Kung,et al.  Network planning in wireless ad hoc networks: a cross-Layer approach , 2005 .

[10]  Peter Sanders,et al.  Polynomial time algorithms for multicast network code construction , 2005, IEEE Transactions on Information Theory.

[11]  Wei Yu,et al.  A Cross-Layer Optimization Framework for Multihop Multicast in Wireless Mesh Networks , 2006, IEEE Journal on Selected Areas in Communications.

[12]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[13]  Yunnan Wu,et al.  Network Coding for the Internet and Wireless Networks , 2007, IEEE Signal Processing Magazine.

[14]  Chih-Chun Wang.  Intersession Network Coding for Two Simple Multicast Sessions , 2007 .

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

[16]  Anthony Ephremides,et al.  On Joint MAC and Network Coding in Wireless Ad Hoc Networks , 2007, IEEE Transactions on Information Theory.

[17]  Fang Zhao,et al.  Minimum-cost multicast over coded packet networks , 2005, IEEE Transactions on Information Theory.

[18]  R. Koetter,et al.  Scheduling for Network Coded Multicast: A Conflict Graph Formulation , 2008, 2008 IEEE Globecom Workshops.

[19]  Dimitri P. Bertsekas,et al.  Data networks (2nd ed.) , 1992 .

[20]  Anthony Ephremides,et al.  Energy-Efficient Broadcast and Multicast Trees in Wireless Networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[21]  Tracey Ho,et al.  On distributed scheduling in wireless networks exploiting broadcast and network coding , 2010, IEEE Transactions on Communications.

[22]  Wolfgang Utschick,et al.  Optimal slotted random access in coded wireless packet networks , 2010, 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks.