Revolving Codes: High Performance and Low Overhead Network Coding

被引:2
|
作者
Yazdani, Niloofar [1 ]
Lucani, Daniel E. [2 ]
机构
[1] Aarhus Univ, DIGIT, Aarhus, Denmark
[2] Aarhus Univ, Dept Engn, Aarhus, Denmark
关键词
Network coding; RLNC; overhead reduction;
D O I
10.1109/africa.2019.8843415
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Revolving Codes (ReC) are introduced as an alternative to other network codes to reduce per packet and total overhead, and reduce the probability of linearly dependent coded packets. Furthermore, Revolving Codes reduce the costs to intermediate nodes by introducing a recoding scheme based on XOR operations. Revolving Codes are well suited for new applications transmitting small payloads, e.g., IoT, Industry 4.0. Our numerical results show that ReC outperforms RLNC in total overhead by as much as two orders of magnitude and it outperforms Fulcrum codes by as much as two orders of magnitude in terms of the overhead caused by linearly dependent packets.
引用
收藏
页码:101 / 105
页数:5
相关论文
共 50 条
  • [31] Network Coding for Overhead Reduction in Delay Tolerant Networks
    Vazintari, Anna
    Vlachou, Christina
    Cottis, Panayotis G.
    WIRELESS PERSONAL COMMUNICATIONS, 2013, 72 (04) : 2653 - 2671
  • [32] COUNTERACTING BYZANTINE ADVERSARIES WITH NETWORK CODING: AN OVERHEAD ANALYSIS
    Kim, MinJi
    Medard, Muriel
    Barros, Joao
    2008 IEEE MILITARY COMMUNICATIONS CONFERENCE: MILCOM 2008, VOLS 1-7, 2008, : 382 - +
  • [33] Adaptive Control of Packet Overhead in XOR Network Coding
    Nage, Tebatso
    Yu, F. Richard
    St-Hilaire, Marc
    2010 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS - ICC 2010, 2010,
  • [34] Network Coding for Overhead Reduction in Delay Tolerant Networks
    Anna Vazintari
    Christina Vlachou
    Panayotis G. Cottis
    Wireless Personal Communications, 2013, 72 : 2653 - 2671
  • [35] Staged Growth Codes: Intermediate Performance and Overhead Analysis
    Wu, Shuang
    Xiang, Wei
    Wang, Zhenyong
    Li, Dezhi
    Guo, Qing
    IEEE COMMUNICATIONS LETTERS, 2016, 20 (08) : 1503 - 1506
  • [36] Performance versus Overhead for Fountain Codes over Fq
    Liva, Gianluigi
    Paolini, Enrico
    Chiani, Marco
    IEEE COMMUNICATIONS LETTERS, 2010, 14 (02) : 178 - 180
  • [37] Performance Improvement of Kötter and Kschischang Codes and Lifted Rank Metric Codes in Random Linear Network Coding
    Aicha Guefrachi
    Sarra Nighaoui
    Sonia Zaibi
    Ammar Bouallegue
    Mobile Networks and Applications, 2023, 28 : 168 - 177
  • [38] New Parameters of Linear Codes Expressing Security Performance of Universal Secure Network Coding
    Kurihara, Jun
    Uyematsu, Tomohiko
    Matsumoto, Ryutaroh
    2012 50TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2012, : 533 - 540
  • [39] Performance Analysis of Unequal Error Protection Distributed Network Coding Based on Fountain Codes
    Yue, Jing
    Lin, Zihuai
    Bai, Baoming
    Vucetic, Branka
    IEEE WIRELESS COMMUNICATIONS LETTERS, 2014, 3 (03) : 285 - 288
  • [40] Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding
    Etzion, Tuvi
    Wachter-Zeh, Antonia
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (04) : 2460 - 2473