The Community for Technology Leaders
Green Image
Issue No. 10 - Oct. (2013 vol. 24)
ISSN: 1045-9219
pp: 2025-2035
Jin Wang , Soochow University, Suzhou
Jianping Wang , City University of Hong Kong, Kong Kong
Kejie Lu , University of Puerto Rico at Mayagüez, Mayagüez
Bin Xiao , Hong Kong Polytechnic University, Hong Kong
Naijie Gu , University of Science and Technology of China, Hefei
In this paper, we will address the modeling and optimal design of linear network coding (LNC) for secure unicast with multiple streams between the same source and destination pair. The objectives include 1) satisfying the weakly secure requirements, 2) maximizing the transmission data rate, and 3) minimizing the size of the finite field. To fulfill the first two objectives, we formulate a secure unicast routing problem and prove that it is equivalent to a constrained link-disjoint path problem. Based on this fact, we develop an efficient algorithm that can find the optimal unicast topology in a polynomial amount of time. With the given topology, we investigate the design of both weakly secure deterministic LNC and weakly secure random LNC. In the designs of deterministic LNC and random LNC, we prove that the required size of the finite field decreases with the decrease of the number of intermediate nodes in the topology. Therefore, to meet the third objective, we formulate a problem to minimize the number of intermediate nodes. We prove that this problem is NP-Complete and develop an approximation algorithm to solve it. Finally, extensive simulation experiments have been conducted, and the results demonstrate the effectiveness of the proposed algorithms.
Unicast, Topology, Routing, Network topology, Network coding, Vectors, Encoding, finite field, Secure linear network coding, deterministic linear network coding, random linear network coding, passive attack, unicast

N. Gu, B. Xiao, K. Lu, J. Wang and J. Wang, "Modeling and Optimal Design of Linear Network Coding for Secure Unicast with Multiple Streams," in IEEE Transactions on Parallel & Distributed Systems, vol. 24, no. , pp. 2025-2035, 2013.
206 ms
(Ver 3.3 (11022016))