BAR: Blockwise Adaptive Recoding for Batched Network Coding

Author:

Yin Hoover H. F.12ORCID,Yang Shenghao3ORCID,Zhou Qiaoqiao4,Yung Lily M. L.5ORCID,Ng Ka Hei5

Affiliation:

1. Department of Information Engineering, The Chinese University of Hong Kong, Shatin, New Territories, Hong Kong, China

2. Department of Electronic and Computer Engineering, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong, China

3. School of Science and Engineering, The Chinese University of Hong Kong, Shenzhen, Shenzhen 518172, China

4. Department of Computer Science, School of Computing, National University of Singapore, Singapore 119391, Singapore

5. Independent Researcher, Hong Kong, China

Abstract

Multi-hop networks have become popular network topologies in various emerging Internet of Things (IoT) applications. Batched network coding (BNC) is a solution to reliable communications in such networks with packet loss. By grouping packets into small batches and restricting recoding to the packets belonging to the same batch; BNC has much smaller computational and storage requirements at intermediate nodes compared with direct application of random linear network coding. In this paper, we discuss a practical recoding scheme called blockwise adaptive recoding (BAR) which learns the latest channel knowledge from short observations so that BAR can adapt to fluctuations in channel conditions. Due to the low computational power of remote IoT devices, we focus on investigating practical concerns such as how to implement efficient BAR algorithms. We also design and investigate feedback schemes for BAR under imperfect feedback systems. Our numerical evaluations show that BAR has significant throughput gain for small batch sizes compared with existing baseline recoding schemes. More importantly, this gain is insensitive to inaccurate channel knowledge. This encouraging result suggests that BAR is suitable to be used in practice as the exact channel model and its parameters could be unknown and subject to changes from time to time.

Funder

NSFC

Publisher

MDPI AG

Subject

General Physics and Astronomy

Reference98 articles.

1. Luby, M. (2002, January 19). LT Codes. Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, Vancouver, BC, Canada.

2. Raptor Codes;Shokrollahi;IEEE Trans. Inf. Theory,2006

3. Maymounkov, P. (2002). Online Codes, New York University. Technical Report.

4. Ho, T., Koetter, R., Médard, M., Karger, D.R., and Effros, M. (July, January 29). The Benefits of Coding over Routing in a Randomized Setting. Proceedings of the 2003 IEEE International Symposium on Information Theory (ISIT), Yokohama, Japan.

5. A Random Linear Network Coding Approach to Multicast;Ho;IEEE Trans. Inf. Theory,2006

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Reliable Adaptive Recoding for Batched Network Coding with Burst-Noise Channels;2023 57th Asilomar Conference on Signals, Systems, and Computers;2023-10-29

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3