TY - GEN
T1 - On achieving maximum secure throughput using network coding against wiretap attack
AU - Chang, Xiangmao
AU - Wang, Jin
AU - Wang, Jianping
AU - Lee, Victor
AU - Lu, Kejie
AU - Yang, Yixian
PY - 2010
Y1 - 2010
N2 - In recent years network coding has attracted significant attention in telecommunication. The benefits of network coding to a communication network include the increased throughput as well as secure data transmission. The purpose of this work is to design secure linear network coding against wiretap attack. The problem is to maximize the transmission data rate of multiple unicast streams between a pair of source and destination nodes, under the condition of satisfying the weakly secure requirements. Different from most existing research on network coding that designs the network coding scheme based on a given network topology, we will consider the integrated network topology design and network coding design. Such an integrated approach has not been reported by other researchers. In this paper, we formally introduce the problem, prove the problem is computational intractable, and then develop efficient heuristic algorithms. We first try to find the transmission topology that is suitable for network coding. Based on the topology, we design linear network coding scheme that is weakly secure. We conduct simulations to show that the proposed algorithms can achieve good performance. © 2010 IEEE.
AB - In recent years network coding has attracted significant attention in telecommunication. The benefits of network coding to a communication network include the increased throughput as well as secure data transmission. The purpose of this work is to design secure linear network coding against wiretap attack. The problem is to maximize the transmission data rate of multiple unicast streams between a pair of source and destination nodes, under the condition of satisfying the weakly secure requirements. Different from most existing research on network coding that designs the network coding scheme based on a given network topology, we will consider the integrated network topology design and network coding design. Such an integrated approach has not been reported by other researchers. In this paper, we formally introduce the problem, prove the problem is computational intractable, and then develop efficient heuristic algorithms. We first try to find the transmission topology that is suitable for network coding. Based on the topology, we design linear network coding scheme that is weakly secure. We conduct simulations to show that the proposed algorithms can achieve good performance. © 2010 IEEE.
UR - https://www.scopus.com/pages/publications/77955861108
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-77955861108&origin=recordpage
U2 - 10.1109/ICDCS.2010.27
DO - 10.1109/ICDCS.2010.27
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 978-1-4244-7261-1
T3 - Proceedings of the International Conference on Distributed Computing Systems
SP - 526
EP - 535
BT - Proceedings - 2010 International Conference on Distributed Computing Systems ICDCS 2010
PB - IEEE
T2 - 30th IEEE International Conference on Distributed Computing Systems (ICDCS 2010)
Y2 - 21 June 2010 through 25 June 2010
ER -