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

IEEE International Symposium on Information Theory (ISIT)

作者： Wang, Chih-Chun Han, Jaemin Purdue Univ Sch Elect & Comp Engn CWSA W Lafayette IN 47907 USA

ISBN: (纸本)9781457705953

random linear network coding (RLNC) is widely used in practical network coding (NC) protocol design. Recent results show that RLNC also plays an important role in capacity-achieving intersession NC schemes for erasure-based 1-hop relay networks. This work quantifies the common information of RLNC over a 1-hop broadcast packet erasure channel. Several potential applications are discussed, including source coding, intersession NC, and broadcasting with common and private information.

关键词： Encoding network coding Polynomials Relays Routing Wireless communication broadcast channels broadcast packet erasure channel capacity achieving intersession common information intersession network coding linear codes network coding network coding protocol design private information random codes random linear network coding wireless channels

来源：评论

学校读者我要写书评

暂无评论

Analysis and Optimization of RLNC-Based Cache Placement in 5G D2D networks

引用

IEEE ACCESS 2018年 6卷 65179-65188页

作者： Lin, Zhijian Wang, Ying Lin, Yujing Wu, Linhuang Chen, Zhifeng Fuzhou Univ Dept Elect & Informat Engn Fuzhou 350000 Fujian Peoples R China Xiamen Univ Dept Commun Engn Xiamen 363200 Peoples R China

Different storage capacities and various file sizes are two crucial factors which impact the effectiveness of cache placement in device-to-device networks. However, most of existing literature assumes all users have homogeneous cache capability and all involved file sizes are identical. In this paper, files are placed into groups according to their different sizes and the storage capacities are various among all the involved user devices. Considering these two vital factors, group caching scheme (GCS) algorithm for the optimal cache strategy is investigated by formulating an optimization problem to maximize the cache hit probability solved by using Karush-Kuhn-Tucker conditions. Furthermore, random linear network codingbased GCS is developed to eliminate the negative impact of file size to cache hit probability due to the observation that the probability of small size files being cached may be higher than that of large size but more popular files. Finally, simulation results show the effectiveness of the proposal which outperforms the existing schemes.

关键词： D2D networks random linear network coding cache memory size file size cache placement

来源：评论

学校读者我要写书评

暂无评论

On the Partial Decoding Delay of Sparse network coding

引用

IEEE COMMUNICATIONS LETTERS 2018年第8期22卷 1668-1671页

作者： Zarei, Amir Pahlevani, Peyman Davoodi, Mansoor Inst Adv Studies Basic Sci Zanjan *** Iran

Sparse network coding (SNC) is a promising technique for reducing the complexity of random linear network coding (RLNC), by selecting a sparse coefficient matrix to code the packets. However, the performance of SNC for the average decoding delay (ADD) of the packets is still unknown. We study the performance of ADD and propose a Markov chain model to analyze this SNC metric. This model provides a lower bound for decoding delay of a generation as well as a lower bound for decoding delay of a portion of a generation. Results show that although RLNC provides a better decoding delay of an entire generation, SNC outperforms RLNC in terms of ADD per packet. Sparsity of the coefficient matrix is a key parameter for ADD per packet to transmit stream data. The proposed model enables us to select the appropriate degree of sparsity based on the required ADD. Numerical results validate that the proposed model would enable a precise evaluation of SNC technique behavior.

关键词： random linear network coding sparse network coding Markov chain model

来源：评论

学校读者我要写书评

暂无评论

An LDPC Approach for Chunked network Codes

引用

IEEE-ACM TRANSACTIONS ON networkING 2018年第1期26卷 605-617页

作者： Tang, Bin Yang, Shenghao Nanjing Univ Natl Key Lab Novel Software Technol Nanjing 210023 Jiangsu Peoples R China Chinese Univ Hong Kong Sch Sci & Engn Shenzhen 518172 Peoples R China Shenzhen Res Inst Big Data Shenzhen 518172 Peoples R China

Efficient communication through a multi-hop network with packet loss requires random linear network coding schemes with low computation cost and high throughput. In this paper, we propose a low-density parity-check (LDPC)-based framework for constructing chunked code, a variation of random linear network code with low encoding/decoding computational cost and small coefficient vector overhead. Two classes of chunked codes with LDPC structures, named uniform LDPC-chunked codes and overlapped LDPC-chunked (OLC) codes, are studied under a general chunk transfer matrix model. ULC codes achieve rates close to the optimum and perform better than existing chunked codes that employ parity-check constraints. OLC codes are overlapped chunked codes, where it is not necessary to generate new packets for encoding, and demonstrate much higher rates in certain scenarios than the state-of-the-art designs of overlapped chunked codes. These results justifies the feasibility of this LDPC approach for communication through multi-hop networks with packet loss.

关键词： random linear network coding chunked network codes LDPC belief-propagation Gaussian-elimination decoding degree-distribution optimization

来源：评论

学校读者我要写书评

暂无评论

Data Exchange in Delay Tolerant networks using Joint Inter- and Intra-Flow network coding 37

Data Exchange in Delay Tolerant Networks using Joint Inter- ...

引用

37th IEEE International Performance Computing and Communications Conference (IPCCC)

作者： Ostovari, Pouya Wu, Jie Jolfaei, Alireza San Jose State Univ Dept Technol San Jose CA 95192 USA Temple Univ Dept Comp & Inf Sci Philadelphia PA 19122 USA Federat Univ Australia Sch Sci Engn & Inf Technol Mt Helen Australia

ISBN: (纸本)9781538668085

