检索结果-内蒙古大学图书馆

Bounds on Decoding Failure Probability in linear network coding Schemes with Erasure Channels

IEEE COMMUNICATIONS LETTERS 2014年第4期18卷 648-651页

作者： Seong, Jin-Taek Gwangju Inst Sci & Technol Dept Informat & Commun Kwangju South Korea

We consider a performance analysis for decoding the source information in linear network coding schemes with erasure channels. Multiple relays assist in the successful transmission of source messages to their destination. Owing to unreliable communication links, network connections between nodes vary, leading to a failure of relays for generating the linear combinations of incoming messages in network coding scenarios. In this letter, we derive upper and lower bounds on the decoding failure probability in which a network code matrix does not have full rank in the dynamic network connections. We then investigate the impact of the major parameters, i.e., the number of relays, a finite field size, and the erasure probability, on the decoding performance.

关键词： linear network coding upper bound lower bound rank

来源：评论

学校读者我要写书评

暂无评论

Strongly Secure linear network coding

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2008年第10期E91A卷 2720-2728页

作者： Harada, Kunihiko Yamamoto, Hirosuke Univ Tokyo Grad Sch Informat Sci & Technol Dept Math Informat Tokyo 1138656 Japan Univ Tokyo Grad Sch Frontier Sci Dept Complex Sci & Engn Tokyo 2778561 Japan

In a network with capacity h for multicast, information X-h = (X-1, X-2, ... , X-h) can be transmitted from a source node to sink nodes without error by a linear network code. Furthermore, secret information S-r = (S-1, S-2, ... , S-r) can be transmitted securely against wiretappers by k-secure network coding for k <= h-r. In this case, no information of the secret leaks out even if an adversary wiretaps k edges, i.e. channels. However, if an adversary wiretaps k+1 edges. some S-i may leak Out explicitly. In this paper, we propose strongly k-secure network coding based on strongly secure ramp secret sharing schemes. In this coding, no information leaks out for every (S-i1, S-i2, ... , Sir-j) even if an adversary wiretaps k+j channels. We also give an algorithm to construct a strongly k-secure network code directly and a transform to convert a nonsecure network code to a strongly k-secure network code. Furthermore, some sufficient conditions of alphabet size to realize the strongly k-secure network coding are derived for case of k < h-r.

关键词： network coding secure network coding linear network coding secret sharing schemes strong ramp secret sharing schemes

来源：评论

学校读者我要写书评

暂无评论

Multiple-User Cooperative Communications Based on linear network coding

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2010年第12期58卷 3345-3351页

作者： Xiao, Ming Skoglund, Mikael Royal Inst Technol Commun Theory Lab Sch Elect Engn Stockholm Sweden Royal Inst Technol ACCESS Linnaeus Ctr Stockholm Sweden

We propose a new scheme for cooperative wireless networking based on linear network codes. The network consists of multiple (M >= 2) users having independent information to be transmitted to a common basestation ( BS), assuming block-fading channels with independent fading for different codewords. The users collaborate in relaying messages. Because of potential transmission errors in links, resulting in erasures, the network topology is dynamic. To efficiently exploit the diversity available by cooperation and time-varying fading, we propose the use of diversity network codes (DNCs) over finite fields. These codes are designed such that the BS is able to rebuild the user information from a minimum possible set of coded blocks conveyed through the dynamic network. We show the existence of deterministic DNCs. We also show that the resulting diversity order using the proposed DNCs is 2M - 1, which is higher than schemes without network coding or with binary network coding. Numerical results from simulations also show substantial improvement by the proposed DNCs over the benchmark schemes. We also propose simplified versions of the DNCs, which have much lower design complexity and still achieve the diversity order 2M - 1.

关键词： linear network coding cooperative communications source-coding outage probability code construction dynamic topology field size

来源：评论

学校读者我要写书评

暂无评论

Optimal Transmission Topology Construction and Secure linear network coding Design for Virtual-Source Multicast With Integral Link Rates

引用

IEEE TRANSACTIONS ON MULTIMEDIA 2018年第11期20卷 3069-3083页

作者： Zhao, Ruimin Wang, Jin Lu, Kejie Chang, Xiangmao Jia, Juncheng Zhang, Shukui Suzhou Univ Dept Comp Sci & Technol Suzhou 215006 Peoples R China Univ Puerto Rico Mayaguez Dept Comp Sci & Engn Mayaguez PR 00681 USA Nanjing Univ Aeronaut & Astronaut Sch Comp Sci & Technol Nanjing 210007 Jiangsu Peoples R China

