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

4th International Conference on Control, Decision and Information Technologies (CoDIT)

作者： Zamfir, Florin Paraschiv, Nicolae Pricop, Emil Petr Gas Univ Ploiesti Dept Automat Comp & Elect Ploiesti Romania

ISBN: (纸本)9781509064656

the objective of this paper is to test two sceneries of multicast transmissions through the WiMAX network and identify the optimal transmission method. The first method is a simulation of the WiMAX networks in a network simulator (network Simulator 3 - NS3) using the standard NS3 libraries. The second simulation implemented in NS3 as well, contains the code altered in a way that will allow implementing the RLNC (random linear network coding) method.

关键词： WiMAX wireless sensor networks random linear network coding

来源：评论

学校读者我要写书评

暂无评论

Fault-Tolerant and Secure Data Transmission Using random linear network coding 26

Fault-Tolerant and Secure Data Transmission Using Random Lin...

引用

26th International Conference on Computer Communication and networks (ICCCN)

作者： Ostovari, Pouya Wu, Jie Temple Univ Dept Comp & Informat Sci Philadelphia PA 19122 USA

ISBN: (纸本)9781509029914

network coding is a technique used to improve both wired and wireless networks' throughput and provide reliable transmission. In network coding, original data packets can be encoded to an infinite number of coded packets. A subset of these coded packets is sufficient to decode the coded packets and retrieve the original data. In addition to providing reliable data transmission, network coding can be used as a lightweight security mechanism to protect data against eavesdroppers. An eavesdropper is not able to decode coded packets and retrieve original data unless it has access to a sufficient number of coded packets. In a data transmission application, transmitting more redundant packets increases the chance of delivering a sufficient number of coded packets to the destination. As a result, this increases the reliability of the data transmission. However, more redundant transmissions make the system more vulnerable to eavesdropper attacks because there is a higher chance that an eavesdropper will receive enough coded packets. In this work, we study network coding to provide reliable and secure data transmission schemes by performing a trade-off between the security and reliability of the data transmission. We formulate the problem as a mixed integer and linear programming problem, and we propose a linear programming approximation to solve it. We study the performance of our proposed methods through extensive simulations.

关键词： network coding security fault tolerance uni-cast eavesdropping optimization random linear network coding

来源：评论

学校读者我要写书评

暂无评论

PPNC: Privacy Preserving Scheme for random linear network coding in Smart Grid

引用

KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS 2017年第3期11卷 1510-1532页

作者： He, Shiming Zeng, Weini Xie, Kun Yang, Hongming Lai, Mingyong Su, Xin Changsha Univ Sci & Technol Hunan Prov Engn Res Ctr Elect Transportat & Smart Sch Comp & Commun Engn Hunan Prov Key Lab Intelligent Proc Big Data Tran Changsha 410114 Hunan Peoples R China Hunan Police Acad Hunan Prov Key Lab Network Invest Technol Changsha 410138 Hunan Peoples R China China Shipbuilding Ind Corp Res Inst 716 Lianyungang 222061 Peoples R China SUNY Stony Brook Dept Elect & Comp Engn Stony Brook NY 30301 USA

In smart grid, privacy implications to individuals and their families are an important issue because of the fine-grained usage data collection. Wireless communications are utilized by many utility companies to obtain information. network coding is exploited in smart grids, to enhance network performance in terms of throughput, delay, robustness, and energy consumption. However, random linear network coding introduces a new challenge for privacy preserving due to the encoding of data and updating of coefficients in forwarder nodes. We propose a distributed privacy preserving scheme for random linear network coding in smart grid that considers the converged flows character of the smart grid and exploits a homomorphic encryption function to decrease the complexities in the forwarder node. It offers a data confidentiality privacy preserving feature, which can efficiently thwart traffic analysis. The data of the packet is encrypted and the tag of the packet is encrypted by a homomorphic encryption function. The forwarder node random linearly codes the encrypted data and directly processes the cryptotext tags based on the homomorphism feature. Extensive security analysis and performance evaluations demonstrate the validity and efficiency of the proposed scheme.

关键词： Privacy preserving network coding smart grid homomorphic encryption function random linear network coding

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Fault-Tolerant and Secure Data Transmission Using random linear network coding

Fault-Tolerant and Secure Data Transmission Using Random Lin...

引用

International Conference on Computer Communication and networks

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

关键词： network coding security fault tolerance unicast eavesdropping optimization random linear network coding

来源：评论

学校读者我要写书评

暂无评论

An Opportunistic random linear network coding Scheme in Wireless networks 13

An Opportunistic Random Linear Network Coding Scheme in Wire...

引用

13th IEEE Annual Consumer Communications and networking Conference (CCNC)

作者： Park, Sungjin Lee, Howon Lee, In-Ho Cho, Dong-Ho Korea Adv Inst Sci & Technol Dept Elect Engn Daejeon South Korea Hankyong Natl Univ Dept Elect Elect & Control Engn Anseong South Korea Hankyong Natl Univ IITC Anseong South Korea

