Distributed Network Coding Research Articles

Certificateless Homomorphic Signature Scheme for Network Coding

Homomorphic signature is an extremely important public key authentication technique for network coding to defend against pollution attacks. As a public key cryptographic primitive, it also encounters the same problem of how to confirm the relationship between some public key $pk$ and the identity $ID$ of its owner. In the setting of distributed network coding, the intermediate and destination nodes need to use the public key of source node S to check the validity of vector-signature pairs. Therefore, the binding of S and its corresponding public key becomes crucial. The popular and traditional solution is based on certificates which are issued by a trusted certification authority (CA) center. However, the generation and management of certificates is extremely cumbersome. Hence, in recent work, Lin et al. proposed a new notion of identity-based homomorphic signature, which intends to avoid using certificates. But the key escrow problem is inevitable for identity-based primitives. In this article, we propose another new notion (for network coding): certificateless homomorphic signature (CLHS), which is a compromise for the above two techniques. In particular, we first describe the definition and security model of certificateless homomorphic signature. Then based on bilinear map and the computational Diffie-Hellman (CDH) assumption, give a concrete implementation and detailedly analyze its security. Finally, performance analysis illustrates that our construction is practical.

Distributed Fountain Codes With Adaptive Unequal Error Protection in Wireless Relay Networks

In wireless relay networks (WRNs), multiple source nodes communicate with a single destination node through a common relay network. Different source nodes may have different error protection or recovery time requirements. In this paper, we focus on unequal error protection (UEP) distributed network coding (DNC) design for WRNs. Specifically, we propose a continuous UEP method based on fountain codes with the objective of satisfying the UEP or unequal recovery time (URT) requirements. Then based upon this UEP method, we develop an adaptive UEP DNC scheme to realize adaptive UEP in WRNs. We analyze the properties of the proposed adaptive UEP DNC scheme and derive the upper and lower bit error rate (BER) bounds for it over Rayleigh fading channels under maximum-likelihood (ML) decoding. Simulation results show that the proposed adaptive UEP DNC scheme has desirable UEP and URT properties. The transmitted data from the source nodes in different protection groups can be recovered successfully under their performance requirements in a shorter time by using the adaptive UEP DNC scheme.

Performance Analysis of Unequal Error Protection Distributed Network Coding Based on Fountain Codes

In this paper, we propose an unequal error protection (UEP) distributed network coding (DNC) scheme based on fountain codes to provide arbitrary error protection (i.e., infinite protection levels) to all the source nodes in wireless relay networks (WRNs). We derive the upper and lower bit error rate (BER) bounds for the proposed UEP DNC scheme with maximum-likelihood (ML) decoding over Rayleigh fading channels. Numerical results show that the derived analytical bounds are tight and our proposed UEP DNC scheme based on fountain codes has a strong UEP property.

Interference Management for Multiple Multicasts with Joint Distributed Source/Channel/Network Coding

This paper focuses on the QoS-constrained jointly optimal adaptive distributed source coding, channel coding, network coding and power control for Co-Channel Interference (CCI)-limited wireless multiple class multicast networks, such as, for example, Wireless Sensor Networks (WSNs). The goal is to allocate the available system-wide resources by jointly performing Loss-Less Distributed Source Coding (LLDSC) and Intra-Session Network Coding (ISNC), while leveraging channel coding and power control for CCI-mitigation. Due to the presence of CCI, the resulting cross-layer optimization problem is inherently nonconvex. Hence, we develop a distributed, iterative and asynchronous algorithm for the optimal adaptive QoS management of the available bandwidth/power/flow resources. Actual performance and adaptive capability of the proposed resource management algorithm in the presence of: i) abrupt changes of the statistics of the source flows; ii) failures of the interior network nodes; and, iii) fast fading, are numerically tested.

Performance Analysis of Distributed Raptor Codes in Wireless Sensor Networks

In this paper, we propose a distributed network coding (DNC) scheme based on the Raptor codes for wireless sensor networks (WSNs), where a group of sensor nodes, acting as source nodes, communicate with a single sink through some other sensor nodes, serving as relay nodes, in a multi-hop fashion. At the sink, a graph-based Raptor code is formed on the fly. After receiving a sufficient number of encoded packets, the sink begins to decode. The main contributions of this paper are the derivation of a bit error rate (BER) lower bound for the LT-based DNC scheme over Rayleigh fading channels under maximum-likelihood (ML) decoding, and the derivations of upper and lower BER bounds for the proposed Raptor-based DNC scheme on the basis of the derived BER bound of LT codes.

Low-overhead Secure Network Coding based on Chaotic Sequence

A minimum overhead secure network coding based on chaotic sequence is presented in this paper. And only the source need to be modified, intermediate nodes implement a classical distributed ne twork code. So the proposed scheme is applied to all the linear network coding. Combine the chaotic sequence with original source information vector, because of the high randomness and the sensitivity to initial state of chaotic sequence, the presented network code is One-Time Pad (OTP). So the secure network coding achieves complete secrecy. This scheme requires only one noisy symbol to be embedded in the original information symbol vector to achieve complete secrecy. The theoretical analysis confirm that this sch eme can achieve the information-theoretic security condition and the signalling overhead to obtain complete security is minimized, while the atta cker has limited wiretapping ability.

Distributed Network Coding for Wireless Sensor Networks Based on Rateless LT Codes

In this paper, we propose a distributed network coding (DNC) scheme based on digital fountain rateless LT codes for wireless sensor networks (WSNs), where a group of source nodes communicate with a single destination node through a group of relay nodes in a two-hop fashion. The aim of the proposed scheme is to achieve network coding gains. The relay nodes perform linear combinations by using network coding to form network-coded symbols and send them to the destination node. At the destination, a graph-based, rateless code is formed on the fly. The main contribution of this paper is the derivation of an analytical symbol error rate (SER) bound for the proposed coding scheme.

Resilient Network Coding in the Presence of Byzantine Adversaries

Network coding substantially increases network throughput. But since it involves mixing of information inside the network, a single corrupted packet generated by a malicious node can end up contaminating all the information reaching a destination, preventing decoding. This paper introduces distributed polynomial-time rate-optimal network codes that work in the presence of Byzantine nodes. We present algorithms that target adversaries with different attacking capabilities. When the adversary can eavesdrop on all links and jam links, our first algorithm achieves a rate of , where is the network capacity. In contrast, when the adversary has limited eavesdropping capabilities, we provide algorithms that achieve the higher rate of . Our algorithms attain the optimal rate given the strength of the adversary. They are information-theoretically secure. They operate in a distributed manner, assume no knowledge of the topology, and can be designed and implemented in polynomial time. Furthermore, only the source and destination need to be modified; nonmalicious nodes inside the network are oblivious to the presence of adversaries and implement a classical distributed network code. Finally, our algorithms work over wired and wireless networks.