Coded Wireless Distributed Computing With Packet Losses and Retransmissions

In wireless distributed computing systems, mobile devices that are connected wirelessly to the Fog (e.g., small base stations) collaboratively solve a given computational task. Unfortunately, wireless distributed computing systems suffer from packet losses due to severe channel fading. Moreover, a w...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on wireless communications Vol. 20; no. 12; pp. 8204 - 8217
Main Authors: Han, Dong-Jun, Sohn, Jy-Yong, Moon, Jaekyun
Format: Journal Article
Language:English
Published: New York IEEE 01.12.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
ISSN:1536-1276, 1558-2248
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract In wireless distributed computing systems, mobile devices that are connected wirelessly to the Fog (e.g., small base stations) collaboratively solve a given computational task. Unfortunately, wireless distributed computing systems suffer from packet losses due to severe channel fading. Moreover, a wireless device can drop out of the system when leaving the coverage of a master node in the Fog layer. We model this unreliability between a device and a master node as a packet erasure channel. When a packet fails to be detected at the receiver, the corresponding packet is retransmitted, which would significantly increase the overall run-time to finish the task. We take a coding-theoretic approach to tackle this straggler-like problem in wireless distributed computing. We first investigate the expected latency using an <inline-formula> <tex-math notation="LaTeX">(n, k) </tex-math></inline-formula> maximum-distance separable (MDS) code. We obtain the lower and upper bounds on the latency in closed forms and provide guidelines to design MDS codes depending on the channel condition characterized by packet erasure probability. Then, we introduce another important performance metric called minimum latency , and also provide guidelines on designing optimal codes. Based on optimal codes, we obtain the performance curves of achievable minimum latency and achievable workload as functions of packet erasure probability.
AbstractList In wireless distributed computing systems, mobile devices that are connected wirelessly to the Fog (e.g., small base stations) collaboratively solve a given computational task. Unfortunately, wireless distributed computing systems suffer from packet losses due to severe channel fading. Moreover, a wireless device can drop out of the system when leaving the coverage of a master node in the Fog layer. We model this unreliability between a device and a master node as a packet erasure channel. When a packet fails to be detected at the receiver, the corresponding packet is retransmitted, which would significantly increase the overall run-time to finish the task. We take a coding-theoretic approach to tackle this straggler-like problem in wireless distributed computing. We first investigate the expected latency using an <inline-formula> <tex-math notation="LaTeX">(n, k) </tex-math></inline-formula> maximum-distance separable (MDS) code. We obtain the lower and upper bounds on the latency in closed forms and provide guidelines to design MDS codes depending on the channel condition characterized by packet erasure probability. Then, we introduce another important performance metric called minimum latency , and also provide guidelines on designing optimal codes. Based on optimal codes, we obtain the performance curves of achievable minimum latency and achievable workload as functions of packet erasure probability.
In wireless distributed computing systems, mobile devices that are connected wirelessly to the Fog (e.g., small base stations) collaboratively solve a given computational task. Unfortunately, wireless distributed computing systems suffer from packet losses due to severe channel fading. Moreover, a wireless device can drop out of the system when leaving the coverage of a master node in the Fog layer. We model this unreliability between a device and a master node as a packet erasure channel. When a packet fails to be detected at the receiver, the corresponding packet is retransmitted, which would significantly increase the overall run-time to finish the task. We take a coding-theoretic approach to tackle this straggler-like problem in wireless distributed computing. We first investigate the expected latency using an [Formula Omitted] maximum-distance separable (MDS) code. We obtain the lower and upper bounds on the latency in closed forms and provide guidelines to design MDS codes depending on the channel condition characterized by packet erasure probability. Then, we introduce another important performance metric called minimum latency , and also provide guidelines on designing optimal codes. Based on optimal codes, we obtain the performance curves of achievable minimum latency and achievable workload as functions of packet erasure probability.
Author Moon, Jaekyun
Han, Dong-Jun
Sohn, Jy-Yong
Author_xml – sequence: 1
  givenname: Dong-Jun
  orcidid: 0000-0003-2970-7336
  surname: Han
  fullname: Han, Dong-Jun
  email: djhan93@kaist.ac.kr
  organization: School of Electrical Engineering, Korea Advanced Institute of Science and Technology (KAIST), Daejeon, South Korea
– sequence: 2
  givenname: Jy-Yong
  orcidid: 0000-0002-8741-1405
  surname: Sohn
  fullname: Sohn, Jy-Yong
  email: sohn9@wisc.edu
  organization: Department of Electrical and Computer Engineering, University of Wisconsin-Madison, Madison, WI, USA
– sequence: 3
  givenname: Jaekyun
  orcidid: 0000-0003-0993-5788
  surname: Moon
  fullname: Moon, Jaekyun
  email: jmoon@kaist.edu
  organization: School of Electrical Engineering, Korea Advanced Institute of Science and Technology (KAIST), Daejeon, South Korea
