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

random linear network coding for Wireless Layered Video Broadcast: General Design Methods for Adaptive Feedback-Free Transmission

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2017年第2期65卷 790-805页

作者： Esmaeilzadeh, Mohammad Sadeghi, Parastoo Aboutorab, Neda Australian Natl Univ Res Sch Engn Canberra ACT 2601 Australia Univ New South Wales Sch Engn & Informat Technol Canberra ACT 2612 Australia

This paper studies the problem of broadcasting layered video streams over heterogeneous single-hop wireless networks using feedback-free random linear network coding (RLNC). We combine RLNC with unequal error protection (UEP) and our main purpose is twofold: to systematically investigate the benefits of UEP+RLNC layered approach in servicing users with different reception capabilities and to study the effect of not using feedback, by comparing feedback-free schemes with idealistic full-feedback schemes. To these ends, we study "expected percentage of decoded frames" as a key content-independent performance metric and propose a general framework for calculation of this metric, which can highlight the effect of key system, video, and channel parameters. We study the effect of number of layers and propose a scheme that selects the optimum number of layers adaptively to achieve the highest performance. Assessing the proposed schemes with real H.264 test streams, the trade-offs among the users' performances are discussed and the gain of adaptive selection of number of layers to improve the trade-offs is shown. Furthermore, it is observed that the performance gap between the proposed feedback-free scheme and the idealistic scheme is very small and the adaptive selection of number of video layers further closes the gap.

关键词： random linear network coding layered video streaming wireless broadcast

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

random linear network coding based physical layer security for relay-aided device-to-device communication

引用

IET COMMUNICATIONS 2020年第7期14卷 1155-1161页

作者： Khan, Amjad Saeed Chatzigeorgiou, Ioannis Zheng, Gan Basutli, Bokamoso Chuma, Joseph M. Lambotharan, Sangarapillai Loughborough Univ Sch Mech Elect & Mfg Engn Loughborough LE11 3TU Leics England Univ Lancaster Sch Comp & Commun Lancaster LA1 4YW England Botswana Int Univ Sci & Technol Elect Comp & Telecommun Engn Palapye Botswana

The authors investigate physical layer security design, which employs a random linear network coding with opportunistic relaying and jamming to exploit the secrecy benefit of both source and relay transmissions. The proposed scheme requires the source to transmit artificial noise along with a confidential message. Moreover, in order to further improve the dynamical behaviour of the network against an eavesdropping attack, aggregated power controlled transmissions with optimal power allocation strategy is considered. The network security is accurately characterised by the probability that the eavesdropper will manage to intercept a sufficient number of coded packets to partially or fully recover the confidential message.

关键词： probability telecommunication security network coding jamming radio networks relay networks (telecommunication) wireless channels power control random linear network coding relay-aided device-to-device communication physical layer security design opportunistic relaying relay transmissions confidential message aggregated power controlled transmissions network security coded packets

来源：评论

学校读者我要写书评

暂无评论

random linear network coding on Programmable Switches

Random Linear Network Coding on Programmable Switches

引用

ACM/IEEE Symposium on Architectures for networking and Communications Systems (ANCS)

作者： Goncalves, Diogo Signorello, Salvatore Ramos, Fernando M. V. Medard, Muriel Univ Lisbon Fac Ciencias LASIGE Lisbon Portugal MIT Res Lab Elect 77 Massachusetts Ave Cambridge MA 02139 USA

ISBN: (纸本)9781728143873

By extending the traditional store-and-forward mechanism, network coding has the capability to improve a network's throughput, robustness, and security. Given the fundamentally different packet processing required by this new paradigm and the inflexibility of hardware, existing solutions are based on software. As a result, they have limited performance and scalability, creating a barrier to its wide-spread adoption. By leveraging the recent advances in programmable networking hardware, in this paper we propose a random linear network coding data plane written in P4, as a first step towards a production-level platform. Our solution includes the ability to combine the payload of multiple packets and of executing the required Galois field operations, and shows promise to be practical even under the strict memory and processing constraints of switching hardware.

关键词： network coding random linear network coding Programmable Switches P4

