Performance analysis of network coding with raptor codes for IPTV

A fundamental understanding of the relationship between delay performance and complexity in network coding is instrumental towards its application in practical systems. The main argument against delay-optimal random linear network coding (RLNC) is its decoding complexity, which is O(n 3 ) for n original packets. Fountain codes, such as LT and Raptor codes, reduce the decoding load on the receiver but at the cost of introducing additional, non-negligible delay. The source of this increased delay is the inherent sparsity of the code, which significantly reduces the impact of a new coded packet, i.e., the probability of a packet to be linearly independent from the knowledge at the receiver, as we approach the end of the transmission (when few degrees of freedom are missing). Thus, the additional overhead is mainly due to the transmission of the last data packets. Our key observation is that switching gears to denser codes as the transmission process progresses could considerably reduce the delay overhead while maintaining the complexity advantages of a sparse code. We propose tunable sparse network coding as a dynamic coding mechanism with a code structure with two regions: a sparse region, with various levels of sparsity, and a dense region, where packets are generated as per RLNC. We characterize the problem in multicast sessions on general networks and illustrate trade-offs in especial cases of interest. We also present a novel mechanism to perform efficient Gaussian elimination for sparse matrices that guarantees linear decoding complexity with high probability.

Network coding (NC) is considered a breakthrough to improve throughput, robustness, and security of wireless networks. Although the theoretical aspects of NC have been extensively investigated, there have been only few experiments with pure NC schematics. This paper presents an implementation of NC under a two-way relay model and extends it to two non-straightforward scenarios: (i) multimedia transmission with layered coding and multiple-description coding, and (ii) cognitive radio with Vandermonde frequency division multiplexing (VFDM). The implementation is in real time and based on software-defined radio (SDR). The experimental results show that, by combining NC and source coding, we can control the quality of the received multimedia content in an on-demand manner. Whereas in the VFDM-based cognitive radio, the quality of the received content in the primary receiver is low (due to imperfect channel estimation) yet retrievable. Our implementation results serve as a proof for the practicability of network coding in relevant applications.

Nowadays network coding has attracted a lot of attentions from researchers in fields of information and coding theory, wireless communications, P2P, etc, as it has enormous potential to improve network throughput and to utilize the maximum bandwidth in networks. Whereas due to its high computation complexity, it is not easy to implement network coding in a real network environment. Network Flow Processor (NFP) is a multi-core specific processor, widely used in switches, routers. NPF has a powerful computation capacity, since it is composed of 40 cores and each core can concurrently executes up to 8 threads. In this paper, we discuss about the network coding fundamental and the NFP architecture in order to make NFP support the encoding function of network coding. During the implementation of network coding on NFP, we use loop-based and table-based approaches for multiplication in finite field. With our experimental results, a single card of NFP can offer a throughput of encoding up to 43.9Mbps.

Advances in computer science, microelectronics technology, and wireless communication are driving the rapid development of wireless sensor networks. At present, research and development work on various aspects of wireless media sensor network technologies are in progress. With the increasing demands of users for the quality of wireless communication and the diversity of Internet services, improving the efficiency of data transmission is particularly important in the research of wireless sensor network technology. At present, the network coding scheme has pointed out a new direction for the research of improving the efficiency of data transmission. This paper aims to study the satellite sensor data transmission technology based on network coding. Based on the analysis of the basic principles of network coding, the classification of network coding and the satellite data transmission system, a data transmission algorithm based on network coding is proposed and combined compare the performance of two traditional algorithms. The experimental results show that compared with the other two traditional data transmission algorithms, the total energy consumption of the nodes in this algorithm is the lowest.

The transmission of data is extremely important to its desired point, as the time of natural disaster is unexpected and increased rapidly nowadays. In an area hit by a disaster zone, the previously existing network may have stopped functioning or may have been destroyed. Opportunistic networks can be used as they are a class of Delay Tolerant Networks for the transmission of data. In this paper, all the routing protocols have been used and the mobility models which are available in opportunistic networks. The transmission of multimedia data may be audio or video in a disaster area are concerned about, which is important for the survival of a person. The three basic data have been considered such as High-quality video, Diagnostic sound and Uncompressed image in our paper. The performance and accuracy are evaluated to achieve the best results of all protocols when compared in terms of delivery ratio and latency.

