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

Opportunistic Schedulings for random linear network coding in Time Varying Channels

IEEE COMMUNICATIONS LETTERS 2015年第9期19卷 1608-1611页

作者： Park, Sungjin Cho, Dong-Ho Korea Adv Inst Sci & Technol Dept Elect Engn Taejon 305701 South Korea

Opportunistic scheduling schemes based on random linear network coding (RLNC) are proposed in this letter. The schemes are developed taking into consideration channel state information and acknowledgement information in time varying channels. We derived an overall success probability and a total symbol length (or a total transmission delay) to evaluate conventional RLNC and proposed RLNC schemes. Numerical results showed that the proposed RLNC schemes offer significant advantages over the conventional RLNC scheme in various environments.

关键词： random linear network coding adaptive modulation success probability transmission delay

来源：评论

学校读者我要写书评

暂无评论

Secure random linear network coding on a wiretap network

引用

AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS 2015年第1期69卷 467-472页

作者： Cao, Zhanghua Zhang, Shibing Ji, Xiaodong Zhang, Lai Nantong Univ Sch Elect & Informat Nantong 226019 Jiangsu Peoples R China Umea Univ Dept Math & Math Stat SE-90187 Umea Sweden

We develop a secure random linear network coding scheme on wiretap networks where a wiretapper can only eavesdrop on a limited number of channels. On one hand, by refining Lima's "locked coefficients" method and applying the approach of one-time pad, our scheme can well protect message packets without decreasing network throughput. On the other hand, by treating ciphertext as noisy symbols, inspired by the physical layer technique, and applying Shamir's secret sharing scheme, our scheme can successfully protect secret random seed without any forms of key exchange or secret channels. Compared to existing schemes, our scheme has minimum information overhead, independency of hash functions, and no restriction on global encoding kernel. Finally, we analyze the computational complexity of our proposed scheme and rigorously prove that our scheme can achieve secure network communication. (C) 2014 Elsevier GmbH. All rights reserved.

关键词： Wiretap networks Information theoretic security random linear network coding Secret sharing One-time pad

来源：评论

学校读者我要写书评

暂无评论

Exact Decoding Probability of random linear network coding for Combinatorial networks

引用

Wuhan University Journal of Natural Sciences 2015年第5期20卷 391-396页

作者： LI Fang School of Information Xi’an University of Finance and Economics State Key Laboratory of Integrated Services Networks (ISN) Xidian University

Combinatorial networks are widely applied in many practical scenarios. In this paper, we compute the closed-form probability expressions of successful decoding at a sink and at all sinks in the multicast scenario, in which one source sends messages to k destinations through m relays using random linear network coding over a Galois field. The formulation at a （all） sink（s） represents the impact of major parameters, i.e., the size of field, the number of relays （and sinks） and provides theoretical groundings to numerical results in the literature. Such condition maps to the receivers＇ capability to decode the original information and its mathematical characterization is helpful to design the coding. In addition, numerical results show that, under a fixed exact decoding probability, the required field size can be minimized.

关键词： random linear network coding successful probability combinatorial networks

来源：评论

学校读者我要写书评

暂无评论

Fault-Tolerant and Secure Distributed Data Storage Using random linear network coding

Fault-Tolerant and Secure Distributed Data Storage Using Ran...

引用

International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless networks

作者： Pouya Ostovari Jie Wu Department of Computer & Information Sciences Temple University Philadelphia PA 19122

ISBN: (纸本)9781509013128

network coding is a technique which can be used in wired and wireless networks to increase the throughput of the networks and provide reliable transmissions. Also, it can be used in distributed storage systems to store large data on different storages and provide fault tolerance against storage failures. Using network coding, the set of packets that form a file can be encoded to an infinite number of packets, and a subset of these coded packets is sufficient to retrieve the original data. In addition to providing fault tolerance, network coding is an efficient tool for protecting the data from eavesdroppers. An eavesdropper is not able to decode the coded packets and retrieve the original data unless it has access to a sufficient number of coded packets. Increasing the redundancy enhances the fault tolerance. However, it makes the system more vulnerable against eavesdropper attacks. In this work, we perform a tradeoff between security of a distributed storage system and its fault tolerance. We formulate the problem as a mixed integer and linear programming, and propose two linear programming optimizations to solve it.

关键词： network coding security fault tolerance data storage optimization random linear network coding

来源：评论

学校读者我要写书评

暂无评论

Efficient Error Control Decoder Architectures for Noncoherent random linear network coding

引用

JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY 2014年第2期76卷 195-209页

作者： Lin, Jun Xie, Hongmei Yan, Zhiyuan Lehigh Univ Dept Elect & Comp Engn Bethlehem PA 18015 USA

random linear network coding is an efficient technique for disseminating information in networks, but it is highly susceptible to errors. Kotter-Kschischang (KK) codes and Mahdavifar-Vardy (MV) codes are two important families of subspace codes that provide error control in noncoherent random linear network coding. List decoding has been used to decode MV codes beyond half distance. Existing hardware implementations of the rank metric decoder for KK codes suffer from limited throughput, long latency and high area complexity. The interpolation-based list decoding algorithm for MV codes still has high computational complexity, and its feasibility for hardware implementations has not been investigated. In this paper we propose efficient decoder architectures for both KK and MV codes and present their hardware implementations. Two serial architectures are proposed for KK and MV codes, respectively. An unfolded decoder architecture, which offers high throughput, is also proposed for KK codes. The synthesis results show that the proposed architectures for KK codes are much more efficient than rank metric decoder architectures, and demonstrate that the proposed decoder architecture for MV codes is affordable.

关键词： Kotter-Kschischang (KK) codes Mahdavifar-Vardy (MV) codes random linear network coding List decoding linearized polynomial interpolation Subspace codes Constant-dimension codes

来源：评论

学校读者我要写书评

暂无评论

ERSS-RLNC: Efficient and robust secure scheme for random linear network coding

引用

COMPUTER networkS 2014年第PartA期75卷 99-112页

作者： Noura, Hassan Martin, Steven Al Agha, Khaldoun Chahine, Khaled Univ Paris 11 CNRS LRI F-91405 Orsay France Lebanese Int Univ Dept Elect & Elect Engn Signals & Syst Grp Beirut Lebanon

random linear network coding (RLNC) is a promising technology of network coding (NC) that has been proved to be both sufficient and efficient. To enable the deployment of RLNC in real networks, this paper first introduces a new efficient and flexible authentication-encryption scheme that is immune to Byzantine and eavesdropping attacks. The proposed scheme achieves simultaneously information confidentiality, packet integrity and source authentication with minimum computational complexity and memory consumption. It also presents a new technique for constructing an integer Global Encoding Matrix (GEM) that satisfies the inversion property in a dynamic manner. In addition, the proposed scheme uses dynamic keys to ensure robustness against attacks. Secondly, an efficient implementation of Binary RLNC, suitable for battery constrained mobile devices with low computational capabilities such as mobile phones and sensors, is defined. The effectiveness of the coding process is proved by modifying the Galois field of calculation from integer (int8, int16) to binary. Not only does this ensure low computational requirements, high throughput and low energy consumption, but also reduces the statistical characteristics of the coding process. The obtained theoretical and experimental results show that the new scheme is secure and efficient compared with many recent works in this field. (C) 2014 Elsevier B.V. All rights reserved.

关键词： random linear network coding Authentication and encryption algorithm Homomorphic encryption Invertible integer and binary global encoding matrix

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of random linear network coding using a Vandermonde matrix

引用

PHYSICAL COMMUNICATION 2014年 10卷 24-30页

作者： Mane, Pallavi R. Adiga, Sudhakara G. Kumar, M. Sathish Manipal Univ Manipal Inst Technol Dept Elect & Commun Engn Manipal 576104 India Manipal Univ Manipal Inst Technol Dept Math Manipal 576104 India

This paper discusses random linear network coding with and without the use of a Vandermonde matrix to obtain the coding coefficients. Performance comparisons of such random linear network coded networks with networks employing traditional store and forward technique are also provided. It is shown that random linear network coding using a Vandermonde matrix can improve the network utilization factor by reducing the overhead compared to random linear coding that does not use a Vandermonde matrix. Our numerical results show that random linear network coding with a Vandermonde matrix provides a considerable improvement in throughput and delay when compared to a network employing a traditional store and forward strategy. An inherent feature of random linear network coding which makes it possible to employ simple encryption techniques is also discussed. (C) 2013 Elsevier B.V. All rights reserved.

关键词： network coding Utilization factor random linear network coding Vandermonde matrix Packet delivery delay

来源：评论

学校读者我要写书评

暂无评论

Hierarchical random linear network coding for Multicast Scalable Video Streaming

Hierarchical Random Linear Network Coding for Multicast Scal...

引用

Annual Summit and Conference of Asia-Pacific-Signal-and-Information-Processing-Association (APSIPA)

