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

Information Freshness and Energy Harvesting Tradeoff in network-Coded Broadcasting

IEEE WIRELESS COMMUNICATIONS LETTERS 2022年第10期11卷 2061-2065页

作者： Ren, Quanjia Chan, Tse-Tin Pan, Haoyuan Ho, Kin-Hon Du, Zhihua Shenzhen Univ Coll Comp Sci & Software Engn Shenzhen 518060 Peoples R China Educ Univ Hong Kong Dept Math & Informat Technol Hong Kong Peoples R China Hang Seng Univ Hong Kong Dept Comp Hong Kong Peoples R China

This letter investigates both information freshness and energy harvesting (EH) in downlink information update systems. Information freshness is characterized by age of information (AoI). We consider a scenario in which a large update message is packetized into K small packets and encoded by random linear network coding (RLNC). A base station continuously broadcasts the RLNC-encoded packets to multiple users until all the users have received the message. When a user successfully receives the update message while at least one other user has not received it yet, the user harvests energy from the received signals. A key challenge is to decide the value of K in the message packetization in order to achieve low AoI and high EH simultaneously. To this end, we conduct a theoretical analysis of the tradeoff between the AoI and EH performance under different values of K. In particular, the packet error rates of short packets in the message packetization are estimated by the short packet theory, and the closed-form AoI and EH formulas are derived. Our numerical results reveal that there exists a K (neither too small nor too large) that can achieve both low AoI and high EH.

关键词： Age of information energy harvesting information freshness random linear network coding

来源：评论

学校读者我要写书评

暂无评论

New constant dimension subspace codes from block inserting constructions

引用

CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES 2022年第1期14卷 87-99页

作者： Lao, Huimin Chen, Hao Tan, Xiaoqing Jinan Univ Coll Cyber Secur Guangzhou 510632 Peoples R China

A basic problem of the constant dimension subspace coding is to determine the maximal possible size A(q)(n,d,k) of a set of k-dimensional subspaces in F-q(n) such that the subspace distance satisfies dis(U,V) = 2k - 2 dim(U boolean AND V) >= d for any two different subspaces U and V in this set. We propose two constructions of constant dimension subspace codes that can insert flexibly into the generalized parallel linkage construction. In our constructions matrix blocks from small constant dimension codes and rank metric codes play important roles. Through a well-arranged combination for the matrix blocks, more than 120 new constant dimension subspace codes of distance 4, 6, 8 better than previously best known codes are constructed.

关键词： Constant dimension codes Inserting construction MRD codes random linear network coding

来源：评论

学校读者我要写书评

暂无评论

Enhancing Robustness and Reliability of networks-on-Chip with network coding 9

Enhancing Robustness and Reliability of Networks-on-Chip wit...

引用

9th IEEE Nordic Circuits and Systems Conference (NorCAS)

作者： Haase, Julian Jaster, Sebastian Franz, Elke Goehringer, Diana Tech Univ Dresden Chair Adapt Dynam Syst Dresden Germany Tech Univ Dresden Chair Privacy & Data Secur Dresden Germany Tech Univ Dresden Ctr Tactile Internet Human In The Loop CeTI Dresden Germany

ISBN: (纸本)9798350337570

Recently, network-on-Chip (NoC) has become the standard for modern communication infrastructures in Multiprocessor System-on-Chip (MPSoC), due to scalability issues in this area. However, such embedded systems are vulnerable to security threats such as the extraction of confidential information and are susceptible to faults. In this paper, we consider malicious routers within the NoC and focus mainly on improving the efficiency, robustness, and reliability of the communication based on a secure communication protocol with authenticated encryption. We use random linear network coding with a generation-based approach, and evaluate its efficiency using PANACA, a cycle-level NoC simulation platform written in SystemC TLM. Finally, we were able to show that the robustness and reliability of the NoC communication was increased up to 10%, even when 8 attackers are present.

关键词： network-on-Chip random linear network coding Security MPSoC Simulation SystemC TLM

来源：评论

学校读者我要写书评

暂无评论

