Modeling and Optimal Design of Linear Network Coding for Secure Unicast with Multiple Streams

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) m...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on parallel and distributed systems Ročník 24; číslo 10; s. 2025 - 2035
Hlavní autoři: Wang, Jin, Wang, Jianping, Lu, Kejie, Xiao, Bin, Gu, Naijie
Médium: Journal Article
Jazyk:angličtina
Vydáno: IEEE 01.10.2013
Témata:
deterministic linear network coding
Encoding
finite field
Network coding
Network topology
passive attack
random linear network coding
Routing
Secure linear network coding
Topology
Unicast
Vectors
ISSN:1045-9219
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISSN:1045-9219
DOI:10.1109/TPDS.2012.265