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

Copyright Protection Scheme for Information-Centric networking Base on the linear network coding 35

第35届中国控制会议

作者： TAN Xiaobin JI Liguo ZHOU Zifei YAN Pei Laboratory for Future Networks University of Science and Technology of China

ISBN: (纸本)9781509009107

As a novel network architecture,Information-Centric networking(ICN) has a good performance in security,mobility and *** in-network cache used in ICN can effectively solve the problem of network ***,it also brings a lot of challenges such as copyright *** to prevent unauthorized user access to the large-sized contents of the route has become the focus of the *** of the current solutions are based on the traditional encryption *** these solutions don't applay to *** approaches that rely on a common encryption key among authorized users cannot protect copyright well since if authorized user leaks the private key out,we cannot tell who has leaked the key *** this paper,we use a novel scheme to solve the problem of copyright *** this scheme,we take the method of the network *** first,we have splitted the large-sized content into N *** through linear network coding(LNC) encrypted the content,if the user can not obtain the decrypted matrix,the user will not be able to decrypt the ***,the scheme can achieve the protection of the *** analysis of this program shows that the scheme has a good performance in copyright protection.

关键词： Copyright Protection linear network coding Information-Centric networking

来源：评论

学校读者我要写书评

暂无评论

Implementation of linear network coding on Parallel Architecture

Implementation of Linear Network Coding on Parallel Architec...

引用

3rd UKSim European Symposium on Computer Modeling and Simulation

作者： Rakesh, Nitin Nitin, Nitin Jaypee Univ Informat Technol Dept Comp Sci & Engn & Informat Technol Waknaghat India

ISBN: (纸本)9781424453450

Parallel architectures involves parallel communication with the aim of fast receiving of complete information with higher information rate at each nodes. To reduce the complexity of parallel communication we have considered Multi-Mesh of Trees (MMT) architecture for parallel communication and implemented linear network coding (LNC) on MMT by proposing linear-Code Multicast with Parallel Algorithms (LCM-PA) to achieve max-flow from the source to each receiving nodes. We wish to minimize the communication steps and time complexity involved in transfer of data from processor to processor during parallel communication while achieving the desired throughput in a multicast scenario. We developed a novel distributed parallel network approach, which is enriched by linear coding.

关键词： linear network coding information rate max-flow parallel algorithms cyclic and acyclic delay free networks

来源：评论

学校读者我要写书评

暂无评论

Implementation of linear network coding Over a Flexible Emulator

Implementation of Linear Network Coding Over a Flexible Emul...

引用

作者： Nuno Bettencourt Coelho ISCTE-Instituto Universitario de Lisboa

学位级别：硕士

This dissertation has the main objective of study and implement network coding (NC) techniques in a flexible emulator, programmed in a language that allows the coexistence of entities running parallel code, in order to emulate each node independently. The dissertation starts with the study of NC's concept and with the characterization of the different type of coding methods, with a focus on linear network coding (LNC).. A flexible Java emulator (named Net Genius) was developed, which not only allows numerous topologies of networks, but also different types of coding. In addition, the emulator allows to emulate the networks in two different modes: with a distributed network or with a centralized network. In order to present the differences between the LNC approach and the traditional approach used in packet networks (based in routing tables), the emulator allows the user to choose between these two types of approach, assessing the impact of having network coding over user-defined networks. When implementing LNC, the concept of generations of packets was introduced in order to avoid combining packets from different sources. Leveraging on this, the transfer matrix at each node is calculated based on the coded packets and not based on the information stored in each node. In addition to this, a mechanism to code packets at the source was implemented, as well as a mechanism to introduce errors in the connection links. This allowed to emulate networks with different link error probabilities, in order to assess the resilience of the different approaches to the presence of failures.

关键词： linear network coding Node Protection Java Emulation Software-Defined networks

来源：评论

学校读者我要写书评

暂无评论

Analysis of the Effect of Binary OR Operation Property in linear network coding Transmission Performance

引用

IETE JOURNAL OF RESEARCH 2016年第2期62卷 164-178页

作者： Alabady, Salah A. Salleh, M. F. M. Univ Sains Malaysia Sch Elect & Elect Engn George Town Malaysia

In all of the works related to linear network coding (LNC), researchers use the Galois field (GF) operation property to generate the coding matrix elements. The elements of the coding matrix produced from the coefficients are randomly generated and selected from the GF(q). In this paper, we present an analytical analysis on the effect of using the binary field (OR operation) property to generate the coding matrix elements in LNC instead of using the customary GF. The LNC with binary OR operation (LNC_OR) is simulated under various multihop wireless network conditions of coefficients and coding router for three different network topologies. Each of the three network topologies has different coefficients since different network coding router is used. Performances of the LNC with the different probability of the coefficients of coding matrix base on packet delivery ratio (PDR) are analysed. Simulation results for three different network topologies confirm that LNC_OR reduces the number of lost packets received and improves PDR performance as compared to LNC with GF (LNC_GF) operation property.

关键词： linear network coding multi hop wireless network network coding wireless network coding

来源：评论

学校读者我要写书评

暂无评论

The Average Failure Probabilities of Random linear network coding

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2011年第10期E94A卷 1991-2001页

