Merged-r Luby Transform Coded Computation for Non-Linear Tasks in Wireless Networks

Coded computation has garnered considerable attention for its ability to eliminate the stragglers' effect. Most existing works of coded computation are designed for linear tasks. They cannot handle the nonlinear tasks directly, leading to high computation, transmission and decoding latency. In this paper, considering a nonlinear task in wireless networks, we propose an efficient merged-r Luby transform (LT) coded computation scheme. First, we give the merged-r LT coding strategy to reduce the computation and transmission costs. Then, the maximum degree decoding (MDD) strategy is proposed to speed up the decoding process. Finally, we analyze and optimize the latency performance for the whole network by designing the merging parameter. Theoretical analysis and simulation results show that our proposed scheme has significant advantages over the existing ones for nonlinear tasks.

Authors

Institutions

Publication Details

Published
2024-10-24
DOI
https://doi.org/10.1109/wcsp62071.2024.10827212
Primary Topic
Cooperative Communication and Network Coding
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Merged-r Luby Transform Coded Computation for Non-Linear Tasks in Wireless Networks

Borui Fang, Li Chen, Weidong Wang
Cooperative Communication and Network Coding
article

Merged-r Luby Transform Coded Computation for Non-Linear Tasks in Wireless Networks

Borui Fang, Li Chen, Weidong Wang
article en

Abstract

Coded computation has garnered considerable attention for its ability to eliminate the stragglers' effect. Most existing works of coded computation are designed for linear tasks. They cannot handle the nonlinear tasks directly, leading to high computation, transmission and decoding latency. In this paper, considering a nonlinear task in wireless networks, we propose an efficient merged-r Luby transform (LT) coded computation scheme. First, we give the merged-r LT coding strategy to reduce the computation and transmission costs. Then, the maximum degree decoding (MDD) strategy is proposed to speed up the decoding process. Finally, we analyze and optimize the latency performance for the whole network by designing the merging parameter. Theoretical analysis and simulation results show that our proposed scheme has significant advantages over the existing ones for nonlinear tasks.

University of Science and Technology of China (CN)
Openalex Percentile: Top 70%
Cooperative Communication and Network Coding
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.