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

18th IEEE International Workshop on Computer Aided Modeling and Design of Communication Links and networks (CAMAD)

作者： Bassoli, Riccardo Talooki, Vahid Nazari Marques, Hugo Rodriguez, Jonathan Tafazolli, Rahim Inst Telecomunicacoes Aveiro Portugal Ctr ommun Syst Res Surrey England

ISBN: (纸本)9781467349192

Managing and maintaining network connectivity in a mobile ad-hoc network (MANET) is known to consume bandwidth and energy at the mobile nodes. Traditional mechanisms require that stations periodically monitor the wireless channel, in order to determine available paths to route incoming packets. Aiming to alleviate the problem of energy consumption and high control overhead, this paper adopts a new approach to passive neighbourhood detection, based on network coding. Specifically, ad-hoc stations examine the coding vectors and subspaces of incoming network-coded packets to extract information about the subspaces spanned by these vectors, enabling them to passively discover new neighbours. The new discovery mechanism is incorporated into the well-known dynamic MANET on-demand (DYMO) ad-hoc routing protocol and the features of the combined scheme are discussed, towards assessing the potential advantages of the proposed approach, particularly with respect to energy efficiency.

关键词： Dynamic MANET On-demand random linear network coding passive neighbour discovery energy efficiency

来源：评论

学校读者我要写书评

暂无评论

New constructions of abelian non-cyclic orbit codes based on parabolic subgroups and tensor products

引用

FINITE FIELDS AND THEIR APPLICATIONS 2025年 103卷

作者： Askary, Soleyman Biranvand, Nader Shirjian, Farrokh Imam Ali Univ Fac Sci Tehran Iran

Orbit codes, as special constant dimension subspace codes, have attracted much attention due to their applications for error correction in random network coding. They arise as orbits of a subspace of Fqn under the action of some subgroup of the finite general linear group GLn(q). The main contribution of this paper is to propose new methods for constructing large non-cyclic orbit codes. First, using the subgroup structure of maximal subgroups of GLn(q), we propose a new construction of an abelian non-cyclic orbit codes of size qk with k <= n/2. The proposed code is shown to be a partial spread which in many cases is close to the known maximum-size codes. Next, considering a larger framework, we introduce the notion of tensor product operation for subspace codes and explicitly determine the parameters of such product codes. The parameters of the constructions presented in this paper improve the constructions already obtained in [6] and [7]. (c) 2025 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.

关键词： random linear network coding Algebraic coding theory Abelian orbit code Subspace code linear groups

来源：评论

学校读者我要写书评

暂无评论

Vector multispaces and multispace codes

引用

APPLIED MATHEMATICS AND COMPUTATION 2025年 486卷

作者： Kovacevic, Mladen Univ Novi Sad Fac Tech Sci Novi Sad Serbia

Basic algebraic and combinatorial properties of finite vector spaces in which individual vectors are allowed to have multiplicities larger than 1 are derived. An application in coding theory is illustrated by showing that multispace codes that are introduced here may be used in random linear network coding scenarios, and that they generalize standard subspace codes (defined in the set of all subspaces of F-q(n)) and extend them to an infinitely larger set of parameters. In particular, in contrast to subspace codes, multispace codes of arbitrarily large cardinality and minimum distance exist for any fixed n and q.

关键词： Multiset Multispace Projective space Grassmannian linearized polynomial Modular lattice Subspace code 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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

network coding as Enabler for Achieving URLLC Under TCP and UDP Environments: A Survey

引用

IEEE ACCESS 2023年 11卷 76647-76674页

作者： Enenche, Patrick Kim, Dong Ho You, Dongho Hannam Univ Dept Informat & Commun Engn Daejeon 34430 South Korea Seoul Natl Univ Sci & Technol Dept Elect & IT Media Engn Seoul 139743 South Korea

In an era of rapidly evolving technology, the pursuit of higher data rates, extremely low latency, and robust reliability is becoming increasingly crucial. Applications such as Industrial Internet of Things (IIoT) demand that transmitted messages meet stringent time constraints. Traditional ARQ-based schemes struggle to achieve the required performance in the presence of feedback delays or feedback losses. Unlike conventional ARQ approaches, which acknowledge only original packets, network coding (NC) can acknowledge multiple degrees of freedom (DOF), making the feedback mechanism a pivotal factor for reliability-delay tradeoffs. On the other hand, UDP protocol operates blindly without feedback acknowledgments (ACKs). Thus, the selection of code to provide ultra-reliable and low-latency communications (URLLCs) over lossy channels without feedback ACKs is tedious. However, network coding inherent robustness against packet erasure positions it as a promising candidate for reliable communication without feedback ACKs. In this survey, we delve into cutting-edge opportunistic network coding schemes that can deliver high data rates and low latency, even in the face of feedback limitations such as feedback delays, feedback losses, or complete feedback absence. We focus on how network coding-based approaches maintain effective communication over lossy networks, regardless of these feedback limitations. In the context of UDP environments (i.e., blind coding), we present the interplay of some essential elements that must be integrated into network coding to enable reliable transmission without feedback ACKs. While drawing support from secondary sources, our primary objective is to stimulate readers' interest in further exploration of network coding for URLLC in mission-critical (IIoT) applications.

