Benefits Of Network Coding Research Articles

CANCAR – Congestion-Avoidance Network Coding-Aware Routing for Wireless Mesh Networks

Network Coding (NC) is an approach recently investigated for increasing the network throughput and thus enhancing the performance of wireless mesh networks. The benefits of NC can further be improved when routing decisions are made with the awareness of coding capabilities and opportunities. Typically, the goal of such routing is to find and exploit routes with new coding opportunities and thus further increase the network throughput. As shown in this paper, in case of proactive routing the coding awareness along with the information of the measured traffic coding success can also be efficiently used to support the congestion avoidance and enable more encoded packets, thus indirectly further increasing the network throughput. To this end, a new proactive routing procedure called Congestion-Avoidance Network Coding-Aware Routing (CANCAR) is proposed. It detects the currently most highly-loaded node and prevents it from saturation by diverting some of the least coded traffic flows to alternative routes, thus achieving even higher coding gain by the remaining well-coded traffic flows on the node. The simulation results confirm that the proposed proactive routing procedure combined with the well-known COPE NC avoids network congestion and provides higher coding gains, thus achieving significantly higher throughput and enabling higher traffic loads both in a representative regular network topology as well as in two synthetically generated random network topologies.

Efficiently Secure Broadcasting in 5G Wireless Fog-Based-Fronthaul Networks

Enhanced Diversity and Network Coding (eDC-NC), the synergistic combination of Diversity and modified Triangular Network Coding, was introduced recently to provide efficient and ultra-reliable networking with near-instantaneous fault recovery. In this paper it is shown that eDC-NC technology can efficiently and securely broadcast messages in 5G wireless fog-computing-based Radio Access Networks (F-RAN). In particular, this work is directed towards demonstrating the ability of eDC-NC technology to more efficiently provide secure messages broadcasting than standardized methods such as Secure Multicasting using Secret (Shared) Key Cryptography, such that the adversary has no ability to acquire information even if they wiretap the entire F-RAN network (except of course the source and destination nodes). Our results show that using secure eDC-NC technology in F-RAN fronthaul network will enhance secure broadcasting and provide ultra-reliability networking, near-instantaneous fault recovery, and retain the throughput benefits of Network Coding.

Reliability benefit of network coding and cooperative communication

Network coding (NC) can reduce the number of packet retransmissions and improve the network reliability in lossy networks. Reliability gain of NC over traditional error control mechanisms has been investigated in recent works. In this paper, we study reliable broadcast in a real-world topology where link loss probabilities are different from each other. We derive approximate closed-form expressions and analyse asymptotic behaviour for expected number of transmissions employing stop-and-wait automatic repeat request (ARQ) and NC as error control mechanisms. In physical layer cooperative communication, multiple nodes can transmit collectively to take advantage of spatial diversity. We incorporate the idea of physical layer cooperative communication with ARQ and NC separately, to obtain further reliability. Numerical results based on our asymptotic analysis indicate that NC offers more reliability than stop-and-wait ARQ. However, as the size of the cooperating set increases, both the schemes offer the same reliability. Approximate closed-form expressions for the reliability metric of these schemes and their asymptotic results match well with simulation results. Furthermore, simulation results establish that the proposed NC scheme outperforms existing schemes in literature.

Enjoy the Benefit of Network Coding: Combat Pollution Attacks in 5G Multihop Networks

In the upcoming 5G era, many new types of networks will greatly expand the connectivity of the world such as vehicular ad hoc networks (VANETs), Internet of Things (IoT), and device‐to‐device communications (D2D). Network coding is a promising technology that can significantly improve the throughput and robustness of these emerging 5G multihop networks. However, network coding is generally very fragile to malicious attacks such as message content corruption and node compromise attacks. To take advantage of network coding in performance gain while refraining malicious network attacks is an interesting and challenging research issue. In this paper, we propose a new error‐detection and error‐correction (EDEC) scheme that can jointly detect and remove the malicious attacks based on the underlying error‐control scheme for general multihop networks that can model the 5G multihop networks. The proposed scheme can increase the throughput for network with pollution attacks compared to existing error‐detection based schemes. Then we propose a low‐density parity check (LDPC) decoding based EDEC (LEDEC) scheme. Our theoretical analysis demonstrates that the LEDEC scheme can further increase the throughput for heavily polluted network environments. We also provide extensive performance evaluation and simulation results to validate the proposed schemes. This research ensures the expected performance gain for the application of network coding in the 5G network under malicious pollution attacks.