The continuous demand for content-rich multimedia is pushing for high-speed and secure transmission approaches. In recent years, linear network coding (LNC) has been shown to be a promising technology to improve network throughput, transmission reliability, and information security. In this paper, we study the optimal transmission topology construction and LNC design for a secure multiple-source multicast to deliver the same content with integral link rates, which can be equivalent to the secure multicast problem with a virtual source, i.e., the integer secure virtual-source multicast (ISVM) problem. The objectives of the ISVM problem include the following: 1) satisfy the weakly secure requirements, 2) maximize the secure multicast rate (SMR), and 3) minimize the transmission cost when the SMR is maximized. First, we analyze the necessary and sufficient condition that there exist a transmission topology with integral link rates and a secure LNC that can achieve a given SMR R. Then, we model the ISVM problem as an integer linear programming based on the theoretical analysis and design an efficient transmission topology construction algorithm to solve the ISVM problem by utilizing the Lagrangian relaxation and subgradient method. We also analyze the size of finite field required to construct the deterministic LNC for a secure virtual-source multicast and the probability that the virtual-source multicast is weakly secure when using random LNC in the ISVM problem. Finally, we design upper and lower bounds for the ISVM problem and conduct extensive simulations to compare the performance of the proposed algorithms with these two bounds.

关键词： linear network coding multi-source multicast weakly secure throughput integral link rate

来源：评论

学校读者我要写书评

暂无评论

On the Inherent Security of linear network coding

引用

IEEE COMMUNICATIONS LETTERS 2013年第8期17卷 1668-1671页

作者： Adeli, Majid Liu, Huaping Oregon State Univ Sch Elect Engn & Comp Sci Corvallis OR 97331 USA

Targeting passive attackers, a new security protocol based on the inherent security of linear network coding is proposed. Our scheme does not employ any auxiliary transformation or cryptographic routine at any network entity. Moreover, it avoids imposing any throughput reduction. The probabilistic weak security is achieved by selecting "proper" encoding vectors for the outgoing channels at every network node. The probability of finding proper encoding vectors and the probability of protocol security assurance drastically increase as the code field size or the number of transmittable symbols increase, or as the attacker becomes more limited in accessing independent channels.

关键词： linear network coding passive attack throughput efficiency weak security

来源：评论

学校读者我要写书评

暂无评论

Optimal Transmission Topology Construction and Secure linear network coding Design for Multicast with Integral Link Rates

Optimal Transmission Topology Construction and Secure Linear...

引用

18th IEEE International Conference on High Performance Computing and Communications (HPCC) / 14th IEEE International Conference on Smart City (Smart City) / 2nd IEEE International Conference on Data Science and Systems (DSS)

作者： Zhao, Ruimin Wang, Jin Lu, Kejie Chang, Xiangmao Li, Lingzhi Zhu, Yanqin Soochow Univ Dept Comp Sci & Technol Suzhou Peoples R China Univ Puerto Rico Dept Elect & Comp Engn Mayaguez PR USA Nanjing Univ Aeronaut & Astronaut Sch Comp Sci & Technol Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781509042975

linear network coding (LNC) is a promising technology that can increase network throughput, improve transmission robustness and provide data confidentiality. In this paper, we investigate the optimal transmission topology construction and LNC design for secure multicast, i. e., the Integer Secure Multicast (ISM) problem. The ISM problem aims to find the transmission topology with integral link rates and design the secure LNC to (1) meet the requirements of weak security, (2) achieve the maximum secure transmission rate (STR) and (3) minimize transmission cost (TC) under the maximum STR guarantee. Specifically, in this paper, we firstly give theoretical analysis to show a sufficient and necessary condition that there exists a transmission topology with integral link rates and a secure LNC with STR R. Based on the sufficient and necessary condition, we then formulate the ISM problem into an integer linear programming (ILP) and also design an efficient transmission topology construction (TTC) algorithm to obtain a near-optimal solution of the problem. Based on Lagrangian relaxation and subgradient algorithm, the TTC algorithm is designed within polynomial computational complexity. Finally, we evaluate the performance of the proposed TTC algorithm together with a lower bound and an upper bound of the ISM problem through extensive experiments. Simulation results validate the effectiveness of the proposed TTC algorithm.

关键词： Integral rate linear network coding Multicast Throughput Weakly secure

来源：评论

学校读者我要写书评

暂无评论

ACHIEVABLE RATE REGIONS IN MULTIPLE-ANTENNA networkS WITH linear network coding

ACHIEVABLE RATE REGIONS IN MULTIPLE-ANTENNA NETWORKS WITH LI...