BookMark eNp9kM1LAzEQxYNUsK3eBS8LnrdOsk02e5T1EwuKVHoMye5EU9vdmqQH_3tTWjx48DTDzPvNPN6IDLq-Q0LOKUwohepqvqgnDBidFFDRqeBHZEg5lzljUznY9YXIKSvFCRmFsASgpeB8SJ7qvsU2WziPKwwhu3Eheme2MQ3rfr3ZRte9p3X8yF5084kxm_UhYMh012avGL3uwtqF4PounJJjq1cBzw51TN7ubuf1Qz57vn-sr2d5wyoac22olE1RSs0YM1CUFoSwDLHSnJsWALQwgK0BaytttbSMmwIN0kZYWUIxJpf7uxvff20xRLXst75LLxUTIDkvKWNJJfaqxifHHq1qXNQxGU2m3UpRULvgVApO7YJTh-ASCH_AjXdr7b__Qy72iEPEX3k1FSUHXvwAEFZ7YA
CODEN ITWCAX
CitedBy_id crossref_primary_10_1109_TWC_2024_3357857
crossref_primary_10_1109_TC_2024_3506856
crossref_primary_10_1109_TCOMM_2024_3381711
crossref_primary_10_1109_TSP_2022_3185905
crossref_primary_10_1109_ACCESS_2024_3385230
crossref_primary_10_3390_e25030428
crossref_primary_10_1109_TCCN_2024_3391317
crossref_primary_10_1007_s11235_023_01057_7
crossref_primary_10_1109_TWC_2022_3213256
crossref_primary_10_1109_TCOMM_2025_3529253
crossref_primary_10_1109_TWC_2022_3187427
crossref_primary_10_1109_TCOMM_2023_3334810
crossref_primary_10_1109_LCOMM_2023_3320283
Cites_doi 10.1145/3393691.3394214
10.1109/TIT.2019.2904055
10.1109/TNET.2017.2702605
10.1109/TWC.2017.2785305
10.1109/ISIT.2019.8849306
10.1109/TIT.2019.2924621
10.1109/TIT.2017.2756959
10.1109/ISIT.2018.8437669
10.1109/ISIT.2018.8437473
10.1109/GLOCOM.2016.7841903
10.1109/TWC.2019.2946245
10.1109/ISIT.2017.8006963
10.1109/TWC.2019.2896999
10.1109/ALLERTON.2017.8262778
10.1109/ISIT.2017.8006962
10.1109/WCNC.2005.1424754
10.1109/TWC.2019.2961673
10.1109/TWC.2020.2974748
10.1109/ISIT.2018.8437871
10.1109/TIT.2017.2736066
10.1109/TWC.2016.2633522
10.1109/ISIT.2017.8007060
10.1109/TWC.2018.2845360
10.1109/ISIT.2017.8006960
10.1109/TCOMM.2016.2532879
10.1007/978-1-4757-3124-8
10.1109/GLOCOMW.2016.7848828
10.1109/ALLERTON.2017.8262881
10.1109/ALLERTON.2015.7447112
10.1109/ISIT.2019.8849747
10.1109/ISIT.2019.8849317
10.1109/MCOM.2012.6122545
10.2307/1266548
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2021
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2021
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
DOI 10.1109/TWC.2021.3091465
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE/IET Electronic Library (IEL) (UW System Shared)
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Technology Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1558-2248
EndPage 8217
ExternalDocumentID 10_1109_TWC_2021_3091465
9467505
Genre orig-research
GrantInformation_xml – fundername: IITP funds from MSIT of Korea
  grantid: 2020-0-00626
– fundername: National Research Foundation of Korea
  grantid: 2019R1I1A2A02061135
  funderid: 10.13039/501100003725