Cross-Network Performance Analysis of Network Coding Aided Cooperative Outband D2D Communications

In long term evolution advanced (LTE-A) networks, the mobile devices can concurrently participate in cooperative outband device-to-device (D2D) data exchange by virtue of user- or network-related parameters (e.g., interest in the same content and cooperative transmissions, respectively). In these scenarios, two major problems arise: 1) the coexistence of multiple devices creates channel access issues, demanding effective medium access control (MAC) schemes, and 2) cellular network factors (i.e., scheduling policy and channel conditions) affect the D2D communication, as the circulating information in D2D links is mainly of cellular network origination, stressing the need for cross network approaches. In this context, the contribution of this paper is threefold. First, exploiting idle devices as relays and the benefits of network coding (NC) in bidirectional communications, we propose an adaptive cooperative NC-based MAC (ACNC-MAC) protocol for the D2D data exchange. Then, we devise a cross-network model that captures the impact of cellular network characteristics on D2D communication. Finally, we evaluate the performance of the ACNC-MAC in terms of throughput, energy efficiency, and battery consumption. Our results show that the LTE-A parameters and the relays’ participation significantly affect the D2D throughput, while the D2D performance deteriorates with the increase of cell congestion.

A novel predictive PCE-based protection strategy for resilient transport networks

The ever increasing requirements of new Internet applications are pushing to optimize the design of optical networks. A key design criterion in network design is the ability to recover from failures in an agile and efficient manner. Protection capabilities are highly required in optical networks since the failure of an optical link might potentially lead to a significant traffic loss. Under this context, Network Coding Protection (NCP) has emerged as an innovative solution to proactively enable protection in an agile and efficient manner by means of throughput improvement techniques such as Network Coding (NC). Nevertheless, the benefits of NC can be reduced by the negative effects of inaccurate Network State Information (NSI), which are common in dynamic scenarios.In this paper, we propose a novel proactive protection strategy based on NC jointly with a Path Computation Element (PCE) architecture called Predictive Network Coding Protection (PNCP). PNCP leverages predictive techniques in order to mitigate the negative impact of the inaccurate NSI on the blocking probability. In addition, PNCP computes resilient lightpaths with a low amount of network resources devoted for path protection.By means of extensive simulation results we show that in comparison with proactive protection strategies such as Dedicated Path Protection (DPP), and conventional dynamic NCP, PNCP reduces the blocking probability as well as the network resources allocated for path protection in dynamic scenarios.

Topology control in network-coding-based-multicast wireless sensor networks

Network coding is a promising technique to improve throughput and reliability. However, the benefit of network coding is restricted and affected by network topology, especially in wireless sensor networks (WSNs). Topology control algorithms adjust the transmission parameters of sensors, chiefly transmission power to achieve a desired topology. So both network coding and topology control algorithms reduce and improve WSN's lifetime. We provide a detailed analytical evaluation of an optimal topology control in network–coding–based–multicast WSNs as a mixed integer non–linear problem. Although this problem is NP–hard, but the mathematical formulation can help us assess the essence and understand the hardness of this problem. We then propose a heuristic algorithm for topology control in network–coding–based–multicast WSNs that run much faster. The efficiency of our algorithm is demonstrated by simulation results under different traffic patterns. We conclude that our algorithm can be used to control the topology of multicast–capable WSNs with significantly better lifetime when compared with conventional algorithms.

Correlated Sources Transmission in Orthogonal Multiple Access Relay Channel: Theoretical Analysis and Performance Evaluation

In this paper, we consider the problem of transmitting two correlated binary sources over orthogonal multiple access relay channel (MARC), where two sources are communicating with a common destination with the assistance of a single relay. We assume decode-and-forward relaying strategy, and bit-wise exclusive or (XOR) network coding is performed at the relay node. First, a joint source-channel-network (JSCN) decoding technique is proposed to fully exploit the correlation between the sources, as well as the benefit of network coding. Then the achievable compression rate region of this system is derived based on the theorem for source coding with side information. It is found that the region is a 3-dimensional space surrounded by a polyhedron. Furthermore, the performance limit in Additive White Gaussian Noise (AWGN) channels and the outage probability in block Rayleigh fading channels are derived based on the achievable compression rate region. It is shown that the outage probability can be expressed by a set of triple integrals over the achievable compression rate region. The impact of source correlation on the performance of the system is investigated through asymptotic tendency analysis. The effectiveness of the proposed JSCN decoding technique and the accuracy of the theoretical analysis have been verified through a series of computer simulations, assuming practical channel codes. It is also shown that, as long as the source-relay links are perfect, the 2nd order diversity is always achieved with our proposed technique regardless of the strength of the source correlation.