On the Decodability of random linear network coding in Acyclic networks

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2012年第10期E95B卷 3120-3129页

作者： Tarnoi, Saran Kumwilaisak, Wuttipong Saengudomlert, Poompat King Mongkuts Univ Technol Elect & Telecommun Dept Bangkok Thailand Asian Inst Technol Pathum Thani Thailand

This paper presents novel analytical results on the successful decoding probability for random linear network coding in acyclic networks. The results consist of a tight lower bound on the successful decoding probability, its convergence, and its application in constructing a practical algorithm to identify the minimum field size for random linear network coding subject to a target on the successful decoding probability. From the two characterizations of random linear network coding, namely the set of local encoding kernels and the set of global encoding kernels, we first show that choosing randomly and uniformly the coefficients of the local encoding kernels results in uniform and independent coefficients for the global encoding kernels. The set of global encoding kernels for an arbitrary destination is thus a random matrix whose invertibility is equivalent to decodability. The lower bound on the successful decoding probability is then derived in terms of the probability that this random matrix is non-singular. The derived bound is a function of the field size and the dimension of global encoding kernels. The convergence rates of the bound over these two parameters are provided. Compared to the mathematical expression of the exact probability, the derived bound provides a more compact expression and is close to the exact value. As a benefit of the bound, we construct a practical algorithm to identify the minimum field size in order to achieve a target on the successful decoding probability. Simulation and numerical results verify the validity of the derived bound as well as its higher precision than previously established bounds.

关键词： random linear network coding acyclic network decodability rate of convergence

来源：评论

学校读者我要写书评

暂无评论

Endurance network coding for Multi-Hop Wireless Communications

Endurance Network Coding for Multi-Hop Wireless Communicatio...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Bian, Zhuolin Guo, Wangmei Tian, Minhan Xidian Univ Sch Telecommun Engn Xian Peoples R China

ISBN: (纸本)9781665421607;9781665421591

Aiming at the popular wireless multi-hop network, this paper proposes a concise and practical endurance network coding scheme which can nearly reach the capacity of wireless multi-hop network. In this scheme, the source node encodes a group of packets to be sent, the intermediate node expands and forwards the received coded packets by using a causal systematic upper triangular recoding matrix, and the receiver node judges a whole group of packets received and sends feedback to the sender according to whether it is decodable. These operations have three advantages: 1) Increase the probability of first transmission and reducing the number of retransmission;2) The flow transmission and expansion on intermediate nodes ensure low latency and improve reliability respectively;3) Feedback can further increase reliability and throughput. Through analysis and simulation results, we prove that the proposed scheme can achieve a better compromise between throughput and packet delay. Furthermore, the transmission scheme can be compatible with a variety of existing coding methods to ensure the above performance of throughput and delay while maintaining their respective advantages.

关键词： wireless multi-hop communication network coding network error correction random linear network coding batched sparse code

来源：评论

学校读者我要写书评

暂无评论

MODIFIED EARLIEST DEcoding IN networkS THAT IMPLEMENT random linear network coding

引用

SAIEE AFRICA RESEARCH JOURNAL 2012年第4期103卷 165-171页

作者： von Solms, S. Helberg, A. S. J. North West Univ Sch Elect Elect & Comp Engn Potchefstroom Campus Potchefstroom South Africa

In this paper we present a formalised description of Modified Earliest Decoding. We simulate the performance of the method in comparison with Earliest Decoding in networks that implement random linear network coding. We show that Modified Earliest Decoding has a smaller decoding complexity than Earliest Decoding and Gaussian Elimination as well as a smaller decoding delay.

关键词： Earliest Decoding Gaussian Elimination decoding network coding random linear network coding

来源：评论

学校读者我要写书评

暂无评论

Improving the Decoding Speed of Packet Recovery in network coding

引用

IEEE COMMUNICATIONS LETTERS 2021年第2期25卷 351-355页

作者： Nazari, Hosein K. Ghassabi, Kiana Pahlevani, Peyman Lucani, Daniel Inst Adv Studies Basic Sci Dept Comp Sci & Informat Technol Zanjan *** Iran Aarhus Univ Dept Engn DK-8000 Aarhus Denmark

