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

2012 4th International Conference on Intelligent networking and Collaborative Systems, INCoS 2012

作者： Ji, Yancheng Zhang, Guoan Zhang, Xiaoge Huang, Xun School of Electronics and Information Nantong University Nantong China

ISBN: (纸本)9780769548081

To improve the resource utilization of traditional two-way wireless relay system, an optimal power allocation (OPA) algorithm for a space-time cooperative network coding scheme employing amplify-and-forward protocol (AF-ST-CNC) is proposed. The system performance in terms of outage probability and its approximation in high signal-to-noise (SNR) regimes are first derived, and by minimizing the larger outage probability of the two sources with respect to the characteristic of network coding, optimal power factors are obtained for some special cases are presented. The proposed algorithm only needs the average channel gain information and has low computation complexity, which facilitates the practical implementation. Simulation results show that the proposed AF-ST-CNC with OPA algorithm outperforms the AF-ST-CNC with equal power allocation (EPA) algorithm and the space-time cooperative network coding scheme employing amplify-and-forward protocol (DF-ST-CNC) with OPA algorithm in terms of outage performance. © 2012 IEEE.

关键词： network coding

来源：评论

学校读者我要写书评

暂无评论

Congestion-Tolerant Framework for IoT Applications

Congestion-Tolerant Framework for IoT Applications

引用

IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems (MASS)

作者： Zygmunt J. Haas Zijing Tian University of Texas at Dallas Richardson TX USA

ISBN: (数字)9781728146010

ISBN: (纸本)9781728146027

We propose an innovative framework to improve communication reliability of IoT sensory traffic, when the network is subject to congestion. The proposed architecture is based on information dispersion and relies on the fact that congestion occurs in space-and time-differing parts of the network. Our approach uses encoding and spreading of data flows across various parts of the network, while ensuring that the original data could be recovered at the destination with sufficient accuracy, even if only parts of the encoded data survive the congestion losses. The encoding is based on spatial use of erasure coding, while the recovery is based on Dictionary-based Compressed Sensing. We term this approach Congestion-Tolerant Framework. Our work is specifically targeted at the paradigm of IoT that promises to provide wide-area sensory connectivity to devices on a massive scale, interconnecting billions of such devices. Our framework is applicable to both, real-time and non-real-time IoT networking paradigms.

关键词： network Congestion Congestion Tolerant Framework Compressed Sensing Erasure coding network coding Internet of Things Image Classification Compressed sensing network Congestion Internet of things Image classification network coding Frameworks coding communication reliability encode data

来源：评论

学校读者我要写书评

暂无评论

An Improved Belief Propagation Decoding of BATS Codes

An Improved Belief Propagation Decoding of BATS Codes

引用

International Conference on Communication Technology (ICCT)

作者： Juan Yang Zhiping Shi Dan-Di Yang Chen-Xi Wang National Key Lab of Sci. and Tech. on Communications UESTC Chengdu China Beijing Electro-Mechanical Engineering Institute Beijing China

In this paper, we propose an improved belief propagation (BP) decoding algorithm for decoding BATS codes. In the traditional BP decoding, the BP decoder decodes the input packets only when the rank equals to the degree of the efficient matrix for a batch. For improving the decoding performance, our proposed scheme exploits the fact that some packets can be decoded even when the rank is smaller than the degree. We decode these packets in the process of calculating the rank of batch, which will not induce extra computational cost. The simulation results show that the decoding performance of our proposed method is better than the traditional BATS codes.

关键词： Decoding Matrix converters Reliability network coding Linear systems Matrices Standardization

来源：评论

学校读者我要写书评

暂无评论

Preference-Aware Caching and Cooperative Coded Multicasting Design for Wireless Backhaul networks

Preference-Aware Caching and Cooperative Coded Multicasting ...

引用

IEEE Global Communications Conference

作者： Aimin Tang Yao Liu Xudong Wang University of Michigan-Shanghai Jiao Tong University Joint Institute Shanghai Jiao Tong University Shanghai China

ISBN: (数字)9781728109626

ISBN: (纸本)9781728109633

