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

International Conference on COMmunication Systems and NETworkS (COMSNETS)

作者： Pal, Rudrashish Indian Inst Technol Dept Elect Engn & Comp Sci Bhilai 492015 India

ISBN: (数字)9781728131870

ISBN: (纸本)9781728131870

Today's state of the art blockchains suffer from two major setbacks. The first among these, bootstrapping, is the introduction of new nodes into the peer-to-peer (P2P) network in the presence of adversarial nodes. It is crucial that new nodes are prevented from joining adversarial nodes to protect the integrity of the network. The second challenge that today's blockchains face is that of storage efficiency. Blockchains use replication to store the data (or ledger) among users. Users acting as full nodes need to store the entire ledger. As opposed to replication, coding techniques such as fountain codes can be utilised to create an efficient distributed storage system.

关键词： Blockchains fountain coding Bootstrapping

来源：评论

学校读者我要写书评

暂无评论

Integration of Adaptive Modulation and Channel coding With fountain coding for Packet Radio Systems

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2015年第5期63卷 1510-1521页

作者： Ellis, Jason D. Pursley, Michael B. Clemson Univ Clemson SC 29634 USA

We examine the integration of adaptive modulation and channel coding protocols with fountain coding in a packet radio system. We present three modes of operation for the adaptive transmission system, each of which adapts the channel code in a way that accommodates the fixed-length packets produced by the fountain encoder. Each mode works with the fountain coding system to mitigate the effects of time-varying fading on the radio links and provide high throughput.

关键词： Adaptive channel coding adaptive modulation fountain coding packet radio

来源：评论

学校读者我要写书评

暂无评论

Efficient content delivery through fountain coding in opportunistic information-centric networks

引用

COMPUTER COMMUNICATIONS 2017年 100卷 118-128页

作者： Parisis, George Sourlas, Vasilis Katsaros, Konstantinos V. Chai, Wei Koong Pavlou, George Wakeman, Ian Univ Sussex Sch Engn & Informat Brighton E Sussex England UCL Dept Elect & Elect Engn London England Intracom Telecom SA Athens Greece Bournemouth Univ Dept Comp & Informat Bournemouth Dorset England

Opportunistic networks can increase network capacity, support collaborative downloading of content and offload traffic from a cellular to a cellular-assisted, device-to-device network. They can also support communication and content exchange when the cellular infrastructure is under severe stress and when the network is down or inaccessible. fountain coding has been considered as especially suitable for lossy networks, providing reliable multicast transport without requiring feedback from receivers. It is also ideal for multi-path and multi-source communication that fits exceptionally well with opportunistic networks. In this paper, we propose a content-centric approach for disseminating content in opportunistic networks efficiently and reliably. Our approach is based on Information-Centric Networking (ICN) and employs fountain coding. When tied together, ICN and fountain coding provide a comprehensive solution that overcomes significant limitations of existing approaches. Extensive network simulations indicate that our approach is viable. Cache hit ratio can be increased by up to five times, while the overall network traffic load is reduced by up to four times compared to content dissemination on top of the standard Named Data Networking architecture. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Information-centric networks Opportunistic networks fountain coding In-network caching Multi-source and multi-path content delivery

来源：评论

学校读者我要写书评

暂无评论

Deep reinforcement learning-based fountain coding for concurrent multipath transfer in high-speed railway networks

引用

PEER-TO-PEER NETWORKING AND APPLICATIONS 2022年第6期15卷 2744-2756页

作者： Yu, Chengxiao Quan, Wei Liu, Kang Liu, Mingyuan Xu, Ziheng Zhang, Hongke Beijing Jiaotong Univ Sch Elect & Informat Engn 3 Shangyuancun Beijing 100044 Peoples R China

Concurrent multipath transfer (CMT) has been proved to significantly improve the end-to-end throughput with its multihoming property. However, due to the extremely high unpredictability around high-speed railway (HSR) environment, the receive buffer blocking problem seriously degrades the overall transmission reliability. To address this issue, this paper proposes a learning-based fountain coding for CMT (FC-CMT) scheme to mitigate the negative influence of the path diversity of HSR networks. Specifically, we first formulate a multi-dimensional optimal problem to mitigate receive buffer blocking phenomenon and improve the transmission rate with requirement constrains. Then, we transform the data scheduling and redundancy coding rate problem into a Markov decision process, and propose a deep reinforcement learning (DRL)-based fountain coding algorithm to dynamically adjust data scheduling policy and redundancy coding rate. We conduct the extensive experiments in a P4-based programmable network platform. Experimental results indicate the proposed algorithm mitigates the packet out-of-order problem, and improves the average throughput compared with traditional multipath transmission scheme.

