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

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

来源：评论

学校读者我要写书评

暂无评论

An Efficient Polynomial Time Algorithm for Robust Multicast network Code Construction

引用

IEEE COMMUNICATIONS LETTERS 2015年第2期19卷 143-146页

作者： Li, Fang Guo, Wangmei Xidian Univ State Key Lab Integrated Serv Networks ISN Xian 710071 Peoples R China

For a single source multicast network with failed edges, a robust network code is given to achieve the network capacity by coding only at a subset of edges. Our algorithm provides shaper bounds on the required field size when failure patterns are given. The more required coding edges involved in the linear coding operation, the more computation it takes. The number of required coding edges is minimal in minimal multicast networks employing our algorithm.

关键词： network coding random linear network coding efficient algorithm failure probability complexity

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Accelerating Partial Packet Recovery in RLNC

引用

IEEE COMMUNICATIONS LETTERS 2023年第10期27卷 2548-2552页

作者： Gholamian, Vida Nazari, Hosein K. Pahlevani, Peyman Fitzek, Frank H. P. Inst Adv Studies Basic Sci IASBS Dept Comp Sci & Informat Technol Zanjan *** Iran Tech Univ Dresden TUD Deutsch Telekom Chair Commun Networks D-01062 Dresden Germany Aalborg Univ Dept Elect Syst DK-9220 Aalborg Denmark Tech Univ Dresden TUD Cluster Excellence Ctr Tactile Internet Human Inth D-01062 Dresden Germany

network coding (NC) can reduce the number of packet retransmissions and improve network reliability in lossy networks by combining packets in generations and transmitting these coded packets. Although corrupted coded packets are discarded at the receiver, they remain valuable as the majority of their data remains error-free, even in the presence of a noisy channel with a bit error rate range of 10-5. Numerous packet recovery strategies have been proposed to tackle this issue;however, when confronted with excessively noisy channel conditions, their recovery speeds experience a substantial decline. This letter presents a new method called Quick partial packet recovery (QPPR). QPPR exploits the algebraic consistency among coded packets to estimate the erroneous parts of packets and utilizes this estimation with channel condition information to recover packets. Through simulations, we demonstrate that QPPR enhances communication throughput in diverse scenarios, achieving up to a 26.64 percent improvement. Additionally, QPPR effectively reduces communication overhead and delay in very noisy channel conditions, showcasing its potential to elevate overall communication performance.

关键词： Symbols Estimation Bit error rate Decoding Receivers Channel estimation Noise measurement random linear network coding algebraic consistency rule partial packet recovery reliability enhancement

来源：评论

学校读者我要写书评

暂无评论

Selection Precoding for the Finite-Field Multiplicative Matrix Channel

引用

IEEE COMMUNICATIONS LETTERS 2014年第2期18卷 360-363页

作者： Cyran, Michael Fischer, Robert F. H. Huber, Johannes B. Univ Erlangen Nurnberg Lehrstuhl Informat Ubertragung D-91054 Erlangen Germany Univ Ulm Inst Nachrichtentech D-89069 Ulm Germany

The finite-field multiplicative matrix channel is a well suited model for random linear network coding in the absence of packet errors and for lattice-coded MIMO transmission utilizing "integer forcing" receivers or transmitters. In this letter, modulo-type precoding for such channels is proposed. Thereby, the channel is not only equalized but by selecting a suited candidate, desired properties of the transmit symbols can be achieved. The operation of selection precoding is explained and its performance is analyzed and demonstrated.

关键词： Precoding random linear network coding finite-field multiplicative matrix channel modulo congruency

来源：评论

学校读者我要写书评

暂无评论

RLNC-Aided Cooperative Compressed Sensing for Energy Efficient Vital Signal Telemonitoring

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2015年第7期14卷 3685-3699页

