AoI-Reliability Analysis with Block Length over Erasure Channels Using Rateless Codes

As a metric to measure the information freshness, Age of Information (AoI) is widely used to evaluate low-latency high-reliability communication. Since the communication in Industrial Internet of Things (IIoT) often has the special requirements, the relationship among AoI, reliability and block length in time-critical scenarios with bounded latency and non-time-critical scenarios without bounded latency is explored respectively in this paper, based on erasure channels using rateless codes. We build a model using LT codes over erasure channels and consider two metrics: average AoI and bounded AoI. Theoretical analysis and simulation results show that AoI has a minimum value with different block lengths. Furthermore, we draw a conclusion that the minimum value of AoI under different reliability is monotonically decreasing functioned with reliability. Finally, the impact of overhead on reliability and AoI of LT codes in time-critical scenarios is studied.

Authors

Institutions

Publication Details

Published
2024-10-18
DOI
https://doi.org/10.1109/icct62411.2024.10946482
Primary Topic
Industrial Vision Systems and Defect Detection
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

AoI-Reliability Analysis with Block Length over Erasure Channels Using Rateless Codes

Haobo Huang, Yue Qiao, Yusun Fu, Weiwu Yan et al.
1 links
Industrial Vision Systems and Defect Detection
article

AoI-Reliability Analysis with Block Length over Erasure Channels Using Rateless Codes

Haobo Huang, Yue Qiao, Yusun Fu, Weiwu Yan, Junpeng Yin
article en

Abstract

As a metric to measure the information freshness, Age of Information (AoI) is widely used to evaluate low-latency high-reliability communication. Since the communication in Industrial Internet of Things (IIoT) often has the special requirements, the relationship among AoI, reliability and block length in time-critical scenarios with bounded latency and non-time-critical scenarios without bounded latency is explored respectively in this paper, based on erasure channels using rateless codes. We build a model using LT codes over erasure channels and consider two metrics: average AoI and bounded AoI. Theoretical analysis and simulation results show that AoI has a minimum value with different block lengths. Furthermore, we draw a conclusion that the minimum value of AoI under different reliability is monotonically decreasing functioned with reliability. Finally, the impact of overhead on reliability and AoI of LT codes in time-critical scenarios is studied.

Shanghai Jiao Tong University (CN)
National Natural Science Foundation of China, Research and Development
Openalex Percentile: Top 57%
Industrial Vision Systems and Defect Detection
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

AoI-Reliability Analysis with Block Length over Erasure Channels Using Rateless Codes — Haobo Huang, Yue Qiao, et al. · (2024) | TGRS Research Map | TGRS