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

Hierarchical Performance Analysis on random linear network coding

IEEE TRANSACTIONS ON COMMUNICATIONS 2018年第5期66卷 2009-2021页

作者： Li, Dan Guang, Xuan Zhou, Zhiheng Li, Congduan Tan, Chee Wei Tianjin Univ Technol Dept Math Tianjin 300384 Peoples R China Nankai Univ Sch Math Sci Tianjin 300071 Peoples R China Nankai Univ LPMC Tianjin 300071 Peoples R China Chinese Univ Hong Kong Inst Network Coding Hong Kong Hong Kong Peoples R China Chinese Univ Hong Kong Inst Network Coding Hong Kong Hong Kong Peoples R China Univ Elect Sci & Technol China Natl Key Lab Sci & Technol Commun Chengdu 611731 Sichuan Peoples R China City Univ Hong Kong Dept Comp Sci Hong Kong Hong Kong Peoples R China

random linear network coding (RLNC) is a promising network coding solution when the network topology information is not fully available to all the nodes. However, in practice, nodes have partial knowledge of the network topology information. Motivated by this, we investigate the performance of RLNC and obtain different upper bounds on the failure probability of RLNC for the network constrained by different partial network topology information. These upper bounds not only improve the existing ones in the literature, but also show that the partial network topology information can bring benefits to the performance analysis of RLNC. On the other hand, it is observed that if more network topology information can be utilized, tighter upper bounds can be obtained, as expected. The upper bounds on two classical networks are compared for demonstration. To obtain a deeper understanding about the performance of RLNC, the asymptotic behavior of RLNC as the field size goes to infinity is also investigated.

关键词： random linear network coding failure probability hierarchical performance upper bound asymptotic behavior

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

The Failure Probabilities of random linear network coding at Sink Nodes

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2016年第6期E99A卷 1255-1259页

作者： Li, Dan Guang, Xuan Fu, Fang-Wei Tianjin Univ Technol Dept Math Tianjin 300384 Peoples R China Nankai Univ Sch Math Sci Tianjin 300071 Peoples R China Nankai Univ Chern Inst Math Tianjin 300071 Peoples R China

In the paradigm of network coding, when the network topology information cannot be utilized completely, random linear network coding (RLNC) is proposed as a feasible coding scheme. But since RLNC neither considers the global network topology nor coordinates codings between different nodes, it may not achieve the best possible performance of network coding. Hence, the performance analysis of RLNC is very important for both theoretical research and practical applications. Motivated by a fact that different network topology information can be available for different network communication problems, we study and obtain several upper and lower bounds on the failure probability at sink nodes depending on different network topology information in this paper, which is also the kernel to discuss some other types of network failure probabilities. In addition, we show that the obtained upper bounds are tight, the obtained lower bound is asymptotically tight, and we give the worst cases for different scenarios.

关键词： network coding random linear network coding failure probability at sink nodes upper/lower bounds network topology information tightness

来源：评论

学校读者我要写书评

暂无评论

Exact Decoding Probability Under random linear network coding

引用

IEEE COMMUNICATIONS LETTERS 2011年第1期15卷 67-69页

作者： Trullols-Cruces, Oscar Barcelo-Ordinas, Jose M. Fiore, Marco Univ Politecn Cataluna Dept Comp Architecture Barcelona Spain Univ Lyon INRIA INSA Lyon CITI Lab F-69621 Villeurbanne France

In this letter, we compute the exact probability that a receiver obtains N linearly independent packets among K >= N received packets, when the sender/s use/s random linear network coding over a Galois Field of size q. Such condition maps to the receiver's capability to decode the original information, and its mathematical characterization helps to design the coding so to guarantee the correctness of the transmission. Our formulation represents an improvement over the current upper bound for the decoding probability, and provides theoretical grounding to simulative results in the literature.

关键词： random linear network coding wireless networks error control

来源：评论

学校读者我要写书评

暂无评论

A Generic Secure Transmission Scheme Based on random linear network coding

引用

IEEE-ACM TRANSACTIONS ON networkING 2022年第2期30卷 855-866页

作者： Wu, Renyong Ma, Jieming Tang, Zhixiang Li, Xiehua Choo, Kim-Kwang Raymond Hunan Univ Coll Comp Sci & Elect Engn Changsha 410082 Peoples R China State Grid Wuhan Power Supply Co Wuhan 430074 Peoples R China Univ Texas San Antonio Dept Informat Syst & Cyber Secur San Antonio TX 78249 USA

