Optimal Rate Allocation and Linear Network Coding Design for Secure Multicast with Multiple Streams
Zhengqing Wen, Jin Wang, Kejie Lu, Jingya Zhou, Zhenguo Gao, Yanqin Zhu · 2016
Recently, network traffic keeps growing rapidly. How to efficiently and securely deliver huge volume of data to multiple devices is a challenging problem. Linear network coding (LNC) is a technique which can be used to improve network throughput, efficiency and security. In this paper, we investigate the secure multicast with multiple streams (SMMS) problem. Specifically, we jointly consider the rate allocation, the transmission topology selection and the secure LNC design together to maximize the secure weighted throughput (SWT) of the multicast. We first define the SMMS problem and theoretically prove a sufficient and necessary condition that a secure multicast LNC exists. Moreover, we also show the construction of the secure multicast LNC and the sufficient condition on the size of the required finite field. We then model the SMMS problem as a nonlinear programming (NLP) and further equivalently transform it as a linear programming (LP) to find the optimal rate allocation and transmission topology based on which a secure multicast LNC exists to achieve the maximum SWT. Finally, we conduct considerable simulations with different parameters to demonstrate the effectiveness of the proposed schemes.