关键词： random linear network coding URLLC delay reliability ARQ rateless code feedback

来源：评论

学校读者我要写书评

暂无评论

New constructions of orbit codes based on imprimitive wreath products and wreathed tensor products

引用

RENDICONTI DEL CIRCOLO MATEMATICO DI PALERMO 2024年第1期73卷 85-98页

作者： Askary, Soleyman Biranvand, Nader Shirjian, Farrokh Imam Ali Univ Fac Sci Tehran Iran

Orbit codes, as special constant dimension codes, have attracted much attention due to their applications for error correction in random network coding. They arise as orbits of a subspace of F-q(n) under the action of some subgroup of the finite general linear group GL(n)(q). The aim of this paper is to present constructions of large non-Abelian orbit codes having the maximum possible distance. The properties of imprimitive wreath products and wreathed tensor products of groups are employed to select certain types of subspaces and their stabilizers, thereby providing a systematic way of constructing orbit codes with optimum parameters. We also present explicit examples of such constructions which improve the parameters of the construction already obtained in Climent et al. (Cryptogr Commun 11:839-852, 2019).

关键词： random linear network coding Algebraic coding theory Non-Abelian orbit code linear groups

来源：评论

学校读者我要写书评

暂无评论

Optimal chunk caching in network coding-based qualitative communication

引用

Digital Communications and networks 2022年第1期8卷 44-50页

作者： Lijun Dong Richard Li Futurewei Technologies Inc. 2330 Central ExpresswaySanta Clara95050USA

network processing in the current Internet is at the entirety of the data packet,which is problematic when encountering network *** newly proposed Internet service named Qualitative Communication changes the network processing paradigm to an even finer granularity,namely chunk level,which obsoletes many existing networking policies and schemes,especially the caching algorithms and cache replacement policies that have been extensively explored in Web Caching,Content Delivery networks(CDN)or Information-Centric networks(ICN).This paper outlines all the new factors that are brought by random linear network coding-based Qualitative Communication and proves the importance and necessity of considering them.A novel metric is proposed by taking these new factors into *** optimization problem is formulated to maximize the metric value of all retained chunks in the local storage of network nodes under the constraint of storage limit.A cache replacement scheme that obtains the optimal result in a recursive manner is proposed *** the help of the introduced intelligent cache replacement algorithm,the performance evaluations show remarkably reduced end-to-end latency compared to the existing schemes in various network scenarios.

关键词： Internet Qualitative communication New IP Chunk caching random linear network coding End-to-end latency Cache replacement policy Degree of freedom Distance Packet size

来源：评论

学校读者我要写书评

暂无评论

Demo: Towards Reliable Cloud-native 5G and Beyond networks using In-network Computing

Demo: Towards Reliable Cloud-native 5G and Beyond Networks u...

引用

IEEE/IFIP network Operations and Management Symposium (NOMS)

作者： Attawna, Mahdi Lhamo, Osel Doan, Tung V. Fitzek, Frank H. P. Nguyen, Giang T. Tech Univ Dresden Deutsch Telekom Chair Commun Networks Dresden Germany Tech Univ Dresden Hapt Commun Syst Dresden Germany Ctr Tactile Internet Human In The Loop CeTI Dresden Germany

ISBN: (纸本)9798350327939;9798350327946

Emerging use cases, such as Tactile Internet, typically demand high reliability and low-latency communication. To fulfill these stringent requirements, 5G networks employ retransmission within the Radio Access network (RAN) in the event of packet loss, but at the expense of increased latency. An alternative approach to address this challenge involves leveraging random linear network coding (RLNC) to recover lost packets, thereby eliminating the necessity for retransmission within the RAN. We demonstrate the ability of in-network computing to run RLNC, particularly with the use of RLNC recoder, to enhance reliability and reduce latency within the network.

关键词： Tactile Internet random linear network coding 5G Cloud-Native Reliability Low-Latency

来源：评论

学校读者我要写书评

暂无评论

TOWARDS MINIMISING THE COEFFICIENT VECTOR OVERHEAD IN random linear network coding

TOWARDS MINIMISING THE COEFFICIENT VECTOR OVERHEAD IN RANDOM...

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Chamitha de Alwis H. Kodikara Arachchi Anil Fernando Ahmet Kondoz I-Lab CVS'SP University of Surrey

ISBN: (纸本)9781479903573

network coding is a promising approach to increase network throughput and robustness to facilitate high volume traffic. Performing network coding in dynamic network structures requires transmitting coding coefficients for information sinks to decode network coded packets. Compared to the packet sizes used in practical networks, the size of coefficient vectors can be significant. This paper exploits the properties of small and medium sized networks and proposes a novel approach to minimise the coefficient vector size of network coded packets. Simulation results exhibit better compression of coefficient vectors over existing algorithms for small and medium sized networks.

关键词： random linear network coding Coefficient Compression network coding network Packet medium-size network throughput Cloning Vectors AVERAGE PARTICLE SIZE Small High Traffic Volume

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：