关键词： Concurrent multipath transfer (CMT) fountain coding High-speed railway (HSR) Deep reinforcement learning (DRL)

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous QoS Video Broadcasting with Optimal Joint Layered Video and Digital fountain coding

Heterogeneous QoS Video Broadcasting with Optimal Joint Laye...

引用

IEEE International Conference on Communications (ICC)

作者： Ji, Wen Li, Zhu Chinese Acad Sci Inst Comp Technol Beijing Peoples R China Future Wei Huawei Technol Bridgewater NY USA

ISBN: (纸本)9781612842332

Heterogeneous QoS video broadcast over wireless network is a challenging problem, where the demand for better video quality needs to be reconciled with different display size, channel condition and QoS requirements. In this paper, we present a framework for broadcasting scalable video to heterogeneous mobile users with diverse display devices and different channel conditions, which includes joint spatial-temporal layered video and fountain coding optimization. First, we develop an elastic rate video adaptation method so as to serve mobile users with heterogeneous QoS requirements, which includes a hybrid temporal-spatial quality metric. Joint fountain coding protection is introduced so as to provide adaptive and reliable video streams. Second, we use dynamic programming approach to obtain optimal video layer structure, so as to achieve maximum broadcasting utility. The objective is to achieve maximum overall receiving quality of the heterogeneous QoS users. Experimental results demonstrate the effectiveness of the solution.

关键词： Heterogeneous QoS video broadcasting fountain coding elastic video optimization

来源：评论

学校读者我要写书评

暂无评论

Preliminary Results on the Performance of an Adaptive Protocol for Packet Relay with fountain coding 33

Preliminary Results on the Performance of an Adaptive Protoc...

引用

33rd Annual IEEE Military Communications Conference on Affordable Mission Success - Meeting the Challenge (MILCOM)

作者： Borkotoky, Siddhartha S. Pursley, Michael B. Clemson Univ 303 EIB Clemson SC 29634 USA

ISBN: (纸本)9781479967704

We present our initial findings in the investigation of an adaptive protocol for relaying of information in tactical packet-radio networks. Our protocol employs fountain codes to facilitate a relaying scheme involving two relays for improved throughput. In addition, the protocol adapts the modulation format and error-control code for each packet transmission in response to the time-varying propagation loss in the channel. The adaptation is carried out with the help of simple statistics that can be easily derived from the decoder.

关键词： decoding error correction codes military communication modulation packet radio networks protocols relay networks (telecommunication) statistical analysis adaptive protocol decoder error-control code fountain coding modulation format packet relay packet transmission relaying scheme statistics tactical packet-radio networks time-varying propagation loss Encoding Fading Modulation Protocols Relays Shadow mapping Throughput Error correction codes protocols Packet transmission Shadow mapping relay Military communications Packet radio networks decoders Throughput fading color DEcoding

来源：评论

学校读者我要写书评

暂无评论

fountain-coding-Based Secure Communications Exploiting Outage Prediction and Limited Feedback

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2019年第1期68卷 740-753页

作者： Sun, Li Xu, Hongbin Xi An Jiao Tong Univ Sch Elect & Informat Engn Xian 710049 Shaanxi Peoples R China Xidian Univ State Key Lab Integrated Serv Networks Xian 710071 Shaanxi Peoples R China