Bounding the Advantage of Multicast Network Coding in General Network Models

Network coding encourages information flow mixing in a network. It helps increase the throughput and reduce the cost of data transmission, especially for one-to-many multicast applications. An interesting problem is to understand and quantify the coding advantage and cost advantage, i.e., the potential benefits of network coding, as compared to routing, in terms of increasing throughput and reducing transmission cost, respectively. Two classic network models were considered in previous studies: directed networks and undirected networks. This work further focuses on two types of parameterized networks, including bidirected networks and hyper-networks, generalizing the directed and the undirected network models, respectively. We prove upper- and lower-bounds on multicast coding advantage and cost advantage in these models.

Bounds on the Benefit of Network Coding for Wireless Multicast and Unicast

In this paper, we explore fundamental limitations of the benefit of network coding in multihop wireless networks. We study two well-accepted scenarios in the field: single multicast session and multiple unicast sessions. We assume arbitrary but fixed topology and traffic patterns for the wireless network. We prove that the gain of network coding in terms of throughput and energy saving of a single multicast session is at most a constant factor. Also, we present a lower bound on the average number of transmissions of multiple unicast sessions under any arbitrary network coding. We identify scenarios under which network coding provides no gain at all, in the sense that there exists a simple flow scheme that achieves the same performance. Moreover, we prove that the gain of network coding in terms of the maximum transport capacity is bounded by a constant factor of at most $(\pi)$ in any arbitrary wireless network under all traditional Gaussian channel models. As a corollary, we find that the gain of network coding on the throughput of large homogeneous wireless networks is asymptotically bounded by a constant. Furthermore, we establish theorems which relate a network coding scheme to a simple routing scheme for multiple unicast sessions. The theorems can be used as criteria for evaluating the potential gain of network coding in a given wired or wireless network. Based on these criteria, we find more scenarios where network coding has no gain on throughput or energy saving.

Multicasting Multiple Description Coding Using p-Cycle Network Coding

This paper deliberates for a multimedia transmission scheme combining multiple description coding (MDC) and network coding (NC). Our goal is to take advantage from the property of MDC to provide quantized and compressed independent and identically distributed (iid) descriptions and also from the benefit of network coding, which uses network resources efficiently to recover lost data in the network. Recently, p-cycle NC has been introduced to recover and protect any lost or distorted descriptions at the receiver part exactly without need of retransmission. So far, MDC have not been explored using this type of NC. Compressed and coded descriptions are transmitted through the network where p-cycle NC is applied. P-cycle based algorithm is proposed for single and multiple descriptions lost. Results show that in the fixed bit rate, the PSNR (Peak Signal to Noise Ratio) of our reconstructed image and also subjective evaluation is improved significantly compared to previous work which is averaging method joint with MDC in order to conceal lost descriptions.

Benefits of Network Coding for Unicast Application in Disruption-Tolerant Networks

In this paper, we investigate the benefits of applying a form of network coding known as random linear coding (RLC) to unicast applications in disruption-tolerant networks (DTNs). Under RLC, nodes store and forward random linear combinations of packets as they encounter each other. For the case of a single group of packets originating from the same source and destined for the same destination, we prove a lower bound on the probability that the RLC scheme achieves the minimum time to deliver the group of packets. Although RLC significantly reduces group delivery delays, it fares worse in terms of average packet delivery delay and network transmissions. When replication control is employed, RLC schemes reduce group delivery delays without increasing the number of transmissions. In general, the benefits achieved by RLC are more significant under stringent resource (bandwidth and buffer) constraints, limited signaling, highly dynamic networks, and when applied to packets in the same flow. For more practical settings with multiple continuous flows in the network, we show the importance of deploying RLC schemes with a carefully tuned replication control in order to achieve reduction in average delay, which is observed to be as large as 20% when buffer space is constrained.

Relay scheme based on Distributed Luby Transform codes for InterPlaNetary Internet