ISBN: (纸本)9781467392921

In wireless broadcast environments, a system performance can be improved with random linear network coding (RLNC). In RLNC, a source transmits a set of coding coefficients and a coded packet together. The coded packet is a combination of the coding coefficients and uncoded packets. Using the key feature of RLNC, we herein propose a new RLNC scheme to minimize outage probability with a feedback channel. In addition, the outage probability of the proposed scheme is analyzed in a Rayleigh fading channel. Through the numerical analysis and Monte Carlo simulations, we demonstrate that the outage probability of the proposed scheme is lower than that of a conventional RLNC scheme.

关键词： random linear network coding Wireless Broadcast network Outage Probability

来源：评论

学校读者我要写书评

暂无评论

random linear network coding Based on Non-Orthogonal Multiple Access in Wireless networks

引用

IEEE COMMUNICATIONS LETTERS 2015年第7期19卷 1273-1276页

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

To improve the packet success probability, random linear network coding (RLNC) based on non-orthogonal multiple access (NOMA) for multicast services was employed in wireless downlink networks where a source superposes multiple coded packets before transmitting these packets to multiplexing groups of receivers in a power domain. Using a successive interference cancellation (SIC) and a Gauss-Jordan elimination process, receivers can recover their original packets. We derive expressions for the total packet success probability for the case of NOMA (or OMA) with (or without) RLNC, and propose group based power allocation schemes in order to improve performance with a low overhead. Through the results of simulations, we verify our derivations and show that RLNC based on NOMA improves the packet success probability and decreases the packet delay.

关键词： Non-orthogonal multiple access random linear network coding packet success probability multicast

来源：评论

学校读者我要写书评

暂无评论

random linear network coding Based on Outdated Channel-State Information

引用

IEEE COMMUNICATIONS LETTERS 2015年第7期19卷 1129-1132页

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

Scheduling based on random linear network coding is an effective way of improving system performance in a wireless network. In a time-varying channel environment, it is important to take the effects of outdated channel-state information (CSI) into consideration when scheduling because the CSI used may be different from the real CSI for data transmissions due to mobility and feedback delays. Here, we analyze the outage probability for scheduling based on random linear network coding in an outdated CSI environment. Practical scenarios are assessed so that the outage probability performance can be evaluated reliably.

关键词： random linear network coding outdated channel state information outage probability

来源：评论

学校读者我要写书评

暂无评论

Exact Decoding Probability of random linear network coding for Tree networks

引用

KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS 2015年第2期9卷 714-727页

作者： Li, Fang Xie, Min Xidian Univ State Key Lab Integrated Serv Networks ISN Xian 710071 Peoples R China Xidian Univ Sch Telecommun Engn Xian 710071 Peoples R China

The hierarchical structure in networks is widely applied in many practical scenarios especially in some emergency cases. In this paper, we focus on a tree network with and without packet loss where one source sends data to n destinations, through m relay nodes employing random linear network coding (RLNC) over a Galois field in parallel transmission systems. We derive closed-form probability expressions of successful decoding at a destination node and at all destination nodes in this multicast scenario. For the convenience of computing, we also propose an upper bound for the failure probability. We then investigate the impact of the major parameters, i.e., the size of finite fields, the number of internal nodes, the number of sink nodes and the channel failure probability, on the decoding performance with simulation results. In addition, numerical results show that, under a fixed exact decoding probability, the required field size can be minimized. When failure decoding probabilities are given, the operation is simple and its complexity is low in a small finite field.

关键词： network coding tree topology random linear network coding exact decoding probability

来源：评论

学校读者我要写书评

暂无评论

Performance modeling of data transmission by using random linear network coding in DTNs

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2015年第18期28卷 2275-2288页

作者： Qin, Shuang Feng, Gang Univ Elect Sci & Technol China Natl Key Lab Sci & Technol Commun Chengdu 610054 Peoples R China

In Delay Tolerant networks (DTNs), mobile nodes exploit encounter chances to transmit data via the established opportunistic link between encounter nodes. The transmission capacity between two encounter nodes is constrained by the duration of opportunistic links. How to transmit data efficiently is one of the fundamental and most important issues in DTNs. Recently, random linear network coding (RLNC) is proposed as a promising approach to improve data transmission efficiency in DTNs. To facilitate the development of deployment of RLNC based routing protocols, it is imperative to quantify the performance gain brought by RLNC in a rigorous and systematic way. In this paper, we develop an analytical model to evaluate the data transmission performance of RLNC based epidemic routing in DTNs. In the model, we consider that multiple unicast communication sessions compete for limited \capacity. Numerical results validate the effectiveness of our analytical model and demonstrate the significant performance improvement for data transmission in DTNs brought by RLNC. Our work of this paper provides a general tool for performance evaluation and useful guidelines for designing RLNC based routing protocols in DTNs. Copyright (c) 2015 John Wiley & Sons, Ltd.

关键词： Delay Tolerant networks (DTNs) random linear network coding Transmission delay Performance modeling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：