Performance Improvement of Kötter and Kschischang Codes and Lifted Rank Metric Codes in Random Linear Network Coding

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 inadequat...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mobile networks and applications Jg. 28; H. 1; S. 168 - 177
Hauptverfasser: Guefrachi, Aicha, Nighaoui, Sarra, Zaibi, Sonia, Bouallegue, Ammar
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.02.2023
Springer Nature B.V
Schlagworte:
Coding
Communications Engineering
Computer Communication Networks
Electrical Engineering
Engineering
Error correction
Error correction & detection
Error detection
Finite element method
IT in Business
Network latency
Networks
Performance enhancement
Performance evaluation
Redundancy
Performance evaluation
Lifted rank metric codes
Kötter and Kschischang codes
Random Linear Network coding
CRC codes
Network error correction
ISSN:1383-469X, 1572-8153
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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, Kötter 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.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1383-469X
1572-8153
DOI:10.1007/s11036-022-02043-0