Data transmission in delay tolerant networks (DTNs) is a challenging problem due to the lack of continuous network connectivity and nondeterministic mobility of the nodes. Epidemic routing and spray-and-wait methods are two popular mechanisms that are proposed for DTNs. In order to reduce the transmission delay in DTNs, some previous works combine intra-flow network coding with the routing protocols. In this paper, we propose two routing mechanisms using systematic joint inter- and intra-flow network coding for the purpose of data exchange between the nodes. We discuss the reasons why inter-flow network coding helps to reduce the delivery delay of the packets, and we also analyze the delays related with only using intra-flow coding, and joint inter-and intra-flow coding methods. We empirically show the benefit of joint coding over just intra-flow coding. Based on our simulation, joint coding can reduce the delay up to 40%, compared to only intra-flow coding.

关键词： Data exchange delay tolerant networks inter-flow coding intra-flow coding random linear network coding

来源：评论

学校读者我要写书评

暂无评论

An Improved Protocol Based on Directed Diffusion Routing Protocol with network coding [Poster]

An Improved Protocol Based on Directed Diffusion Routing Pro...

引用

作者： Weixin Huang Linghua Zhang College of Telecommunication & Information Engineering NJUPT Jiangsu Provincial Engineering Research Center of Telecommunications and Network Technology

The emergence of network coding technology is not too early. This technology emerged in the information field in recent years. It is a data storage technology that combines routing and coding to improve transmission efficiency by additionally encoding data at intermediate nodes[1]. This kind of new technology is able to enhance data throughput, cut down node energy consumption, and achieve energy balance by utilizing the inherent spatial diversity and data redundancy features of WSN. Routing protocol is an important technology in the design of wireless sensor networks. Aiming at the traditional directed diffusion routing protocol(DD), this paper analyzes the problem that the original protocol costs too much in energy and time, and proposes an efficient and energysaving improved directed diffusion routing protocol NC-DD(network coding-DD). This protocol solves the problem of excessive energy consumption when the node works caused by a improper forwarding strategy in the original protocol. Experiments show that the NC-DD protocol model can effectively enhance data throughput and cut down time and energy overhead

关键词： NC-DD model random linear network coding Interest diffusion Energy consumption

来源：评论

学校读者我要写书评

暂无评论

Application for the random network coding and models for random linear network coding

Application for the random network coding and models for ran...

引用

2011 International Conference on Computer Science and network Technology(2011计算机科学与网络技术国际会议 ICCSNT 2011)

作者： Wei SONG Mengli LI International school Beijing University of Posts and Telecommunications Beijing China

In this paper, first we discuss some basic knowledge about the random network coding, then we introduce the random linear network coding with some simple models. Secondly, we will consider the coding over packets that randomly arrive to a source node for transmission to a single destination. Then, for broadcasting retransmission, any node of multi-nodes requests the retransmission of information packets. This approach always needs large amounts of broadcasting packets. And, at last, we present a queuing model for a random linear coding scheme that adapts to the amount of traffic at the source node.

关键词： random network coding random linear network coding retransmissio model queuing

来源：评论

学校读者我要写书评

暂无评论

network coding in Relay-Based Device-to-Device Communications

引用

IEEE network 2017年第4期31卷 102-107页

作者： Huang, Jun Gharavi, Hamid Yan, Huifang Xing, Cong-Cong NIST Gaithersburg MD 20899 USA Chongqing Univ Posts & Telecommun Chongqing Peoples R China Nicholls State Univ Comp Sci Thibodaux LA 70310 USA

Device-to-device (D2D) communications has been realized as an effective means to improve network throughput, reduce transmission latency, and extend cellular coverage in 5G systems. network coding is a well established technique known for its capability to reduce the number of retransmissions. In this article, we review state-of-the-art network coding in relay-based D2D communications, in terms of application scenarios and network coding techniques. We then apply two representative network coding techniques to dual-hop D2D communications and present an efficient relay node selecting mechanism as a case study. We also outline potential future research directions, according to the current research challenges. Our intention is to provide researchers and practitioners with a comprehensive overview of the current research status in this area and hope that this article may motivate more researchers to participate in developing network coding techniques for different relay-based D2D communications scenarios.

关键词： Device-to-Device network coding random linear network coding relay-based

来源：评论

学校读者我要写书评

暂无评论

Probability of Partially Decoding network-Coded Messages

引用

IEEE COMMUNICATIONS LETTERS 2017年第9期21卷 1945-1948页

作者： Claridge, Jessica Chatzigeorgiou, Ioannis Royal Holloway Univ London Dept Math Egham TW20 0EX Surrey England Univ Lancaster Sch Comp & Commun Lancaster LA1 4WA England

In the literature, there exist analytical expressions for the probability of a receiver decoding a transmitted source message that has been encoded using random linear network coding. In this letter, we look into the probability that the receiver will decode at least a fraction of the source message, and present an exact solution to this problem for both non-systematic and systematic network coding. Based on the derived expressions, we investigate the potential of these two implementations of network coding for information-theoretic secure communication and progressive recovery of data.

关键词： random linear network coding rank-deficient decoding probability analysis information-theoretic security

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of network Coded Cooperative D2D Communications 10

Performance Analysis of Network Coded Cooperative D2D Commun...

引用

10th International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Zhou, Jin Li, Ye Bao, Zhihua Nantong Univ Sch Elect & Informat Nantong Peoples R China

ISBN: (纸本)9781538661192

In this paper, we present an analytical approach to evaluate the performance of network-coded bidirectional deviceto-device (D2D) cooperation communications. We propose an absorbing Markov chain model, where the states are defined as the numbers of useful packets received by the users. Based on that, we calculate the completion time of using the random linear network coding over a Galois field of size q. We verify the model via Monte Carlo simulations and show that the gap between the analysis and simulations is negligible. Through the analysis of the transmission rate using the model, we demonstrate that the framework may help to design the finite field size and the cooperation frequency for the D2D scenarios.

关键词： random linear network coding absorbing Markov chain Galois field

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：