Network Coding and Subspace Designs pp 295-317 | Cite as

# Implementation of Network Coding in Wireless Systems

## Abstract

In this chapter, we target to give extensive performance analyses about application of network coding (NC) in wireless systems, referred to as network coded cooperation (NCC), brings both diversity and multiplexing gains. We use the diversity-multiplexing trade-off (DMT) to determine performance bounds of NCC systems. Within the scope of this study, NCC is integrated with orthogonal frequency division multiple access (OFDMA) and the corresponding system model is characterized by specifically focusing on frequency diversity gain. DMT expressions of the NCC-OFDMA system is given. A real-time implementation of the NCC-OFDMA system is presented by creating a testbed NI USRP-2921, NI PXIe-5644R, NI PXI-6683H software defined radio (SDR) modules and LabVIEW software. Obtained real-time performance measurements are essential to demonstrate the practical advantages or disadvantages of the usage of the NCC-OFDMA system. Overall, we aim to present a detailed overview of the fundamental performance bounds of NCC and its extension to the practical applicability of NCC in wireless networks.

## References

- 1.R. Ahlswede, N. Cai, S.Y. Li, R.W. Yeung, Network information flow. IEEE Trans. Inf. Theory
**46**(4), 1204–1216 (2000)Google Scholar - 2.R. Dougherty, C. Freiling, K. Zeger, Insufficiency of linear coding in network information flow. IEEE Trans. Inf. Theory
**51**(8), 2745–2759 (2005)Google Scholar - 3.J.N. Laneman, G.W. Wornell, Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks. IEEE Trans. Inf. Theory,
**49**(10), 2415–2425 (2003)Google Scholar - 4.T. Ho, M. Mdard, R. Koetter, D.R. Karger, M. Effros, J. Shi, B. Leong, A random linear network coding approach to multicast. IEEE Trans. Inf. Theory,
**52**(10), 4413–4430 (2006)Google Scholar - 5.M. Di Renzo, M. Iezzi, F. Graziosi, On diversity order and coding gain of multisource multirelay cooperative wireless networks with binary network coding. IEEE Trans. Veh. Tech.
**62**(3), 1138–1157 (2013)Google Scholar - 6.C. Peng, Q. Zhang, M. Zhao, Y. Yao, W. Jia, On the performance analysis of network-coded cooperation in wireless networks. IEEE Trans. Wireless Commun.
**7**, 3090–3097 (2008)Google Scholar - 7.H. Topakkaya, Z. Wang, Wireless network code design and performance analysis using diversity-multiplexing tradeoff. IEEE Trans. Commun.
**59**(2), 488–496 (2011)Google Scholar - 8.A.R. Heidarpour, G.K. Kurt, M. Uysal, Finite-SNR diversity-multiplexing tradeoff for network coded cooperative OFDMA Systems. IEEE Trans. Wirel. Commun.
**16**(3), 1385–1396 (2017)Google Scholar - 9.S. Gokceli, H. Alakoca, S.T. Basaran, et al., EURASIP J. Adv. Sig. Process.
**2016**(8) (2016)Google Scholar - 10.F.J. MacWilliams, N.J.A. Sloane,
*The Theory of Error-Correcting Codes*. North-Holland Mathematical Library (North-Holland Publishing Company, Amsterdam, 1977)Google Scholar - 11.E.M. Gabidulin, Theory of codes with maximum rank distance. Problemy Peredachi Informatsii,
**21**(1), 3–16 (1985)Google Scholar - 12.S.T. Basaran, G.K. Kurt, M. Uysal, I. Altunbas, A tutorial on network coded cooperation. IEEE Commun. Surv. Tutor.
**18**(4), 2970–2990 (2016)Google Scholar - 13.P.A. Chou, Y. Wu, K. Jain, Practical network coding. in
*Proceedings of the Annual Allerton Conference on Communication Control and Computing*, vol. 41, No. 1, (2003) pp. 40–49Google Scholar - 14.R. Koetter, F.R. Kschischang, Coding for errors and erasures in random network coding. IEEE Trans. Inf. Theory, IEEE,
**54**, 3579–3591 (2008)Google Scholar - 15.A. Bletsas, A. Khisti, D.P. Reed, A. Lippman, A simple cooperative diversity method based on network path selection. IEEE J. Sel. Areas Commun.
**24**(3), 659–672 (2006)Google Scholar - 16.J.N. Laneman, Network coding gain of cooperative diversity. in
*Proceedings of IEEE MILCOM*, vol. 1, (2004) pp. 106–112Google Scholar - 17.B. Bai, W. Chen, K.B. Letaief, Z. Cao, Joint relay selection and sub-channel allocation for amplify-and-forward OFDMA cooperative networks. in
*Proceedings of IEEE International Communications Conference (ICC’2012)*(2012) pp. 4192–4196Google Scholar - 18.M. Gromov, Pseudo holomorphic curves in symplectic manifolds. Invent. Math.
**82**(2), 307–347 (1985)Google Scholar