Network coding is a technique used to improve both wired and wireless networks' throughput and provide reliable transmission. In network coding, original data packets can be encoded to an infinite number of coded packets. A subset of these coded packets is sufficient to decode the coded packets and retrieve the original data. In addition to providing reliable data transmission, network coding can be used as a lightweight security mechanism to protect data against eavesdroppers. An eavesdropper is not able to decode coded packets and retrieve original data unless it has access to a sufficient number of coded packets. In a data transmission application, transmitting more redundant packets increases the chance of delivering a sufficient number of coded packets to the destination. As a result, this increases the reliability of the data transmission. However, more redundant transmissions make the system more vulnerable to eavesdropper attacks because there is a higher chance that an eavesdropper will receive enough coded packets. In this work, we study network coding to provide reliable and secure data transmission schemes by performing a trade-off between the security and reliability of the data transmission. We formulate the problem as a mixed integer and linear programming problem, and we propose a linear programming approximation to solve it. We study the performance of our proposed methods through extensive simulations.

Network coding has been proven with the capability to improve the network bandwidth efficiency for multicast communications. Streaming based IPTV services provided by network operators match the paradigm of using network coding. However, the major research works in the literature focus on the selection of network codes under given routing paths. Few research work jointly considers routing and network coding together to obtain survivable multicast routing and minimum bandwidth provision. In this paper, we investigate this new research topic and propose mathematical models that can be used to obtain an optimal routing for survivable multicast communications against any single link/node failure. To clarify the gain from applying network coding, we also made performance comparisons between the network-coding-based protection schemes and those without using network coding. We observe that the network coding scheme holds the best performance for all cases we had simulated. The trade-offs between the network protection schemes with and without using network coding are also identified in this paper.

Subject of the research. The paper presents a new IPv6NC network coding protocol based on the use of IPv6 network protocol extension headers. Purpose. Development of a data transfer protocol based on the analysis of existing principles and models of network coding, as well as the use of IPv6 protocol extension headers to transfer network coding parameters. Methods. Analysis of existing principles and models of network coding, as well as the use of IPv6 extension headers for transmitting network coding parameters. Results. The paper describes application of developed protocol for different network coding approaches and presents network coding parameters to be transmitted in packet headers to perform network coding and guideline of their representation in the type-length-value format for standard IPv6 extension headers. Also the paper gives the structure of a special extension header for transmitting network coding parameters. Novelty. For the first time, IPv6 uses extension headers for networc coding. Practical relevance. The developed protocol is intended for the implementation of multicast transmission and relay with network coding in various data transmission systems.

In the last few years, Network Coding (NC) has been shown to provide several advantages, both in theory and in practice. However, its applicability to battery-operated systems under strict power constraints has not been proven yet, since most implementations are based on high-end CPUs and GPUs. This work represents the first effort to bridge NC theory with real-world, low-power applications. In this paper, we provide a detailed analysis on the energy consumption of NC, based on VLSI design measurements, and an approach for specifying optimal algorithmic parameters, such as field size, minimizing the required energy for both transmission and coding of data. Our custom, energy-aware NC accelerator proves the feasibility of incorporating NC into modern, low-power systems; the proposed architecture achieves a coding throughput of 80MB/s (60MB/s), while consuming 22uW (12.5mW) for the encoding (decoding) process.KeywordsNetwork Coding VLSI ImplementationEnergy Optimization of Network CodingNetwork Coding for Mobile Applications

Network coding is a promising generalization of routing which allows a network node to generate output messages by encoding its received messages to reduce the bandwidth consumption in the network. An important application where network coding offers unique advantages is the multicast network where a source node generates messages and multiple receivers collect the messages. Previous network coding schemes primarily considered encoding the messages in a single multicast session. In this paper, we consider the linear inter-session network coding for multicast. The basic idea is to divide the sessions into different groups and construct a linear network coding scheme for each group. We use two metrics to guide the group division: overlap ratio and overlap width. These two metrics measure the benefit that a system can achieve by inter-session network coding with different considerations. The overlap ratio mainly characterizes the network bandwidth while the overlap width characterizes the system throughput. Our simulation results show that the proposed inter-session network coding scheme can achieve about 30% higher throughput than intra-session network coding.

With more and more multimedia applications on the Internet, such as IPTV, bandwidth becomes a vital bottleneck for the booming of large scale Internet based multimedia applications. Network coding is recently proposed to take advantage to use network bandwidth efficiently. In this paper, we focus on massive multimedia data, e.g. IPTV programs, transportation in peer-to-peer networks with network coding. By through study of networking coding, we pointed out that the prerequisites of bandwidth saving of network coding are: I) one information source with a number of concurrent receivers, or 2) information pieces cached at intermediate nodes. We further proof that network coding can not gain bandwidth saving at immediate connections to a receiver end; As a result, we propose a novel model for IPTV data transportation in unstructured peer-to-peer networks with network coding. Our preliminary simulations show that the proposed architecture works very well.