This paper develops a fountain-coding-based scheme to secure communications over fading wiretap channels, in which the transmission between the legitimate nodes is overheard by a malicious eavesdropper. The transmitter first splits its message into K source packets and generates a potentially infinite number of fountain-coded packets, each of which is the XOR of distinct source packets chosen according to the channel feedback. Based on the characteristics of fountain-coded transmissions, a sufficient number of independent coded packets have to be successfully received to recover the original source message. Therefore, secrecy is guaranteed if the legitimate receiver can accumulate the required number of coded packets before the eavesdropper does. To realize this, we propose to exploit outage prediction and channel feedback to optimize the fountain encoding procedure. To be more specific, upon the reception of any packet, the receiver predicts the conditional outage probability of the next slot's transmission based on the current channel state and notifies the transmitter to adjust the structure of the fountain code accordingly. In this manner, the encoder design matches well with the time-varying channel conditions of the legitimate link such that the receiver can achieve a high accumulation rate for the fountain packets. Meanwhile, because of the mismatch between the fountain encoder and the eavesdropper's channel, it is extremely difficult for the eavesdropper to collect enough independent fountain-coded packets, and transmission secrecy is thus guaranteed. Simulation results demonstrate that the proposed scheme outperforms the existing candidate solutions in terms of the intercept probability, the decoding delay at the legitimate receiver, and the achievable throughput, as well as the quality-of-service violating probability.

关键词： Physical layer security fountain coding outage prediction limited feedback QoS violating probability

来源：评论

学校读者我要写书评

暂无评论

fountain-inspired erasure coding for real-time traffic Performance analysis and simulation

引用

TELECOMMUNICATION SYSTEMS 2011年第1-2期48卷 219-232页

作者： Tirronen, Tuomas Virtamo, Jorma Aalto Univ Dept Commun & Networking Espoo Finland

An erasure correction strategy based on fountain coding is proposed for traffic with real-time requirements. A sliding window marks the range of non-expired data. Each new block entering the window is once sent as such, followed by probabilistically sending a repair packet. The repair packets are formed as a random combination of the blocks in the current window using a degree distribution as in LT coding. The performance of the method with a given channel loss probability is analyzed using a Markov chain model. The state space, however, has to be truncated for computational tractability. The truncation error is verified to be small enough by simulations. By using the analytical model the optimal degree distribution is found to be of single-degree type. The performance of the proposed scheme is compared with deterministic settings, in which repair packets are sent after fixed number of systematic packets. Further comparison is made against Raptor coding, and we note that using the presented strategy can result in better performance in some situations.

关键词： fountain coding Erasure coding Markov chain Real-time traffic Simulation

来源：评论

学校读者我要写书评

暂无评论

Adaptive Capacity-Achieving Channel coding for fountain-Coded Multicast Transmission in Packet Radio Systems

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2013年第12期12卷 6514-6526页

作者： Ellis, Jason D. Pursley, Michael B. Clemson Univ Clemson SC 29634 USA

For time-varying fading, adaptation of the physical-layer channel code greatly enhances the throughput of a multicast transmission system, even if the system employs an application-layer fountain code for packet erasure correction. Performance evaluations for adaptive channel-coding protocols typically require extensive simulations of the fading channel, the iterative decoding process, and the generation of the control information that is used for the adaptation of the channel code. We present a method for the evaluation of such protocols that avoids a substantial amount of the computation required by traditional simulations, and we demonstrate that some important performance measures can be evaluated entirely by analysis. By the use of capacity-achieving channel codes in our investigation, we also decouple the performance of the adaptive coding protocol from the performance of a particular type of channel code and decoding method, which facilitates comparisons among different protocols. The application of our methods is demonstrated for two adaptive channel-coding protocols that are candidates for fountain-coded multicast transmission in packet radio systems.

关键词： Adaptive channel coding fountain coding multicast transmission packet radio

来源：评论

学校读者我要写书评

暂无评论

fountain-Coded Broadcast Distribution in Multiple-Hop Packet Radio Networks

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2019年第1期27卷 29-41页

作者： Borkotoky, Siddhartha S. Pursley, Michael B. Clemson Univ Clemson SC 29634 USA Clemson Univ Elect & Comp Engn Clemson SC 29634 USA

We devise and evaluate five methods for fountain-coded broadcast distribution of a file from a source to multiple destinations in an ad hoc wireless network that consists of half-duplex packet radios. The methods differ in their use of intermediate nodes, their use of forwarding, and their reliance on a network spanning tree. All five methods employ continued fountain coding to prevent nodes from receiving duplicate fountain-coded packets. We derive an analytical approximation for the throughput of fountain-coded broadcast file distribution in a four-node network with time-varying radio links modeled by independent two-state Markov chains, and we show that our approach to fountain-coded file distribution gives throughput that is very close to the approximation. We employ simulations to examine larger networks in which each radio link has correlated Rayleigh fading and the radios use adaptive modulation and channel coding.

关键词： fountain coding packet radio networks wireless ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：