Algorithms in Network Coding to Enhance Communication Networks’ Dependability and Bandwidth

Abstract

This paper focuses on exploring latest network coding techniques for increasing the dependability and rates achieved in telecommunication networks.Self organizing networks are real time dynamic infrastructures that help address the challenges of conventional networking techniques as traffic increases for high bandwidth reliable data transmission. Network coding that can enable encoding of data packets at intermediate nodes, can enable better utilization of the bandwidth hence improving system performance. The following network coding technologies are discussed and evaluated in this research: random linear network coding and fountain codes in different network scenarios and traffic patterns. To analyze and compare performance of proposed methods implemented with simulations and analytical models, we use throughput, delay, and error rates. The importance of these two aspects is supported by the results of the experiments, according to which new generation network coding algorithms can greatly improve the network reliability due to the possibility of packet recovery and optimal data transmission. Further, the study shows the rationale for deciding on complexity of one code over another, and how these coding techniques are applied in practice. Finally, this work extends existing communication systems to provide a better solution for meeting the growing traffic requirements of fresh applications such as streaming video, clouds, and IoT devices.