The reliability of communication channels is one of the most challenging tasks in wireless communication. network coding (NC) has emerged as a compelling solution to improve throughput performance and reliability by sending coded packets and accepting valid ones at the receiver. Discarding corrupted coded packets in NC often meant discarding potentially useful information. Thus, using forward error correction (FEC) in each coded packet makes the corrupted packets useful at the receiver. In this letter, we propose a fast decoding algorithm for packet recovery in NC (F-PRNC) using an algebraic consistency between the coded packets to detect their possible corrupted parts. We provided a complexity analysis of the F-PRNC and compared it with partial packet recovery schemes such as DAPRAC and S-PRAC. Our simulation result shows that F-PRNC exceeds both methods in a variety of conditions.

关键词： Decoding network coding Receivers Forward error correction Complexity theory Encoding Integrated circuits network coding forward error correction random linear network coding algebraic consistency rule

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

International Conference on Computer Science and network Technology (ICCSNT)

作者： Song, Wei Li, Mengli Beijing Univ Posts & Telecommun Int Sch Beijing 100088 Peoples R China

ISBN: (纸本)9781457715846

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

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT KOTTER-KSCHISCHANG DECODER ARCHITECTURES FOR NONCOHERENT ERROR CONTROL IN random linear network coding

EFFICIENT KOTTER-KSCHISCHANG DECODER ARCHITECTURES FOR NONCO...

引用

IEEE Workshop on Signal Processing Systems (SiPS)

作者： Lin, Jun Xie, Hongmei Yan, Zhiyuan Dept Elect & Comp Engn Bethlehem PA 18015 USA

ISBN: (纸本)9780769548562;9781467329866

Kotter-Kschischang (KK) codes are an important family of constant-dimension codes that provide error control in random linear network coding. Two decoding algorithms have been proposed for KK codes: a rank metric decoder and an interpolation based list decoder. Since hardware implementation of the former suffers from limited throughput, long latency and high area complexity, in this paper we propose efficient hardware implementations of the interpolation based list decoder. The decoder architectures in this paper are based on a generalized interpolation algorithm, which has a lower complexity than Gaussian elimination used by rank metric decoder architectures. We also propose a reformulated right division algorithm that is suitable for hardware implementation. Moreover, a serial architecture and an unfolded architecture are proposed for applications with moderate and high throughputs, respectively. The synthesis results show that the proposed architectures are much more efficient than rank metric decoder architectures.

关键词： Kotter-Kschischang (KK) codes random linear network coding linearized polynomial interpolation

来源：评论

学校读者我要写书评

暂无评论

Sliding Window RLNC on Multi-Hop Communication for Low Latency 93

Sliding Window RLNC on Multi-Hop Communication for Low Laten...

引用

IEEE 93rd Vehicular Technology Conference (VTC-Spring)

作者： Tasdemir, Elif Cabrera, Juan A. Gabriel, Frank You, Dongho Fitzek, Frank H. P. Tech Univ Dresden Deutsch Telekom Chair Commun Networks D-01062 Dresden Germany Tech Univ Dresden Ctr Tactile Internet Human Loop CeTI D-01062 Dresden Germany

ISBN: (纸本)9781728189642

random linear network coding (RLNC) has been proven to improve the performances of Internet of Things (IoT) devices, such as throughput and resilience. However, for latency-sensitive applications, sliding window RLNC (SWNC) outperforms the block-based RLNC because it allows instantaneous packet decodeability and reduces the in-order delay. However, most conventional SWNC approaches have been applied to single-hop communication networks since recoding at intermediate nodes destroy the properties of the coding windows. In this work, we consider multi-hop communication networks and propose SWNC-based recoding algorithms that can be applied at intermediate nodes. The simulation results show that the proposed recoding algorithms outperform block-based RLNC by 53% in terms of the per-packet delay performance.

关键词： sliding window multi-hop wireless communication random linear network coding packet in order delay

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：