GroupedDBID -~X
0R~
29I
4.4
5GY
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFO
ACGFS
ACIWK
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AIBXA
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
EJD
HZ~
H~9
IES
IFIPE
IPLJI
JAVBF
LAI
M43
O9-
OCL
P2P
RIA
RIE
RNS
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c291t-ab188c378a222b037f066f2ee9a55bd000a6b0edb0ff9afa8f25b3ebe1c6f8703
IEDL.DBID RIE
ISICitedReferencesCount 18
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000728926400038&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1536-1276
IngestDate Fri Jul 25 18:54:20 EDT 2025
Sat Nov 29 06:23:52 EST 2025
Tue Nov 18 22:20:45 EST 2025
Wed Aug 27 05:11:47 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 12
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c291t-ab188c378a222b037f066f2ee9a55bd000a6b0edb0ff9afa8f25b3ebe1c6f8703
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-8741-1405
0000-0003-0993-5788
0000-0003-2970-7336
PQID 2608557122
PQPubID 105736
PageCount 14
ParticipantIDs proquest_journals_2608557122
crossref_citationtrail_10_1109_TWC_2021_3091465
ieee_primary_9467505
crossref_primary_10_1109_TWC_2021_3091465
PublicationCentury 2000
PublicationDate 2021-Dec.
2021-12-00
20211201
PublicationDateYYYYMMDD 2021-12-01
PublicationDate_xml – month: 12
  year: 2021
  text: 2021-Dec.
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on wireless communications
PublicationTitleAbbrev TWC
PublicationYear 2021
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref35
ref34
ref12
ref37
ref36
ref31
ref30
ref33
ref11
ref32
ref10
tandon (ref15) 2017
ref2
ref1
ref38
bremaud (ref39) 1999
sohn (ref20) 2020
chen (ref16) 2018
yu (ref13) 2017
ref24
ref23
ref26
ref25
ref42
ref41
ref22
ref21
reisizadeh (ref18) 2019
dutta (ref14) 2016
yu (ref19) 2019
ref28
ref27
ye (ref17) 2018
ref29
ref8
ref7
ref9
ref4
ref3
ref6
ref5
ref40
References_xml – ident: ref24
  doi: 10.1145/3393691.3394214
– ident: ref27
  doi: 10.1109/TIT.2019.2904055
– ident: ref34
  doi: 10.1109/TNET.2017.2702605
– ident: ref6
  doi: 10.1109/TWC.2017.2785305
– ident: ref23
  doi: 10.1109/ISIT.2019.8849306
– ident: ref3
  doi: 10.1109/TIT.2019.2924621
– ident: ref31
  doi: 10.1109/TIT.2017.2756959
– start-page: 4406
  year: 2017
  ident: ref13
  article-title: Polynomial codes: An optimal design for high-dimensional coded matrix multiplication
  publication-title: Proc Neural Inf Process Syst
– ident: ref29
  doi: 10.1109/ISIT.2018.8437669
– year: 2019
  ident: ref18
  article-title: CodedReduce: A fast and robust framework for gradient aggregation in distributed learning
  publication-title: arXiv 1902 01981
– ident: ref25
  doi: 10.1109/ISIT.2018.8437473
– ident: ref32
  doi: 10.1109/GLOCOM.2016.7841903
– year: 2020
  ident: ref20
  article-title: Election coding for distributed learning: Protecting SignSGD against byzantine attacks
  publication-title: Proc Neural Inf Process Syst
– ident: ref10
  doi: 10.1109/TWC.2019.2946245
– ident: ref12
  doi: 10.1109/ISIT.2017.8006963
– ident: ref4
  doi: 10.1109/TWC.2019.2896999
– ident: ref22
  doi: 10.1109/ALLERTON.2017.8262778
– ident: ref38
  doi: 10.1109/ISIT.2017.8006962
– start-page: 903
  year: 2018
  ident: ref16
  article-title: DRACO: Byzantine-resilient distributed training via redundant gradients
  publication-title: Proc ICML
– start-page: 5610
  year: 2018
  ident: ref17
  article-title: Communication-computation efficient gradient coding
  publication-title: Proc Int Conf Mach Learn
– ident: ref40
  doi: 10.1109/WCNC.2005.1424754
– ident: ref8
  doi: 10.1109/TWC.2019.2961673
– start-page: 1215
  year: 2019
  ident: ref19
  article-title: Lagrange coded computing: Optimal design for resiliency, security, and privacy
  publication-title: Proc 22nd Int Conf Artif Intell Statist
– start-page: 2092
  year: 2016
  ident: ref14
  article-title: 'Short-Dot': Computing large linear transforms distributedly using coded short dot products
  publication-title: Proc Neural Inf Process Syst
– start-page: 3368
  year: 2017
  ident: ref15
  article-title: Gradient coding: Avoiding stragglers in distributed learning
  publication-title: Proc Int Conf Mach Learn
– ident: ref9
  doi: 10.1109/TWC.2020.2974748
– ident: ref26
  doi: 10.1109/ISIT.2018.8437871
– ident: ref11
  doi: 10.1109/TIT.2017.2736066
– ident: ref5
  doi: 10.1109/TWC.2016.2633522
– ident: ref42
  doi: 10.1109/ISIT.2017.8007060
– ident: ref7
  doi: 10.1109/TWC.2018.2845360
– ident: ref35
  doi: 10.1109/GLOCOM.2016.7841903
– ident: ref21
  doi: 10.1109/ISIT.2017.8006960
– ident: ref36
  doi: 10.1109/TCOMM.2016.2532879
– year: 1999
  ident: ref39
  publication-title: Markov Chains Gibbs Fields Monte Carlo Simulation and Queues
  doi: 10.1007/978-1-4757-3124-8