Distributed Luby Transform (DLT) codes have been proposed to improve the robustness and system throughputs for multi-source single-sink networks by exploiting the benefits of Network Coding (NC) at a single relay. All the proposed schemes such as the DLT and Soliton-Like Rateless Coding (SLRC) have attempted to maintain Robust Soliton Distribution (RSD) or Soliton-Like Distribution (SLD) for the output data at the relay. This result in some source symbols to be discarded, thereby degrading the throughput. In this paper, we have proposed a novel method called the Full DLT (FDLT) coding scheme to be applied in the InterPlaNetary (IPN) Internet scenario comprising two sources and one relay. The aim of the proposed scheme is to fully utilise the source symbols so as to reduce the overheads and improve energy efficiencies at the sources while maintaining low overhead at the relay. In addition, almost no buffer is needed in the proposed scheme so the relay can have limited storage space, and the proposed scheme is resilient to the churn rates of the nodes. The simulation results have shown that the proposed scheme outperforms the aforementioned schemes with respect to source overheads and total overhead in addition to preserving the benefits of NC and LT codes.

On the practicality of cryptographic defences against pollution attacks in wireless network coding

Numerous practical systems based on network coding have been proposed in recent years demonstrating the wide range of benefits of network coding, such as increased throughput, reliability, and energy efficiency. However, network coding systems are inherently vulnerable to a severe attack, known as packet pollution , which presents a key obstacle to the deployment of such systems. Several cryptographic schemes have been proposed to defend against pollution attacks. We conduct a detailed analysis and an experimental evaluation in a realistic wireless network coding setting of a set of representative cryptographic defenses against pollution attacks. Our analysis identifies severe limitations of asymmetric-based schemes, which impose high communication overhead by placing constraints on the basic network coding parameters and high computation overhead by relying on numerous operations over large fields. Our analysis also shows that symmetric cryptographic schemes, while having better performance than asymmetric cryptographic-based schemes, impose prohibitive overhead in the presence of multiple byzantine adversaries. We further evaluate these schemes by using a set of typical network coding system parameters on a realistic topology. Our experimental evaluation shows that all the schemes we compare induce a throughput degradation that negates the performance benefits of network coding in the presence of multiple colluding adversaries.

Benefit of Network Coding for Probabilistic Packet Marking and Collecting Coupons from Different Perspectives at the Collector

Probabilistic Packet Marking (PPM) is a scheme for IP traceback where each packet is marked randomly with an IP address of one router on the attack path in order for the victim to trace the source of attacks. In previous work, a network coding approach to PPM (PPM+NC) where each packet is marked with a random linear combination of router IP addresses was introduced to reduce number of packets required to infer the attack path. However, the previous work lacks a formal proof for benefit of network coding to PPM and its proposed scheme is restricted. In this paper, we propose a novel method to prove a strong theorem for benefit of network coding to PPM in the general case, which compares different perspectives (interests of collecting) at the collector in PPM+NC scheme. Then we propose Core PPM+NC schemes based on our core network coding approach to PPM. From experiments, we show that our Core PPM+NC schemes actually require less number of packets than previous schemes to infer the attack path. In addition, based on the relationship between Coupon Collector’s Problem (CCP) and PPM, we prove that there exists numerous designs that CCP still benefits from network coding. key words: IP traceback, probabilistic packet marking, network coding, coupon collector’s problem, different perspectives

Energy-efficient dynamic resource allocation with opportunistic network coding in OFDMA relay networks

Network coding is significantly able to save system resources for wireless networks, and has been widely studied for the 802.11 wireless local area network and traditional cellular networks. The relay technology was introduced in 802.16j, 802.16m, and Long Term Evolution-Advanced (LTE-A) standards. Recently, the application of network coding to multi-hop wireless relay networks has been taken into consideration. Although the introduction of relay stations (RSs) may bring more energy consumption, it provides opportunities for network coding to save spectrum resources. Nevertheless, the benefits of network coding are diminished by high multiuser diversity based on orthogonal frequency division multiple access (OFDMA). For ensuring the superiority, network coding is performed opportunistically according to the channel state. Hence dynamic resource allocation (DRA) subject to rate constraints is combined with the idea of opportunistic network coding to minimize the total transmission power in a frame. A fixed set of discrete modulation levels in an OFDMA relay system is also considered. By taking the characteristic of a half-duplex decode-and-forward (DF) mode relay, a solution is proposed for the optimal problem of each subframe after separating power-aware relay selection. Simulation results show that DRA with opportunistic network coding can improve system energy efficiency. Further, it is more efficient for saving energy than DRA with static network coding compared solely to DRA.

