Existing solutions against wiretapping attacks for network coding either bring significant bandwidth overhead or incur a high computational complexity.In order to reduce the security overhead of the existing solutions...Existing solutions against wiretapping attacks for network coding either bring significant bandwidth overhead or incur a high computational complexity.In order to reduce the security overhead of the existing solutions for securing network coding,a novel securing network coding paradigm is presented relying on two coding models:intra-generation coding and inter-generation coding.The basic idea to secure network coding using intra-generation coding is to limit the encryption operations for each generation,and then subject the scrambled and the remaining original source vectors to a linear transformation.This method is then generalized seamlessly using inter-generation coding by further exploiting the algebraic structure of network coding.We show that the proposed schemes have properties of low-complexity security,little bandwidth consumption,and high efficiency in integrating with the existing security techniques effectively.展开更多
To address the issue of field size in random network coding, we propose an Improved Adaptive Random Convolutional Network Coding (IARCNC) algorithm to considerably reduce the amount of occupied memory. The operation o...To address the issue of field size in random network coding, we propose an Improved Adaptive Random Convolutional Network Coding (IARCNC) algorithm to considerably reduce the amount of occupied memory. The operation of IARCNC is similar to that of Adaptive Random Convolutional Network Coding (ARCNC), with the coefficients of local encoding kernels chosen uniformly at random over a small finite field. The difference is that the length of the local encoding kernels at the nodes used by IARCNC is constrained by the depth; meanwhile, increases until all the related sink nodes can be decoded. This restriction can make the code length distribution more reasonable. Therefore, IARCNC retains the advantages of ARCNC, such as a small decoding delay and partial adaptation to an unknown topology without an early estimation of the field size. In addition, it has its own advantage, that is, a higher reduction in memory use. The simulation and the example show the effectiveness of the proposed algorithm.展开更多
We study the construction of minimum bandwidth regenerating code with combinatorial design. At first, a method of constructing minimum storage regenerating (MBR) codes is presented, which can tolerate only one-node ...We study the construction of minimum bandwidth regenerating code with combinatorial design. At first, a method of constructing minimum storage regenerating (MBR) codes is presented, which can tolerate only one-node failure. Then, we give examples to explain the code. Finally, we discuss the case of repairing multiple nodes, and analyze the performance with an example.展开更多
We investigate the error detection ability of intermedi- ate nodes of zig-zag network with small downstream link. We show that the error detection capability of zig-zag networks in the presence of z malicious edges an...We investigate the error detection ability of intermedi- ate nodes of zig-zag network with small downstream link. We show that the error detection capability of zig-zag networks in the presence of z malicious edges and 2z-1 limited links from node B to node u. Also, at last we analyze a family of networks, which shows that the upper bound of network is smaller than the bound we expected, indicating that Singleton bound is not the tightest bound in the particular condition of network. According to this result, we design corresponding encode and decode strategy to reach the bound we propose in this paper.展开更多
基金supported by the National Natural Science Foundation of China(Grant No.11371290,No.61271174,No. 61301178)the Science and Technology Innovation Foundation of Xi'an(Grant No. CXY1352WL28)
文摘Existing solutions against wiretapping attacks for network coding either bring significant bandwidth overhead or incur a high computational complexity.In order to reduce the security overhead of the existing solutions for securing network coding,a novel securing network coding paradigm is presented relying on two coding models:intra-generation coding and inter-generation coding.The basic idea to secure network coding using intra-generation coding is to limit the encryption operations for each generation,and then subject the scrambled and the remaining original source vectors to a linear transformation.This method is then generalized seamlessly using inter-generation coding by further exploiting the algebraic structure of network coding.We show that the proposed schemes have properties of low-complexity security,little bandwidth consumption,and high efficiency in integrating with the existing security techniques effectively.
基金supported by the National Science Foundation (NSF) under Grants No.60832001,No.61271174 the National State Key Lab oratory of Integrated Service Network (ISN) under Grant No.ISN01080202
文摘To address the issue of field size in random network coding, we propose an Improved Adaptive Random Convolutional Network Coding (IARCNC) algorithm to considerably reduce the amount of occupied memory. The operation of IARCNC is similar to that of Adaptive Random Convolutional Network Coding (ARCNC), with the coefficients of local encoding kernels chosen uniformly at random over a small finite field. The difference is that the length of the local encoding kernels at the nodes used by IARCNC is constrained by the depth; meanwhile, increases until all the related sink nodes can be decoded. This restriction can make the code length distribution more reasonable. Therefore, IARCNC retains the advantages of ARCNC, such as a small decoding delay and partial adaptation to an unknown topology without an early estimation of the field size. In addition, it has its own advantage, that is, a higher reduction in memory use. The simulation and the example show the effectiveness of the proposed algorithm.
基金Supported by the National Natural Science Foundation of China(61271174,61301178)
文摘We study the construction of minimum bandwidth regenerating code with combinatorial design. At first, a method of constructing minimum storage regenerating (MBR) codes is presented, which can tolerate only one-node failure. Then, we give examples to explain the code. Finally, we discuss the case of repairing multiple nodes, and analyze the performance with an example.
基金Supported by the National Natural Science Foundation of China(61271174,61301178)
文摘We investigate the error detection ability of intermedi- ate nodes of zig-zag network with small downstream link. We show that the error detection capability of zig-zag networks in the presence of z malicious edges and 2z-1 limited links from node B to node u. Also, at last we analyze a family of networks, which shows that the upper bound of network is smaller than the bound we expected, indicating that Singleton bound is not the tightest bound in the particular condition of network. According to this result, we design corresponding encode and decode strategy to reach the bound we propose in this paper.