作者： Guang, Xuan Fu, Fang-Wei Nankai Univ Chem Inst Math Tianjin 300071 Peoples R China Nankai Univ LPMC Tianjin 300071 Peoples R China

In network coding, for the case that the network topology is unknown completely, random linear network coding has been proposed as an acceptable coding technique. In this paper, we define average failure probability of random linear network coding in order to characterize the performance of random network coding, and then analyze this failure probability for different known topological information of network. We obtain several upper bounds on the failure probabilities, and further show that, for some networks, these upper bounds are tight or asymptotically tight. Moreover, if the more topological information of the network is utilized, the better upper bounds are acquired.

关键词： network coding linear network coding random network coding performance analysis average failure probability upper bounds

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Light-Weight linear network coding Cipher Model Based on Cloud Computing for Collaborative Wireless Sensor networks

引用

JOURNAL OF INTERNET TECHNOLOGY 2015年第5期16卷 923-931页

作者： Lin, Haifeng Bai, Di Jiang, Anna Liu, Yunfei Nanjing Forestry Univ Sch Informat Sci & Technol Nanjing Peoples R China Nanjing Agr Univ Coll Engn Dept Management Syst Nanjing Peoples R China Nanjing Forestry Univ Sch Informat Sci & Technol Dept Comp Sci Nanjing Peoples R China

A collaborative wireless sensor network can be particularly vulnerable to cloud security attacks lacking physical boundaries to the environment and also has constrained energy reserves. In this paper, we look at linear network coding protocols and cloud computing optimizations which can have significant reduce the overall energy dissipation of collaborative wireless sensor networks and provide a paradigm to enable convenient and on-demand network access to a shared pool of configurable computing resources. Based on our findings that the conventional encryption protocols of public key algorithm and symmetric key algorithm may not be optimal for collaborative wireless sensor networks, we propose LWLNC (Light-Weight linear network coding), a fundamental arithmetic instruction that utilizes randomized rotation of coefficients to achieve cloud computing optimization. LWLNC incorporates data fusion into the transmission which can reduce the amount of energy dissipation. Simulation results show that LWLNC can achieve as much as a factor of 8 reduction in energy consumption compared with conventional encryption protocols. In addition, LWLNC is able to distribute energy dissipation evenly throughout the sensors, doubling the useful system lifetime for the networks we simulated.

关键词： Collaborative wireless sensor network linear network coding network security Energy efficient Cloud computing

来源：评论

学校读者我要写书评

暂无评论

A Reliable Broadcast Transmission Approach Based on Random linear network coding

A Reliable Broadcast Transmission Approach Based on Random L...

引用

IEEE Vehicular Technology Conference

作者： Hongkun Xi Xiaoxiang Wang Yuan Zhao Hongtao Zhang Key Laboratory of Universal Wireless Communications Ministry of Education Beijing University of Posts and Telecommunications 100876 Beijing P.R.China

ISBN: (纸本)9781467309899

Recently, XOR-based network coding has been demonstrated as an effective approach to improve the network performance for wireless broadcast. In this way, the source XOR multiple lost packets from different receivers into one packet and retransmits it, then multiple receivers are able to recover their lost packets, which can effectively reduce the number of retransmissions and utilize wireless bandwidth. However, to find the optimal XOR coding set that minimizes the total number of transmissions has been proved as NP-hard and of high complexity. In this paper, we proposed a new wireless broadcast retransmission scheme based on linear random network coding, in which the source code combines all lost packets to a single one by linear network coding for retransmission, and receivers are able to decode the original packets by method of Gaussian elimination when they receive enough coded-packets. Simulation results are given to demonstrate superior performance of our algorithm over previously proposed works.

关键词： wireless broadcasting retransmission linear network coding network coding linear networks RETRANSMISSION network coding Packet Source code Transmission of broadcasts wireless Multiple Receiver Gaussian elimination Receivers exclusive OR Nondeterministic polynomial-time hard

来源：评论

学校读者我要写书评

暂无评论

Optimal Rate Allocation and linear network coding Design for Secure Multicast with Multiple Streams

Optimal Rate Allocation and Linear Network Coding Design for...

引用

IEEE International Conference on High Performance Computing and Communications

作者： Zhengqing Wen Jin Wang Kejie Lu Jingya Zhou Zhenguo Gao Yanqin Zhu Department of Computer Science and Technology Soochow University Department of Electrical and Computer Engineering University of Puerto Rico at Mayagüez College of Automation Harbin Engineering University

ISBN: (纸本)9781509042982

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.

关键词： throughput linear network coding multiple multicasts weakly secure

来源：评论

学校读者我要写书评

暂无评论

Rank Deficient Decoding of linear network coding

Rank Deficient Decoding of Linear Network Coding

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Zhiyuan Yan Hongmei Xie Bruce W. Suter Department of Electrical and Computer Engineering Lehigh University Bethlehem PA 18015 USA Air Force Research Laboratory Rome NY 13441 USA

ISBN: (纸本)9781479903573

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 decoders linear networks linear programming Packet DEcoding Rank of data full rank Hamming weight Data Accuracy Classes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：