引用

12th IEEE International Workshop on Signal Processing Advances in Wireless Communications

作者： Richter, Johannes Wolf, Anne Jorswieck, Eduard A. Tech Univ Dresden Dept Elect Engn & Informat Technol Commun Lab Dresden Germany

ISBN: (纸本)9781424493326

In this paper, the combination of linear network coding over a finite field and beamforming for a multiple-antenna network is studied. Assuming a multicast transmission scheme and a decode-and-forward protocol, optimal beamforming strategies for the network nodes are derived for a certain class of interference networks. An efficient algorithm is presented to calculate the achievable rate region of these networks. The sum power for the transmission of the multicast information is minimized under rate requirements. The proposed approach is illustrated by one important scenario.

关键词： Multiple-antenna network multicast transmission beamforming optimization linear network coding achievable rate region sum power minimization

来源：评论

学校读者我要写书评

暂无评论

An approach of anti-eavesdropping linear network coding in wireless network 22

An approach of anti-eavesdropping linear network coding in w...

引用

22nd IEEE International Conference on Parallel and Distributed Systems (ICPADS)

作者： Ning, Zuoting Zhang, Dafang Xie, Kun Hunan Univ Coll Comp Sci & Elect Engn Changsha 410082 Hunan Peoples R China

ISBN: (纸本)9781509044573

The existing anti-eavesdropping researches on wireless network coding are mainly based on the assumption that the eavesdroppers can only monitor limited channels and don't cooperate with each other. But in real settings, the eavesdroppers share overheard information, which makes data leakage come true. Moreover, these approaches just encrypt or permutate the coding coefficients to prevent the adversaries from understanding the transmission data, they can't resist pollution attacks, such as forgery and tamper attacks. In this case, we propose a novel secure linear network coding scheme that is based on IBC(Identity-Based Cryptography) algorithm and has the characteristic of preventing eavesdropping and pollution attacks. Theoretical analysis and experiment demonstrate that our scheme guarantees the data security for each node, which significantly prevents the nodes from being eavesdropped and resists pollution attacks. Furthermore, our scheme enriches the approaches of anti-eavesdropping research in wireless network coding.

关键词： linear network coding Eavesdrop Security IBC Algorithm

来源：评论

学校读者我要写书评

暂无评论

Self-adapting linear network coding Emulation

Self-adapting Linear Network Coding Emulation

引用

International Symposium on networks, Computers and Communications (ISNCC)

作者： Coelho, Nuno B. Monteiro, Francisco A. Lopes, Rui J. ISCTE Inst Univ Lisboa Inst Telecomunicacoes Lisbon Portugal ISCTE Inst Univ Lisboa Dept Informat Sci & Technol Lisbon Portugal

ISBN: (纸本)9781728112442

linear network coding (LNC) introduced a new paradigm for routing data across networks where the transported packets are not the original information packets but rather linear combinations of the original packets. This is known to allow a more efficient use of the network resources. With LNC based on systematic network codes, the network's capacity is chiefly defined by the rank of the end-to-end equivalent transfer matrix. This paper presents a network-layer emulator based on the object-oriented programming paradigm, which allows, for any network topology, to have the network's capacity self-optimized by adapting the coding operations performed at each node, depending on the impact the changes have on the global rank of the global transfer matrix, and on a metric related to the use of network's resources.

关键词： linear network coding Software defined networks network resilience Rank metric Java emulation

来源：评论

学校读者我要写书评

暂无评论

Rank Deficient Decoding of linear network coding

Rank Deficient Decoding of Linear Network Coding

引用

IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Yan, Zhiyuan Xie, Hongmei Suter, Bruce W. Lehigh Univ Dept Elect & Comp Engn Bethlehem PA 18015 USA Air Force Res Lab Griffiss AFB NY 13441 USA

ISBN: (纸本)9781479903566

Since all packets in linear network coding are subject to linear combinations, in all existing network coding schemes, a full rank of received packets is required to start decoding. This requirement unfortunately results in long delays and low throughputs. In this work we propose two classes of rank deficient decoders that work for rank deficient received packets. Within either class, different decoding strategies have been proposed for tradeoffs between delay/throughput and data accuracy. The decoders of the first class take advantage of the sparsity inherent in data and produce the data vectors with the smallest Hamming weight. Since these decoders have high complexities, we propose a class of decoders with polynomial complexities based on linear programming. Both classes of decoders can recover data from fewer received packets and hence achieve higher throughputs and shorter delays than the full rank decoder.

关键词： linear network coding rank deficient decoding linear programming

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：