The joint considering of caching and coded multicasting can significantly improve caching gain, which has become a promising approach to address the explosive growth of wireless traffic demand. In this paper, the design of caching placement and coded multicasting for wireless backhaul networks is explored under heterogeneous file preferences, where the file preference of each small base station (BS) is assumed to be aware at the macro BS. To address the heterogeneous file preferences, a group-based caching and cooperative coded multicasting scheme is developed in this paper. By utilizing a spectral clustering method, the small BSs are first clustered into different groups with similar file preferences. Moreover, a cooperative caching strategy with symmetric file division is designed for each group, where the suboptimal caching proportion of the most popular files is achieved by an approximation analysis. By utilizing the group-based caching structure, an efficient greedy-based two-level cooperative coded multicasting algorithm is then developed. The proposed algorithm not only utilizes the coded multicasting opportunities within each group but also explores the cooperative coding opportunities among groups. The effectiveness of our proposed scheme is verified by simulation results, which show that our proposed scheme can significantly reduce the traffic load compared to the existing schemes.

关键词： Multicast communication Wireless communication network coding Cooperative caching Encoding Servers Explosives

来源：评论

学校读者我要写书评

暂无评论

Node importance to community based caching strategy for information centric networking

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2019年第21期31卷

作者： Shan, Chun Cai, Jun Liu, Yan Luo, JianZhen Guangdong Polytech Normal Univ Sch Elect & Informat Guangzhou 510665 Guangdong Peoples R China

Information Centric networking (ICN) is a novel future network architecture that is focusing on content distribution. Its ubiquitous caching schemes can improve network performance. In this paper, we propose a node importance to community based caching scheme with network coding in ICN, which is named as NICNC. For each community, content router makes cache decision depending on its node importance to community to make content cached more reasonable in temporal and spatial distribution. Moreover, by applying network coding into ICN, one coded blocks containing information of multiple chunks can satisfy multiple interests for different chunks sent by different consumers. This can significantly enhance cache diversity and cache hit rate without increasing cache capacity. Experimental results show that our scheme can improve the network performance at many aspects, such as average download time, cache hit rate, and instantaneous hop reduction rate.

关键词： caching information centric networking network coding node importance to community

来源：评论

学校读者我要写书评

暂无评论

Combining subspace codes

arXiv

引用

arXiv 2019年

作者： Cossidente, Antonio Kurz, Sascha Marino, Giuseppe Pavese, Francesco Dipartimento di Matematica Informatica ed Economia Università degli Studi della Basilicata Contrada Macchia Romana Potenza85100 Italy Mathematisches Institut Fakultät für Mathematik Physik und Informatik Universität Bayreuth Bayreuth95440 Germany Dipartimento di Matematica e Applicazioni Renato Caccioppoli Università degli Studi di Napoli Federico II Complesso Universitario di Monte Sant'Angelo Cupa Nuova Cintia 21 Napoli80126 Italy Dipartimento di Meccanica Matematica e Management Politecnico di Bari Via Orabona 4 Bari70125 Italy

In the context of constant-dimension subspace codes, an important problem is to determine the largest possible size Aq(n, d;k) of codes whose codewords are k-subspaces of Fnq with minimum subspace distance d. Here in order to obtain improved constructions, we investigate several approaches to combine subspace codes. This allow us to present improvements on the lower bounds for constant-dimension subspace codes for many parameters, including Aq(10, 4;5), Aq(12, 4;4), Aq(12, 6, 6) and Aq(16, 4;4).MSC Codes Primary 51E20, Secondary 05B25, 94B65 Copyright © 2019, The Authors. All rights reserved.

关键词： network coding

来源：评论

学校读者我要写书评

暂无评论

The Explicit coding Rate Region of Symmetric Multilevel Diversity coding

The Explicit Coding Rate Region of Symmetric Multilevel Dive...

引用

Information Theory and Applications Workshop (ITA)

作者： Guo, Tao Yeung, Raymond W. Chinese Univ Hong Kong Inst Network Coding Hong Kong Peoples R China Chinese Univ Hong Kong Dept Informat Engn Hong Kong Peoples R China CUHK Key Lab Network Coding Key Technol & Applicat Shenzhen Peoples R China CUHK Shenzhen Res Inst Shenzhen Peoples R China

ISBN: (纸本)9781728101248

It is well known that superposition coding, namely separately encoding the independent sources, is optimal for symmetric multilevel diversity coding (SMDC) (Yeung-Zhang 1999). However, the characterization of the coding rate region therein involves uncountably many linear inequalities and the constant term (i.e., the lower bound) in each inequality is given in terms of the solution of a linear optimization problem. Thus this implicit characterization of the coding rate region does not enable the determination of the achievability of a given rate tuple. In this paper, we first obtain closed-form expressions of these uncountably many inequalities. Then we identify a finite subset of inequalities that is sufficient for characterizing the coding rate region. This gives an explicit characterization of the coding rate region. We further show by the symmetry of the problem that only a much smaller subset of this finite set of inequalities needs to be verified in determining the achievability of a given rate tuple. Yet, the cardinality of this smaller set grows at least exponentially fast with L.