作者： Lalos, Aris S. Antonopoulos, Angelos Kartsakli, Elli Di Renzo, Marco Tennina, Stefano Alonso, Luis Verikoukis, Christos Tech Univ Catalonia UPC Dept Signal Theory & Commun TSC Barcelona 08034 Spain CTTC Castelldefels 08860 Spain Univ Paris 11 Paris Saclay Univ Lab Signals & Syst CentraleSupelecCNRSUMR 8506 F-91192 Gif Sur Yvette France WEST Aquila Srl I-67100 Laquila Italy

Wireless body area networks (WBANs) are composed of sensors that either monitor and transmit vital signals or act as relays that forward the received data to a body node coordinator (BNC). In this paper, we introduce an energy efficient vital signal telemonitoring scheme, which exploits compressed sensing (CS) for low-complexity signal compression/reconstruction and distributed cooperation for reliable data transmission to the BNC. More specifically, we introduce a cooperative compressed sensing (CCS) approach, which increases the energy efficiency of WBANs by exploiting the benefits of random linear network coding (RLNC). We study the energy efficiency of RLNC and compare it with the store-and-forward (FW) protocol. Our mathematical analysis shows that the gain introduced by RLNC increases as the link failure rate increases, especially in practical scenarios with a limited number of relays. Furthermore, we propose a reconstruction algorithm that further enhances the benefits of RLNC by exploiting key characteristics of vital signals. With the aid of electrocardiographic (ECG) and electroencephalographic (EEG) data available in medical databases, extensive simulation results are illustrated, which validate our theoretical findings and show that the proposed recovery algorithm increases the energy efficiency of the body sensor nodes by 40% compared to conventional CS-based reconstruction methods.

关键词： random linear network coding compressed sensing WBANs cooperative communications

来源：评论

学校读者我要写书评

暂无评论

Order-Optimal Information Dissemination in MANETs via network coding

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2014年第7期25卷 1841-1851页

作者： Tang, Bin Ye, Baoliu Guo, Song Lu, Sanglu Wu, Dapeng Oliver Nanjing Univ Natl Key Lab Novel Software Technol Nanjing 210046 Jiangsu Peoples R China Univ Aizu Sch Comp Sci & Engn Performance Evaluat Lab Aizu Wakamastu City Fukushima 9658580 Japan Univ Florida Dept Elect & Comp Engn Gainesville FL 32611 USA

Motivated by various applications in mobile ad-hoc networks (MANETs) that require nodes to share their individual information to each other, we study the multi-message dissemination problem in a MANET, which is to distribute multiple messages to all mobile nodes in the network in parallel. The objective is to minimize the stopping time, i.e., the time taking for all nodes to receive a copy of the whole messages. We consider an intrinsically one-sided protocol based on random linear network coding (RLNC), where all packets forwarded are in the form of random linear combinations of packets received so far. Its supreme performance is demonstrated theoretically for two cases, low mobility and high mobility, according to the node velocity. In particular, we show that, under general settings, our derived upper bounds of the stopping time match the established lower bound in both cases, although the effects of mobility in the two cases are significantly different. Thus, we conclude that RLNC achieves order optimality for fast information dissemination in MANETs.

关键词： Information dissemination mobile ad-hoc networks random linear network coding

来源：评论

学校读者我要写书评

暂无评论

Novel compressed linear network coding vectors for multihop communication networks

引用

TELECOMMUNICATION SYSTEMS 2024年第1期86卷 83-101页

作者： Abudaqa, Anas A. Mahmoud, Ashraf S. H. Alsaggaf, Alawi A. Sheltami, Tarek R. King Fahd Univ Petr & Minerals Interdisciplinary Res Ctr Intelligent Secure Syst Dhahran 31261 Eastern Provinc Saudi Arabia King Fahd Univ Petr & Minerals Interdisciplinary Res Ctr Smart Mobil & Logist Dhahran Saudi Arabia King Fahd Univ Petr & Minerals Comp Engn Dept Dhahran Saudi Arabia King Fahd Univ Petr & Minerals Math Sci Dept DCC Dhahran Saudi Arabia