– ident: ref33
  doi: 10.1109/GLOCOMW.2016.7848828
– ident: ref37
  doi: 10.1109/ALLERTON.2017.8262881
– ident: ref30
  doi: 10.1109/ALLERTON.2015.7447112
– ident: ref1
  doi: 10.1109/ISIT.2019.8849747
– ident: ref28
  doi: 10.1109/ISIT.2019.8849317
– ident: ref2
  doi: 10.1109/MCOM.2012.6122545
– ident: ref41
  doi: 10.2307/1266548
SSID ssj0017655
Score 2.473215
Snippet In wireless distributed computing systems, mobile devices that are connected wirelessly to the Fog (e.g., small base stations) collaboratively solve a given...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 8204
SubjectTerms Coded computation
Codes
Computational modeling
Computer networks
Distributed computing
Distributed processing
Electronic devices
Fading channels
Guidelines
Mobile computing
Packet loss
straggler
Task analysis
Upper bounds
wireless distributed computing
Wireless networks
Title Coded Wireless Distributed Computing With Packet Losses and Retransmissions
URI https://ieeexplore.ieee.org/document/9467505
https://www.proquest.com/docview/2608557122
Volume 20
WOSCitedRecordID wos000728926400038&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 1558-2248
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0017655
  issn: 1536-1276
  databaseCode: RIE
  dateStart: 20020101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwEA9z-KAPfk1xOiUPvgjWpd_Jo0yHoIwhE_dWkiZBYXSydf793qVdGSiC0IfSXkq5y-Xucpf7EXIlglgZCBs80ELmRZppj1ujPF8YIayMlJbagU2koxGfTsW4RW6aszDGGFd8Zm7x1uXy9Txf4VZZH-HgY2xYupWmSXVWq8kYpIlDOAUFRlyZtElJMtGfvA0gEAz82xCMY4RmZMMEOUyVHwuxsy7D_f_91wHZq71IeleJ_ZC0THFEdjd6C3bI02CujaZY3TqD1YzeY4dcBLeChxWUA5DB6_KdjiWockmf55gAprLQ9MWUaMNgDuBm2vKYvA4fJoNHr0ZO8PJA-KUnlc95HqZcgvlXLEwteBY2MEbIOFYalkGZKGa0YtYKaSW3ILIQ5OnniQUNDk9Iu5gX5pRQnkTglIRwGRlxFkuLyHc2jyW4aiDKLumvmZnldVtxRLeYZS68YCID9mfI_qxmf5dcNyM-q5Yaf9B2kN0NXc3pLumt5ZXVOrfMIDLjcZz6QXD2-6hzsoPfropReqRdLlbmgmznX-XHcnHpptM3bwvIBQ
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwED9EBfXBrynOzz74IliXfmRNHmU6lM0xZOLeStokKIxWXPXv967tiqAIQh9Ke6HlLpe7y13uB3AufZ4YDBtc1ELmhpppV1iTuJ40UloVJlrpEmwiGo3EdCrHS3DZnIUxxpTFZ-aKbstcvs7TD9oq6xAcPKeGpSs8DH1WndZqcgZRt8Q4RRUmZJmoSUoy2Zk89zAU9L2rAM1jSIbkmxEqUVV-LMWlfelv_e_PtmGz9iOd60rwO7Bksl3Y-NZdsAWDXq6Ndqi-dYbrmXNDPXIJ3gofVmAOSIavixdnrFCZC2eYUwrYUZl2Hk1BVgxnAW2nzffgqX876d25NXaCm_rSK1yVeEKkQSQUOgAJCyKLvoX1jZGK80TjQqi6CTM6YdZKZZWwKLQAJeqlXYs6HOzDcpZn5gAc0Q3RLQnwMioUjCtL2Hc25QqdNRRmGzoLZsZp3Vic8C1mcRlgMBkj-2Nif1yzvw0XzYi3qqnGH7QtYndDV3O6DccLecW11s1jjM0E55Hn-4e_jzqDtbvJwzAe3o8GR7BO36lKU45huXj_MCewmn4Wr_P303JqfQEB48tM
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Coded+Wireless+Distributed+Computing+With+Packet+Losses+and+Retransmissions&rft.jtitle=IEEE+transactions+on+wireless+communications&rft.au=Han%2C+Dong-Jun&rft.au=Sohn%2C+Jy-Yong&rft.au=Moon%2C+Jaekyun&rft.date=2021-12-01&rft.pub=IEEE&rft.issn=1536-1276&rft.volume=20&rft.issue=12&rft.spage=8204&rft.epage=8217&rft_id=info:doi/10.1109%2FTWC.2021.3091465&rft.externalDocID=9467505
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1536-1276&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1536-1276&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1536-1276&client=summon