In this paper we are interested in improving the performance of constructive network coding schemes for video transmission over packet lossy networks. A novel unequal packet loss protection scheme R2NC based on low-triangular global coding matrix with ladder-shaped partition will be presented, which combines redundant and random network coding for robust H.264/SVC video transmission. Firstly, the error-correcting capabilities of redundant network coding make our scheme resilient to loss. Secondly, the implementation of random network coding at the intermediate nodes with multiple input links can reduce the cost of network bandwidth, thus reducing the end to end delay for video transmission. Thirdly, the low-triangular global coding matrix with ladder-shaped partition is maintained throughout R2NC process to provide unequal erasure protection for H.264/SVC priority layers. The redundant network coding avoids the retransmission of lost packets and improves error correcting capabilities of lost packets. Based only on the knowledge of the loss rates on the output links, the source node and intermediate nodes can make decisions for redundant network coding and random network coding (i.e., how much redundancy to add at this node). However, the redundancy caused by redundant network coding makes the network load increases, in order to improve network throughput, we perform random network coding at the intermediate nodes. Our approach is grounded on the overall distortion of reconstructed video minimization by optimizing the amount of redundancy assigned to each layer. Experimental results are shown to demonstrate the significant improvement of H.264/SVC video reconstruction quality with R2NC over packet lossy networks.

Data compression is the ancestor of image compression, which uses fewer bits to represent the same picture. It is categorised as lossy or lossless depending on the quality required. In a lossless compression situation, no information is lost during the decompression process. Data loss is possible with the lossy technique since it is not reversible. In an effort to boost compression efficiency while maintaining a high xiv reconstruction quality of picture, near lossless approaches have evolved. The medical pictures consist of a large number of items, each of which may be described in detail and utilised for a variety of purposes. The clinically relevant item in 2D medical pictures is referred to as the Region of Interest (ROI), whereas in 3D images, it is referred to as the Volume of Interest (VOI). Saving energy is crucial since it is one of the most limited resources in these networks. However, DTN has an additional difficulty since communication between nodes is maintained so long as they are in physical proximity to one another. However, because to the nodes’ mobility, this may not be long enough to provide the necessary multimedia data transmission. Wireless networks are susceptible to security assaults, and traditional security solutions are computationally demanding, making them unsuitable for networks that constantly need to recharge their batteries. All of these are reasons for tackling the problems of multimedia data processing and transmission via wireless networks in this dissertation. With this in mind, it has been attempted to investigate low-overhead and safe multimedia data compression as a solution to the issue that energy-constrained nodes in these networks limit complex multimedia processing while keeping at least basic security features. LZW-OMCA compression using the Octagonal Multimedia Compression Algorithm is part of the suggested method. The purpose of this is to improve the compression ratio. The proposed approach uses a little bit of crypt to compress data, which makes the data unreadable to anybody except the intended receiver, hence providing network security. The previous proposed works analysed the performance of several compression algorithms applied to multimedia material. Performance assessment utilising MSE, SSIM, and other metrics are used to show the pros and cons of each segment.

In recent years network coding has attracted significant attention in telecommunication. The benefits of network coding to a communication network include the increased throughput as well as secure data transmission. In this chapter, we investigate the advantages of applying network Coding in sensor networks for security purpose. In particular, the problem of constructing a secure unicast system is considered. Unlike previous wiretapping scenarios, where the threat is posed by external wiretappers. we approach the security from an internal angle: all nodes comply with the communication protocols yet are potential eavesdroppers and the eavesdroppers can cooperate with each other to decode the packets sent from the source node. Different from most existing research on network coding that designs the network coding scheme based on a given topology, we will consider the network topology design. We first try to find the transmission topology that is suitable for network coding in unicast system. Based on the topology, we use linear network coding scheme which is weakly secure. We conduct simulations to show that it prevents cooperative eavesdroppers from acquiring any useful information transmitted from source node to sink node.KeywordsWeakly-secureNetwork codingCooperative eavesdroppersConspiracy attack

Future networks are expected to depart from traditional routing schemes in order to embrace network coding (NC)-based schemes. These have created a lot of interest both in academia and industry in recent years. Under the NC paradigm, symbols are transported through the network by combining several information streams originating from the same or different sources.This special issue contains thirteen papers, some dealing with design aspects of NC and related concepts (e.g., fountain codes) and some showcasing the application of NC to new services and technologies, such as data multi-view streaming of video or underwater sensor networks. One can find papers that show how NC turns data transmission more robust to packet losses, faster to decode, and more resilient to network changes, such as dynamic topologies and different user options, and how NC can improve the overall throughput. This issue also includes papers showing that NC principles can be used at different layers of the networks (including the physical layer) and how the same fundamental principles can lead to new distributed storage systems. Some of the papers in this issue have a theoretical nature, including code design, while others describe hardware testbeds and prototypes.