Network-Coding-Based Energy Management for Next-Generation Passive Optical Networks

Network coding (NC) has emerged as a promising solution to achieve higher throughput and energy efficiency in communication networks. In this paper, we propose an NC-based energy management mechanism for next-generation passive optical networks (NG-PONs). The principle and signaling process of NC in NG-PONs are discussed and an experimental emulation of NC in an Ethernet PON (EPON) is presented by using NetFPGAs and an IEEE 802.3ah EPON network. To achieve energy efficiency at both optical line terminal and optical network units (ONUs) and exploit the benefits of NC on energy efficiency and performance in NG-PONs, we propose a downstream-bandwidth-reservation-based accurate ONU sleep control scheme and extend it by introducing NC. The benefits of NC on the energy efficiency and network performance are discussed and simulation results show that by introducing NC into NG-PONs, better energy efficiency can be achieved and the performance penalty caused by energy saving can be mitigated.

Delay analysis in practical wireless network coding

ABSTRACTNetwork coding provides a powerful mechanism for improving performance of wireless networks. In this paper, we present an analytical approach for end‐to‐end delay analysis in wireless networks that employs inter‐session network coding. Prior work on performance analysis in wireless network coding mainly focuses on the throughput of the overall network. Our approach aims to analyze the delay of each flow in the network. The theoretical basis of our approach is network calculus. In order to use network calculus to analyze the performance of traffic flows in the network, we have to address three specific problems: identifying traffic flows, characterizing broadcast links, and measuring coding opportunities. We propose solutions for these problems and discuss the practical issues when applying the approach in practice. We make three main contributions. First, we obtain theoretical formulations for computing the queueing delay bounds of traffic flows in wireless networks with network coding. Second, with the formulations, we figure out the factors that affect the queueing delay of a flow and find that first‐in first‐out scheduling cannot fully exploit the benefit of network coding. Third, in order to exploit our findings, we introduce a new scheduling scheme that can improve the performance of current practical wireless network coding. Copyright © 2012 John Wiley & Sons, Ltd.

CodePlay: Live Multimedia Streaming in VANETs Using Symbol-Level Network Coding

The fundamental challenges of providing live multimedia streaming (LMS) services in vehicular ad hoc networks (VANETs) come from achieving stable and high streaming rate (smooth playback) for all the interested vehicles while using minimal bandwidth resources, especially under the highly dynamic topology of VANETs and the lossy nature of vehicular wireless communications. Packet level network coding (PLNC) technique has been widely accepted as an effective approach to improve the network performance during the last decade. More recent symbol-level network coding (SLNC) could further improve the efficiency of bandwidth utilization by exploiting both wireless symbol-level diversity and the benefits of network coding. In this paper, we introduce CodePlay, a new LMS scheme in VANETs that fully takes advantage of SLNC through a coordinated local push mechanism. Streaming contents are actively disseminated from dedicated sources to interested vehicles via local coordination of distributively selected relays, each of which will ensure smooth playback for vehicles nearby. Extensive simulations show that simply replacing the SLNC with PLNC technique in previous LMS schemes can not provide satisfiable user experience, and special scheme design based on the unique characteristics of SLNC proposed in CodePlay is necessary for future LMS applications in VANET.

Analyzing the Resilience-Complexity Tradeoff of Network Coding in Dynamic P2P Networks

Most current-generation P2P content distribution protocols use fine-granularity blocks to distribute content to all the peers in a decentralized fashion. Such protocols often suffer from a significant degree of imbalance in block distributions, especially when the users are highly dynamic. As certain blocks become rare or even unavailable, content availability and download efficiency are adversely affected. Randomized network coding may improve block diversity and availability in P2P networks, as coded blocks are equally innovative and useful to peers. However, the computational complexity of network coding mandates that, in reality, network coding needs to be performed within segments, each containing a subset of blocks. In this paper, we quantitatively evaluate how network coding may improve content availability, block diversity, and download performance in the presence of churn, as the number of blocks in each segment for coding varies. Based on stochastic models and a differential equation approach, we explore the fundamental tradeoff between the resilience gain of network coding to peer dynamics and its inherent coding complexity. We conclude that a small number of blocks in each segment is sufficient to realize the major benefits of network coding, with acceptable coding cost.