来源：评论

学校读者我要写书评

暂无评论

random linear network coding over Compute-and-Forward in Multi-Source Multi-Relay networks 13

Random Linear Network Coding over Compute-and-Forward in Mul...

引用

13th International Wireless Communications and Mobile Computing Conference (IWCMC)

作者： Ngeth, Rithea Kurkoski, Brian M. Lim, Yuto Tan, Yasuo Japan Adv Inst Sci & Technol Sch Informat Sci Nomi Ishikawa Japan

ISBN: (纸本)9781509043729

This paper proposes a transmission scheme which applies random linear network coding (RLNC) over compute-and-forward (CF), called RLNC/CF, in multi-source multi-relay networks. Instead of solving the full rank failure at relays, this paper compensates for this overhead to increase the possibility of successfully decoding computed messages at the destination. The concept of the overlapped generations is applied with a proposed computing and storing strategy. This paper provides a compensation based on the estimation of the channel state information (CSI) of the previous generation and a compensation based on the learning data of CSI. By comparing to an orthogonal channel transmission scheme, a performance trade-off is considered. An expression for estimated performances of RLNC/CF in function of the probabilities of the parameters related to CSI is provided to help for the decision of selecting transmission scheme. From the numerical result, RLNC/CF scheme works better than a conventional CF transmission scheme in reducing the transmission latency.

关键词： random linear network coding compute-and-forward nested lattice code multi-source multi-relay rank deficiency

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Efficient practical Byzantine consensus using random linear network coding

引用

ANNALS OF TELECOMMUNICATIONS 2023年第1-2期78卷 33-51页

作者： Braun, Michael Wiesmaier, Alexander Alnahawi, Nouri Univ Appl Sci Fac Comp Sci Darmstadt Germany

Using random linear network coding (RLNC) in asynchronous networks with one-to-many information flow has already been proven to be a valid approach to maximize the channel capacities. Message-based consensus protocols such as practical Byzantine fault tolerance (pBFT) adhere partially to said scenario. Protocol phases with many-to-many communication, however, still suffer from quadratic growth in the number of required transmissions to reach consensus. We show that an enhancement in the data transmission behavior in the quadratic phases is possible through combining RLNC with pBFT as one hybrid protocol. We present several experiments conducted on random network topologies. We conclude that using RLNC-based data transmission offers a significantly better performance under specific circumstances, which depend on the number of participating network nodes and the chosen coding parameters. Applying the same approach to other combinations of message-based consensus and network coding protocols promises not only a gain in performance, but may also improve robustness and security and open up new application scenarios for RLNC, e.g., running it on the application layer.

关键词： Broadcast network communication random linear network coding Data transmission performance Message-based consensus Practical Byzantine fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Performance Improvement of Kotter and Kschischang Codes and Lifted Rank Metric Codes in random linear network coding

引用

MOBILE networkS & APPLICATIONS 2023年第1期28卷 168-177页

作者： Guefrachi, Aicha Nighaoui, Sarra Zaibi, Sonia Bouallegue, Ammar Tunis El Manar Univ Natl Engn Sch Tunis Commun Syst Lab Tunis 1002 Tunisia

Future networks require low latency communications which can be achieved using network coding. While random linear network coding is an effective technique for disseminating information in networks, it is highly sensitive to error propagation. Classical error correction codes are therefore inadequate to solve the problem, which requires new techniques. Recently, Kotter and Kschischang (KK) codes, have been proposed for error control in non-coherent random linear network coding. These codes can also be constructed from the lifting of rank metric codes (LRMC) as Gabidulin codes. In this paper, we first propose a novel coding scheme in mesh networks to improve the performance of KK and LRMC codes in random linear network coding, using cyclic redundancy check (CRC) codes to prevent error propagation. Then, we give a performance evaluation and comparison between KK and LRMC codes in terms of Packet Error Rate (PER) without and with error detection. Simulation results show that a significant performance improvement in terms of PER is achieved using our proposed scheme.

关键词： Performance evaluation random linear network coding network error correction Kotter and Kschischang codes Lifted rank metric codes CRC codes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：