On the capacity of network coding for random networks

We study the maximum flow possible between a single-source and multiple terminals in a weighted random graph (modeling a wired network) and a weighted random geometric graph (modeling an ad-hoc wireless network) using network coding. For the weighted random graph model, we show that the network coding capacity concentrates around the expected number of nearest neighbors of the source and the terminals. Specifically, for a network with a single source, l terminals, and n relay nodes such that the link capacities between any two nodes is independent and identically distributed (i.i.d.) /spl sim/X, the maximum flow between the source and the terminals is approximately nE[X] with high probability. For the weighted random geometric graph model where two nodes are connected if they are within a certain distance of each other we show that with high probability the network coding capacity is greater than or equal to the expected number of nearest neighbors of the node with the least coverage area.

[1]  Muriel Médard,et al.  Beyond routing: an algebraic approach to network coding , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[2]  Baochun Li,et al.  How Practical is Network Coding? , 2006, 200614th IEEE International Workshop on Quality of Service.

[3]  David R. Karger,et al.  Random Sampling in Cut, Flow, and Network Design Problems , 1999, Math. Oper. Res..

[4]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[5]  R. Koetter,et al.  An algebraic approach to network coding , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

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

[7]  Béla Bollobás,et al.  Random Graphs , 1985 .

[8]  Serap A. Savari,et al.  Cut sets and information flow in networks of two-way channels , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[9]  R. Durrett.  Probability: Theory and Examples , 1993 .

[10]  Mohammad R. Salavatipour,et al.  Packing Steiner trees , 2003, SODA '03.

[11]  Serap A. Savari,et al.  On networks of two-way channels , 2003, Algebraic Coding Theory and Information Theory.

[12]  R. Koetter,et al.  Network Coding for Correlated Sources , 2004 .

[13]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

[14]  Tracey Ho,et al.  Toward a Random Operation of Networks , 2004 .

[15]  D. Karger,et al.  On Coding for Non-Multicast Networks ∗ , 2003 .

[16]  Peter Sanders,et al.  Polynomial time algorithms for network information flow , 2003, SPAA '03.

[17]  Aditya Ramamoorthy,et al.  Separating distributed source coding from network coding , 2006, IEEE Transactions on Information Theory.

[18]  J. Dall,et al.  Random geometric graphs. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  Philip A. Chou,et al.  A comparison of network coding and tree packing , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[20]  Christian Bettstetter,et al.  On the minimum node degree and connectivity of a wireless multihop network , 2002, MobiHoc '02.

[21]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[22]  Randall Dougherty,et al.  Insufficiency of linear coding in network information flow , 2005, IEEE Transactions on Information Theory.

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

[24]  Mani B. Srivastava,et al.  Optimizing Sensor Networks in the Energy-Latency-Density Design Space , 2002, IEEE Trans. Mob. Comput..

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

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

[27]  K. Jain,et al.  Practical Network Coding , 2003 .