On the Scaling Law of Network Coding Gains in Wireless Networks

We study the scaling law governing the delay gains of network coding as compared to traditional transmission strategies in unreliable wireless networks. We distinguish between two types of traffic, namely elastic and inelastic, where the elasticity of a flow is based on the delay constraints associated with it. This novel formulation is useful in that it allows for the modeling of real-time traffic more accurately. Considering the limited availability of feedback in such systems, we focus on strategies with minimal acknowledgement requirements. Under both traffic types, we provide an extensive analysis of the gains of network coding as compared to traditional transmission strategies in a single-hop setting, and show that the gains are significant in general and can be considerably large in some cases. We further provide a method for realizing these gains in multi-hop networks with general topologies using the analysis of the single hop scenario.

[1]  W. C. Guenther.  A Simple Approximation to the Negative Binomial (and Regular Binomial) , 1972 .

[2]  J. Kingman.  Some inequalities for the queue GI/G/1 , 1962 .

[3]  Rayadurgam Srikant,et al.  The Mathematics of Internet Congestion Control , 2003 .

[4]  Parag A. Pathak,et al.  Massachusetts Institute of Technology , 1964, Nature.

[5]  Ebad Ahmed,et al.  Delay gains from network coding in wireless networks , 2007 .

[6]  Helmut Prodinger,et al.  Maximum Statistics of N Random Variables Distributed by the Negative Binomial Distribution , 1997, Combinatorics, Probability and Computing.

[7]  Derong Liu.  The Mathematics of Internet Congestion Control , 2005, IEEE Transactions on Automatic Control.

[8]  R. Srikant,et al.  Distributed Link Scheduling With Constant Overhead , 2006, IEEE/ACM Transactions on Networking.

[9]  Xiaojun Lin,et al.  The Impact of Imperfect Scheduling on Cross-Layer Rate Control in Multihop Wireless Networks , 2022 .

[10]  Ness B. Shroff,et al.  The impact of imperfect scheduling on cross-layer rate control in wireless networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[11]  Jim Kurose,et al.  Reliability Benefit of Network Coding , 2007 .

[12]  R. Srikant,et al.  Regulated Maximal Matching: A Distributed Scheduling Algorithm for Multi-Hop Wireless Networks With Node-Exclusive Spectrum Sharing , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[13]  ProdingerHelmut,et al.  Maximum Statistics of N Random Variables Distributed by the Negative Binomial Distribution , 1997 .

[14]  Eytan Modiano,et al.  Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[15]  M. Medard,et al.  On Delay Performance Gains From Network Coding , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[16]  A. Ozdaglar,et al.  Economic Aspects of Network Coding , 2006 .