Error Performance Analysis of Random Network Coded Cooperation Systems

This paper presents a framework for computing successful decoding probability of random network coding (RNC) in wireless networks. As cooperation emerges due to the naturally occurring broadcasting in wireless links, the application of RNC in wireless networks enables random network coded cooperation (RNCC). The theoretical successful decoding probability of RNCC systems is derived by obtaining the ratio of the full rank and the rank deficient matrices. The full rank condition of the global encoding matrix indicates the successful decoding of source symbols. The results of a single relay along with a relay selection scheme are also investigated. The validity of the presented theoretical expressions is demonstrated through identical simulation results. An implementation scenario is also presented to demonstrate the practical usage effectiveness of RNC in real-time applications, by using software-defined radio nodes.

[1]  Rashid Saleem,et al.  Channel Estimation Based in Comb-Type Pilots Arrangement for OFDM System over Time Varying Channel , 2010, J. Networks.

[2]  Ioannis Chatzigeorgiou,et al.  Rethinking the Intercept Probability of Random Linear Network Coding , 2015, IEEE Communications Letters.

[3]  Jin-Taek Seong,et al.  Predicting the Performance of Cooperative Wireless Networking Schemes With Random Network Coding , 2014, IEEE Transactions on Communications.

[4]  Jin-Taek Seong Bounds on Decoding Failure Probability in Linear Network Coding Schemes with Erasure Channels , 2014, IEEE Communications Letters.

[5]  Ioannis Chatzigeorgiou,et al.  Improved Bounds on the Decoding Failure Probability of Network Coding Over Multi-Source Multi-Relay Networks , 2016, IEEE Communications Letters.

[6]  Gregory W. Wornell,et al.  Cooperative diversity in wireless networks: Efficient protocols and outage behavior , 2004, IEEE Transactions on Information Theory.

[7]  R. Koetter,et al.  The benefits of coding over routing in a randomized setting , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[8]  Gregory W. Wornell,et al.  An efficient protocol for realizing cooperative diversity in wireless networks , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

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

[10]  John S. Thompson,et al.  Performance Analysis and Energy Efficiency of Random Network Coding in LTE-Advanced , 2012, IEEE Transactions on Wireless Communications.

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

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

[13]  Marco Fiore,et al.  Exact Decoding Probability Under Random Linear Network Coding , 2010, IEEE Communications Letters.

[14]  J. Rotman An Introduction to the Theory of Groups , 1965 .

[15]  John S. Thompson,et al.  Random Network Coding for Multimedia Delivery Services in LTE/LTE-Advanced , 2014, IEEE Transactions on Multimedia.

[16]  Ioannis Chatzigeorgiou,et al.  Performance analysis of random linear network coding in two-source single-relay networks , 2015, 2015 IEEE International Conference on Communication Workshop (ICCW).

[17]  Zhengdao Wang,et al.  Wireless Network Code Design and Performance Analysis Using Diversity-Multiplexing Tradeoff , 2010, IEEE Transactions on Communications.

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

[19]  Günes Karabulut-Kurt,et al.  A tutorial on network coded cooperation , 2016, IEEE Communications Surveys & Tutorials.

[20]  Elza Erkip,et al.  User cooperation diversity. Part II. Implementation aspects and performance analysis , 2003, IEEE Trans. Commun..

[21]  Daniel E. Lucani,et al.  Analysis and Optimization of Sparse Random Linear Network Coding for Reliable Multicast Services , 2015, IEEE Transactions on Communications.

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

[23]  Mahdi Jafari Siavoshani,et al.  Non-coherent network coding: An arbitrarily varying channel approach , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[24]  Raymond W. Yeung,et al.  Multilevel diversity coding with distortion , 1995, IEEE Trans. Inf. Theory.

[25]  Emanuele Viterbo,et al.  Decoding Probability in Random Linear Network Coding with Packet Losses , 2013, IEEE Communications Letters.

[26]  Elza Erkip,et al.  User cooperation diversity. Part I. System description , 2003, IEEE Trans. Commun..

[27]  Frank R. Kschischang,et al.  Coding for Errors and Erasures in Random Network Coding , 2008, IEEE Trans. Inf. Theory.

[28]  Raymond W. Yeung,et al.  Network coding gain of combination networks , 2004, Information Theory Workshop.

[29]  Joel Brewster Lewis,et al.  Counting matrices over finite fields with support on skew Young diagrams and complements of Rothe diagrams , 2012, 1203.5804.

[30]  Suhas N. Diggavi,et al.  On the Capacity of Noncoherent Network Coding , 2011, IEEE Transactions on Information Theory.

[31]  Armando J. Pinho,et al.  The Rank of Random Binary Matrices and Distributed Storage Applications , 2013, IEEE Communications Letters.