关键词： Symmetric multilevel diversity coding superposition coding network coding closed-form distributed data storage robust network communication

来源：评论

学校读者我要写书评

暂无评论

Line networks with erasure codes and network coding

Line networks with erasure codes and network coding

引用

作者： Song, Yang University of Victoria

学位级别：master

Wireless sensor network plays a significant role inthe design of future Smart Grid, mainly for the purpose ofenvironment monitoring, data acquisition and remote *** deployed on the utility poles on the power transmissionline are used to collect environment information and send them tothe substations for analysis and management. However, thetransmission is suffered from erasures and errors along thetransmission channels. In this thesis, we consider a line networkmodel proposed in [1] and [2]. We first analyze several differenterasure codes in terms of overhead and encoding/decoding costs,followed by proposing two different coding schemes for our linenetwork. To deal with both erasures and errors, we combine theerasure codes and the traditional error control codes, where an RScode is used as an outer codes in addition to the erasure ***, an adaptive RS coding scheme is proposed to improvethe overall coding efficiency over all SNR regions. In the end, weapply network coding with error correction of network errors anderasures and examine our model from the mathematicalperspective.%%%%Graduate

关键词： Smart Grid Line networks Erasure Codes network coding Wireless Sensor network

来源：评论

学校读者我要写书评

暂无评论

A Relation Between network Computation and Functional Index coding Problems

A Relation Between Network Computation and Functional Index ...

引用

IEEE Information Theory Workshop (ITW)

作者： Gupta, Anindya Rajan, B. Sundar Indian Inst Sci Dept Elect Commun Engn Bengaluru 560012 Karnataka India

ISBN: (纸本)9781509010905

In contrast to the network coding problem wherein the sinks in a network demand subsets of the source messages, in a network computation problem the sinks demand functions of the source messages. Similarly, in the functional index coding problem, the side information and demands of the clients include disjoint sets of functions of the information messages held by the transmitter instead of disjoint subsets of the messages, as is the case in the conventional index coding problem. It is known that any network coding problem can be transformed into an index coding problem and vice versa. In this work, we establish a similar relationship between network computation problems and a class of functional index coding problems, viz., those in which only the demands of the clients include functions of messages. We show that any network computation problem can be converted into a functional index coding problem wherein some clients demand functions of messages and vice versa. We prove that a solution for a network computation problem exists if and only if a functional index code (of a specific length determined by the network computation problem) for a suitably constructed functional index coding problem exists. Next we show that a functional index coding problem admits a solution of a specified length if and only if a suitably constructed network computation problem admits a solution.

关键词： network coding

来源：评论

学校读者我要写书评

暂无评论

Load-balance and coding Awareness Protocol Multicast in Space Information network

Load-balance and Coding Awareness Protocol Multicast in Spac...

引用

IEEE International Conference on Electronic Information and Communication Technology (ICEICT)

作者： Liu, Yi nan Zhu, Mo NVIC Shenyang Aircraft Design & Res Inst Shenyang Peoples R China 65012 PLA Shenyang Peoples R China

ISBN: (纸本)9781509007295

Applications of multicast technology in space information network are increasing year by year. Due to the inherent characteristics of space information network, the existing multicast protocols are difficult to meet the high-quality service requirements and the need for reliability. A coding-aware and load balancing reliable multicast protocol in space information network is proposed. A coding-aware and load balancing routing metric is designed. This paper defines a load balancing factor to measure load status of the node and the Expected Transmission Time with coding to measure the coding gain. A new route metric ECTTL (Expected Transmission Time with coding and Load balancing) which combines the two factors is designed to select the high throughput path routes. It not only has the potential coding opportunity but is also able to prevent routing node overflows due to overload. In route establishment process, according to different business needs, it is preferable to use ECTTL metric to build multipath multicast tree and network coding method to encode the data for transmission. The coding-aware load balancing and reliable multicast protocol LCRM is simulated and analyzed in NS-2 simulation platform, The results showed that the design of coding-aware load balancing and reliable multicast protocol LCRM had good performance in reducing the end-to-end delay, routing overhead and improving the network throughput.

关键词： space information network reliable multicast network coding load balancing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：