random linear network coding (RLNC) is well-known to provide high throughput and low latency for vast communication networks. However, RLNC often suffers from high coefficients overhead, specifically, when it's applied to limited resource or short-packet networks. Herein, the problem of RLNC coefficients vector overhead is revisited. A novel framework, based on modular arithmetic and prime numbers, and influenced by the Chinese remainder theorem (CRT), is proposed to reduce the coefficients overhead by augmenting only a tiny one item coefficient instead of the entire coefficients vector. The proposed method successfully addresses all the shortcomings of previous methods, including restrictions on generation size and packet density, recoding on intermediate nodes, and creating innovative coding vectors. Theoretical analysis and experimental demonstrate the superior performance of the proposed scheme in terms of coefficients overhead ratio, download time, throughput, and packet drop rate. This evaluation has considered two types of networks: wireless sensors network for Internet of things, and conventional wireline Ethernet.

关键词： network coding random linear network coding Coefficients vector overhead Chinese remainder theorem Compressed coding vector

来源：评论

学校读者我要写书评

暂无评论

Rank-Metric Codes Over Finite Principal Ideal Rings and Applications

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2019年第12期65卷 7718-7735页

作者： Kamche, Hermann Tchatchiem Mouaha, Christophe Univ Yaounde I Dept Math Fac Sci Yaounde Cameroon Univ Yaounde I Dept Math Higher Teacher Training Sch Yaounde Cameroon

In this paper, it is shown that some results in the theory of rank-metric codes over finite fields can be extended to finite commutative principal ideal rings. More precisely, the rank metric is generalized and the rank-metric Singleton bound is established. The definition of Gabidulin codes is extended and it is shown that its properties are preserved. The theory of Grobner bases is used to give the unique decoding, minimal list decoding, and error-erasure decoding algorithms of interleaved Gabidulin codes. These results are then applied in space-time codes and in random linear network coding as in the case of finite fields. Specifically, two existing encoding schemes of random linear network coding are combined to improve the error correction.

关键词： Finite principal ideal rings Galois extension Grobner bases interleaved Gabidulin codes random linear network coding rank-metric codes skew polynomials space-time codes

来源：评论

学校读者我要写书评

暂无评论

Near-Optimal One-Sided Scheduling for Coded Segmented network coding

引用

IEEE TRANSACTIONS ON COMPUTERS 2016年第3期65卷 929-939页

作者： Tang, Bin Yang, Shenghao Ye, Baoliu Guo, Song Lu, Sanglu Nanjing Univ Natl Key Lab Novel Software Technol Nanjing 210008 Jiangsu Peoples R China Chinese Univ Hong Kong Inst Network Coding Hong Kong Hong Kong Peoples R China Univ Aizu Sch Comp Sci & Engn Performance Evaluat Lab Aizu Wakamatsu Fukushima Japan

As a variation of random linear network coding, segmented network coding (SNC) has attracted great interest in data dissemination over lossy networks due to its low computational cost. In order to guarantee the success of decoding, SNC can adopt a feedbackless forward error correction (FEC) approach by applying a linear block code to the input packets before segmentation at the source node. In particular, if the empirical rank distribution of transfer matrices of segments is known in advance, several classes of coded SNC can achieve close-to-optimal decoding performance. However, the empirical rank distribution in the absence of feedback has been little investigated yet, making the whole performance of the FEC approach unknown. To close this gap, in this paper, we present the first comprehensive study on the transmission scheduling issue for the FEC approach, aiming at optimizing the rank distribution of transfer matrices with little control overhead. We propose an efficient adaptive scheduling framework for coded SNC in lossy unicast networks. This framework is one-sided (i.e., each network node forwards the segments adaptively only according to its own state) and scalable (i.e., its buffer cost will not keep on growing when the number of input packets goes to infinity). The performance of the framework is further optimized based on a linear programming approach. Extensive numerical results show that our framework performs near-optimally with respect to the empirical rank distribution.

关键词： random linear network coding segmented network coding forward error correction scheduling strategy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：