作者： Chau, Phuc Kim, Seongyeon Lee, Yongwoo Shin, Jitae Sungkyunkwan Univ Sch Elect & Elect Engn Suwon South Korea

ISBN: (纸本)9786163618238

network coding (NC) has been exploited to minimize delay, energy per bit and to maximize throughput over lossy networks. However, applying network coding for scalable video transmission over packet-lossy networks is still an active research topic because of the challenge in trading off between rank deficiency problem and scalability of the video bitstream. Scalable video coding promises providing flexible broadcasting to heterogeneous user equipments, but the rank deficiency problem in NC limits the scalable capability in video streaming since the time of waiting for full rank causes long delay. In this paper, we exploit the combination of hierarchical and random linear network coding for solving the above issue. The hierarchical network coding provides unequal erasure protection for scalable layers and addresses the process of decoding layer by layer according to importance. Otherwise, random linear network coding provides error-correcting capability and makes the scheme resilient to packet loss. Our proposed network coding scheme benefits from these two schemes for multicast scalable video streaming. The simulation results and performance analysis are provided to evaluate the efficiency in terms of averaged decoding probability and peak signal-to-noise ratio. The proposed scheme achieves same performance of random linear network coding in good channel and approximately hierarchical network coding scheme in bad channel.

关键词： hierarchical network coding random linear network coding scalable video transmission cellular networks

来源：评论

学校读者我要写书评

暂无评论

Data confidentiality-preserving schemes for random linear networkcoding-capable networks

引用

JOURNAL OF INFORMATION SECURITY AND APPLICATIONS 2022年 66卷

作者： Brahimi, Mohamed Amine Merazka, Fatiha USTHB Univ Elect & Comp Engn Fac Dept Telecommun LISIC Lab Algiers 16111 Algeria

random linear network coding (RLNC) has been primarily devised as a throughput-efficient transmissionscheme. However, due to its intrinsic security provided by the confusion resulting from the encodingoperations, RLNC has also been proposed to be used in many security solutions to mitigate common securitythreats such as wiretap attacks. In this paper, we propose two encryption schemes as a solution to thewiretap problem in an RLNC-capable network. Both of our encryption schemes rely on securing the encodingcoefficient matrix as well as the partial permutation of the data matrix symbols after the application of the Ttransformation. This latter is used to represent the data matrix over a smaller finite field to increase the numberof possible permutations as well as the confusion and diffusion properties of the system. Comparative analysisshows that our schemes are more computationally secure and provide better confusion and diffusion thanthe Secure Practical network coding (SPOC) and P-coding, which are state-of-the-art schemes. The executiontimes of both schemes stand between those of P-coding and SPOC, which verifies their lightweight nature.

关键词： Confusion Diffusion Encryption Decryption Permutation P-coding random linear network coding Security SPOC

来源：评论

学校读者我要写书评

暂无评论

Joint random linear network coding and Convolutional Code with Interleaving for Multihop Wireless network

Joint Random Linear Network Coding and Convolutional Code wi...

引用

IEEE 27th International Conference on Advanced Information networking and Applications Workshops (WAINA)

作者： Susanto, Misfa Hu, Yim Fun Pillai, Prashant Univ Bradford Sch Engn Design & Technol Bradford BD7 1DP W Yorkshire England

ISBN: (纸本)9780769549521;9781467362399

Error control techniques are designed to ensure reliable data transfer over unreliable communication channels that are frequently subjected to channel errors. In this paper, the effect of applying a convolution code to the Scattered random network coding (SRNC) scheme over a multi-hop wireless channel was studied. An interleaver was implemented for bit scattering in the SRNC with the purpose of dividing the encoded data into protected blocks and vulnerable blocks to achieve error diversity in one modulation symbol while randomising errored bits in both blocks. By combining the interleaver with the convolution encoder, the network decoder in the receiver would have enough number of correctly received network coded blocks to perform the decoding process efficiently. Extensive simulations were carried out to study the performance of three systems: 1) SRNC with convolutional encoding;2) SRNC;and 3) A system without convolutional encoding nor interleaving. Simulation results in terms of block error rate for a 2-hop wireless transmission scenario over an Additive White Gaussian Noise (AWGN) channel were presented. Results showed that the system with interleaving and convolutional code achieved better performance with coding gain of at least 1.29 dB and 2.08 dB on average when the block error rate is 0.01 when compared with system II and system III respectively.

关键词： Error correction code convolutional code interleaving random linear network coding mutihop transmission

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：