Unlike general routing strategies, network coding (NC) can combine encoding functions with multi-path propagation over a network. This allows network capacity to be achieved to support complex security solutions. Moreover, NC has intrinsic security advantages against passive attacks over traditional routing techniques. However, due to the transmission of the global encoding kernels, the system is fragile to eavesdropping attacks with multiple probes. This paper proposes a generic unicast secure transmission scheme based on random linear network coding (RLNC). Specifically, the intended receiver generates a random matrix upon receiving the request from the source node, and then transmits each row vector of this matrix over a link reversely to the source node. Each intermediate node rearranges all received vectors to form a matrix by row, and then post-multiplies its local encoding kernel by this matrix to obtain a new matrix. Similarly, each row vector of the new matrix is reversely transmitted over a link to the source node. This procedure is performed until we have the source node, where the generalized inverse of the received matrix (or part of it) can be used as its local encoding kernel. Hence, the intended receiver can use the generated matrix (or the corresponding part) to decode the received data packets directly. We also analyze the security to demonstrate that the proposed scheme is at least as secure as other methods against wiretapping attacks. We also evaluate the performance of the proposed scheme to demonstrate its utility.

关键词： Encoding Kernel network coding Receivers Codes Routing Unicast Secure network coding multi-path propagation eavesdropping attack random linear network coding

来源：评论

学校读者我要写书评

暂无评论

Improving the energy efficiency for the WBSN bottleneck zone based on random linear network coding

引用

IET WIRELESS SENSOR SYSTEMS 2018年第1期8卷 17-25页

作者： Alshaheen, Hisham Rizk, Haifa Takruri Univ Salford Comp Sci & Engn Sch Manchester Lancs England

The reduction of energy consumption and the successful delivery of data are important for a wireless body sensor network (WBSN). Many studies have been performed to improve energy efficiency, but most of them have not focused on the biosensor nodes in the WBSN bottleneck zone. Energy consumption is a critical issue in WBSNs, as the nodes that are placed next to the sink node consume more energy. All biomedical packets are aggregated through these nodes forming a bottleneck zone. This study proposes a novel mathematical model for body area network topology to explain the deployment and connection between biosensor nodes, simple relay nodes, network coding (NC) relay nodes and the sink node. Therefore, this study is dedicated to research both the energy saving and delivery of data if there is a failure in one of the links of the transmission, which relates to the proposed random linear NC model in the WBSN. Using a novel mathematical model for the WBSN, it is apparent that energy consumption is reduced and data delivery achieved with the proposed mechanism. This study details the stages of the research work.

关键词： energy conservation mathematical analysis random codes linear codes network coding telecommunication network topology body area networks biosensors relay networks (telecommunication) telecommunication network reliability body sensor networks energy efficiency WBSN random linear network coding energy consumption wireless body sensor network biosensor node biomedical packet aggregation mathematical model body area network topology relay node NC data delivery

来源：评论

学校读者我要写书评

暂无评论

MODIFIED EARLIEST DEcoding IN networkS THAT IMPLEMENT random linear network coding

引用

SAIEE AFRICA RESEARCH JOURNAL 2012年第4期103卷 165-171页

作者： von Solms, S. Helberg, A. S. J. North West Univ Sch Elect Elect & Comp Engn Potchefstroom Campus Potchefstroom South Africa

In this paper we present a formalised description of Modified Earliest Decoding. We simulate the performance of the method in comparison with Earliest Decoding in networks that implement random linear network coding. We show that Modified Earliest Decoding has a smaller decoding complexity than Earliest Decoding and Gaussian Elimination as well as a smaller decoding delay.

关键词： Earliest Decoding Gaussian Elimination decoding network coding random linear network coding

来源：评论

学校读者我要写书评

暂无评论

random linear network coding for 5G Mobile Video Delivery

引用

INFORMATION 2018年第4期9卷 72页

作者： Vukobratovic, Dejan Tassi, Andrea Delic, Savo Khirallah, Chadi Univ Novi Sad Fac Tech Sci Novi Sad 21000 Serbia Univ Bristol Dept Elect & Elect Engn Bristol BS8 1TH Avon England Univ Edinburgh Sch Engn Edinburgh EH8 9YL Midlothian Scotland

An exponential increase in mobile video delivery will continue with the demand for higher resolution, multi-view and large-scale multicast video services. Novel fifth generation (5G) 3GPP New Radio (NR) standard will bring a number of new opportunities for optimizing video delivery across both 5G core and radio access networks. One of the promising approaches for video quality adaptation, throughput enhancement and erasure protection is the use of packet-level random linear network coding (RLNC). In this review paper, we discuss the integration of RLNC into the 5G NR standard, building upon the ideas and opportunities identified in 4G LTE. We explicitly identify and discuss in detail novel 5G NR features that provide support for RLNC-based video delivery in 5G, thus pointing out to the promising avenues for future research.

关键词： random linear network coding mobile cellular networks 4G long-term evolution (LTE) 5G New Radio (NR) mobile video delivery

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：