Multiple-Time-Slot Multiple Access Binary Computation Offloading in the K-User Case

When multiple devices seek to offload computational tasks to their access point, the nature of the multiple access scheme plays a critical role in the system performance. For a system with heterogeneous tasks, we adopt a time-slotted signaling architecture in which different numbers of devices trans...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on signal processing Jg. 72; S. 3927 - 3944
Hauptverfasser:	Liu, Xiaomeng, Davidson, Timothy N.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	IEEE 2024
Schlagworte:	computation offloading Decoding Mobile edge computing multiple access NOMA Performance evaluation resource allocation Resource management Signal processing algorithms Task analysis Time division multiple access
ISSN:	1053-587X, 1941-0476
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Abstract	When multiple devices seek to offload computational tasks to their access point, the nature of the multiple access scheme plays a critical role in the system performance. For a system with heterogeneous tasks, we adopt a time-slotted signaling architecture in which different numbers of devices transmit in each slot, subject to individual power constraints. We consider the problem of jointly selecting the devices that will offload, along with optimizing their communication resources (their powers and rates in each time slot, and the time slot lengths) so as to minimize the a weighted sum of the energy expended by the devices. We employ a customized tree search algorithm for the offloading decisions in which a resource allocation problem is solved at each node. For time-division multiple access (TDMA) and "rate optimal" multiple access, we obtain reduced-dimension convex formulations of the resource allocation problem. For non-orthogonal multiple access (NOMA) with independent decoding (ID) or fixed-order sequential decoding (FOSD) we show that the resource allocation problem has a difference-of-convex structure and we develop a successive convex approximation algorithm with feasible point pursuit. Furthermore, for the FOSD scheme we obtain a closed-form expression that provides the optimal decoding order when it is feasible, and efficient algorithms for finding a good decoding order when it is not. Our results capture the inherent tradeoffs between the complexity of a multiple access scheme (and its resource allocation algorithm), and its performance in the computation offloading application.
AbstractList	When multiple devices seek to offload computational tasks to their access point, the nature of the multiple access scheme plays a critical role in the system performance. For a system with heterogeneous tasks, we adopt a time-slotted signaling architecture in which different numbers of devices transmit in each slot, subject to individual power constraints. We consider the problem of jointly selecting the devices that will offload, along with optimizing their communication resources (their powers and rates in each time slot, and the time slot lengths) so as to minimize the a weighted sum of the energy expended by the devices. We employ a customized tree search algorithm for the offloading decisions in which a resource allocation problem is solved at each node. For time-division multiple access (TDMA) and "rate optimal" multiple access, we obtain reduced-dimension convex formulations of the resource allocation problem. For non-orthogonal multiple access (NOMA) with independent decoding (ID) or fixed-order sequential decoding (FOSD) we show that the resource allocation problem has a difference-of-convex structure and we develop a successive convex approximation algorithm with feasible point pursuit. Furthermore, for the FOSD scheme we obtain a closed-form expression that provides the optimal decoding order when it is feasible, and efficient algorithms for finding a good decoding order when it is not. Our results capture the inherent tradeoffs between the complexity of a multiple access scheme (and its resource allocation algorithm), and its performance in the computation offloading application.
Author	Liu, Xiaomeng Davidson, Timothy N.
Author_xml	– sequence: 1 givenname: Xiaomeng orcidid: 0009-0002-1656-0769 surname: Liu fullname: Liu, Xiaomeng email: liu430@mcmaster.ca organization: Department of Electrical and Computer Engineering, McMaster University, Hamilton, ON, Canada – sequence: 2 givenname: Timothy N. orcidid: 0000-0002-2242-8070 surname: Davidson fullname: Davidson, Timothy N. organization: Department of Electrical and Computer Engineering, McMaster University, Hamilton, ON, Canada
BookMark	eNp9kE1PwzAMQCM0JLbBnQOH_IGMpPlocxwVDMTQkLZJ3CovdSCoa6emO_Dv6bQhIQ5cbMvys-w3IoO6qZGQa8EnQnB7u1q-ThKeqIlUSgmrzsiwj4JxlZpBX3Mtmc7StwsyivGTc6GUNUOyfNlXXdhVyFZhi2xZNR39adGpcxgjvQs1tF80b7a7fQddaGq68L5qoAz1Ow017T6QPrN1xJbmEPGSnHuoIl6d8pisH-5X-SObL2ZP-XTOXGJUx8AbtUksoAcntUtLzdPMlBvrM9TCguUgvdacZzqRxpaZkwhy40CAR--kHBNz3OvaJsYWfeHC8b6uhVAVghcHNUWvpjioKU5qepD_AXdt2PY__ofcHJGAiL_GjUxVlspvU4VyJQ
CODEN	ITPRED
CitedBy_id	crossref_primary_10_1186_s13634_025_01242_7
Cites_doi	10.1109/TCOMM.2016.2599530 10.1016/j.sigpro.2019.107322 10.1109/COMST.2017.2682318 10.1109/TSP.2016.2601299 10.1109/LSP.2014.2370033 10.1109/TWC.2018.2845360 10.1109/TCOMM.2020.3020068 10.1109/TSIPN.2015.2448520 10.1109/TVT.2014.2372852 10.1109/49.414651 10.1007/s11081-015-9294-x 10.1109/SPAWC.2016.7536749 10.1109/JSTSP.2019.2893057 10.1109/BlackSeaCom48709.2020.9235017 10.1109/MSP.2014.2334709 10.1109/TMC.2018.2815533 10.1109/MC.2010.98 10.1109/ICASSP48485.2024.10448508 10.1109/ACSSC.2017.8335682 10.1002/0471200611 10.1007/978-3-319-97142-1_3 10.1109/TCOMM.2007.902560 10.1109/ICASSP49357.2023.10095999 10.1109/SURV.2013.062613.00160 10.1109/18.485709 10.1109/TWC.2017.2717986 10.1109/COMST.2017.2745201 10.1109/TVT.2019.2907253 10.1109/JPROC.2009.2015717 10.1007/s11036-012-0368-0 10.1017/CBO9781139030687 10.1109/MSP.2015.2481563 10.1109/TWC.2017.2785305 10.1109/TWC.2016.2633522 10.1109/ICASSP49357.2023.10095862 10.1109/TCOMM.2018.2881725 10.1109/TSP.2020.2970309 10.1109/TWC.2021.3139932 10.1017/CBO9780511804441
ContentType	Journal Article
DBID	97E RIA RIE AAYXX CITATION
DOI	10.1109/TSP.2024.3444194
DatabaseName	IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef
DatabaseTitle	CrossRef
DatabaseTitleList
Database_xml	– sequence: 1 dbid: RIE name: IEEE Xplore url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	1941-0476
EndPage	3944
ExternalDocumentID	10_1109_TSP_2024_3444194 10637487
Genre	orig-research
GrantInformation_xml	– fundername: Natural Sciences and Engineering Research Council of Canada grantid: RGPIN-2020-06832 funderid: 10.13039/501100000038
GroupedDBID	-~X .DC 0R~ 29I 3EH 4.4 53G 5GY 5VS 6IK 85S 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACIWK ACKIV ACNCT AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AJQPL AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 E.L EBS EJD F5P HZ~ H~9 ICLAB IFIPE IFJZH IPLJI JAVBF LAI MS~ O9- OCL P2P RIA RIE RNS TAE TN5 VH1 AAYXX CITATION
ID	FETCH-LOGICAL-c264t-af64b29aefac35c7d50786db9f8e519a90a3f5500852369d8c3ea3bca1afefc33
IEDL.DBID	RIE
ISICitedReferencesCount	1
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001308206500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1053-587X
IngestDate	Sat Nov 29 04:24:10 EST 2025 Tue Nov 18 21:27:22 EST 2025 Wed Aug 27 02:01:58 EDT 2025
IsPeerReviewed	true
IsScholarly	true
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c264t-af64b29aefac35c7d50786db9f8e519a90a3f5500852369d8c3ea3bca1afefc33
ORCID	0000-0002-2242-8070 0009-0002-1656-0769
PageCount	18
ParticipantIDs	crossref_citationtrail_10_1109_TSP_2024_3444194 crossref_primary_10_1109_TSP_2024_3444194 ieee_primary_10637487
PublicationCentury	2000
PublicationDate	20240000 2024-00-00
PublicationDateYYYYMMDD	2024-01-01
PublicationDate_xml	– year: 2024 text: 20240000
PublicationDecade	2020
PublicationTitle	IEEE transactions on signal processing
PublicationTitleAbbrev	TSP
PublicationYear	2024
Publisher	IEEE
Publisher_xml	– name: IEEE
References	ref35 ref12 ref34 ref15 ref37 ref14 ref36 ref31 ref30 ref11 ref33 ref10 ref32 ref2 ref1 ref17 ref39 ref16 ref38 ref19 ref18 Salmani (ref13) 2018 ref24 ref23 ref26 ref25 ref20 ref22 ref21 ref28 ref27 ref29 ref8 ref7 ref9 ref4 ref3 ref6 ref5 ref40
References_xml	– ident: ref7 doi: 10.1109/TCOMM.2016.2599530 – ident: ref15 doi: 10.1016/j.sigpro.2019.107322 – ident: ref6 doi: 10.1109/COMST.2017.2682318 – ident: ref30 doi: 10.1109/TSP.2016.2601299 – ident: ref31 doi: 10.1109/LSP.2014.2370033 – ident: ref23 doi: 10.1109/TWC.2018.2845360 – ident: ref24 doi: 10.1109/TCOMM.2020.3020068 – ident: ref22 doi: 10.1109/TSIPN.2015.2448520 – ident: ref33 doi: 10.1109/TVT.2014.2372852 – ident: ref38 doi: 10.1109/49.414651 – ident: ref27 doi: 10.1007/s11081-015-9294-x – ident: ref10 doi: 10.1109/SPAWC.2016.7536749 – ident: ref25 doi: 10.1109/JSTSP.2019.2893057 – ident: ref36 doi: 10.1109/BlackSeaCom48709.2020.9235017 – ident: ref4 doi: 10.1109/MSP.2014.2334709 – ident: ref9 doi: 10.1109/TMC.2018.2815533 – ident: ref2 doi: 10.1109/MC.2010.98 – ident: ref19 doi: 10.1109/ICASSP48485.2024.10448508 – ident: ref12 doi: 10.1109/ACSSC.2017.8335682 – ident: ref20 doi: 10.1002/0471200611 – ident: ref29 doi: 10.1007/978-3-319-97142-1_3 – ident: ref39 doi: 10.1109/TCOMM.2007.902560 – ident: ref37 doi: 10.1109/ICASSP49357.2023.10095999 – ident: ref1 doi: 10.1109/SURV.2013.062613.00160 – ident: ref26 doi: 10.1109/18.485709 – ident: ref32 doi: 10.1109/TWC.2017.2717986 – year: 2018 ident: ref13 article-title: Multiple access computational offloading: Communication resource allocation in the two-user case (extended version) – ident: ref5 doi: 10.1109/COMST.2017.2745201 – ident: ref17 doi: 10.1109/TVT.2019.2907253 – ident: ref35 doi: 10.1109/JPROC.2009.2015717 – ident: ref3 doi: 10.1007/s11036-012-0368-0 – ident: ref21 doi: 10.1017/CBO9781139030687 – ident: ref28 doi: 10.1109/MSP.2015.2481563 – ident: ref11 doi: 10.1109/TWC.2017.2785305 – ident: ref8 doi: 10.1109/TWC.2016.2633522 – ident: ref34 doi: 10.1109/ICASSP49357.2023.10095862 – ident: ref14 doi: 10.1109/TCOMM.2018.2881725 – ident: ref16 doi: 10.1109/TSP.2020.2970309 – ident: ref18 doi: 10.1109/TWC.2021.3139932 – ident: ref40 doi: 10.1017/CBO9780511804441
SSID	ssj0014496
Score	2.4440358
Snippet	When multiple devices seek to offload computational tasks to their access point, the nature of the multiple access scheme plays a critical role in the system...
SourceID	crossref ieee
SourceType	Enrichment Source Index Database Publisher
StartPage	3927
SubjectTerms	computation offloading Decoding Mobile edge computing multiple access NOMA Performance evaluation resource allocation Resource management Signal processing algorithms Task analysis Time division multiple access
Title	Multiple-Time-Slot Multiple Access Binary Computation Offloading in the K-User Case
URI	https://ieeexplore.ieee.org/document/10637487
Volume	72
WOSCitedRecordID	wos001308206500001&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 Xplore customDbUrl: eissn: 1941-0476 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014496 issn: 1053-587X databaseCode: RIE dateStart: 19910101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NawIxEA2t9NAe-mmp_SKHXnqI7pq42RytVAqlVlDB25JNJiCIFrv293eSXcUeWuhtCQnsvskyb5KZeYQ82IjbBCRnscFYVeTKMcVFxBxYtL6BWEc6iE3IwSCdTtWwKlYPtTAAEJLPoOkfw12-XZq1PyrDPzzx3VLkPtmXUpbFWtsrAyGCGBfyBc46qZxu7iQj1RqPhhgJtkWTC_T-SvzwQTuiKsGn9E_--Tan5Lgij7RbWvuM7MHinBzttBS8IKO3KkOQ-eIONpovC7oZot2gjkifQg0uLQUdgmXou3PzZUinp7MFRVJIX9kEdyftoZerk0n_edx7YZVwAjPIbwqmXSLyttLgtOEdIy2SvjSxaIgUkLFpFWnuMDRButXmibKp4aB5bnSsHTjD-SWpLZYLuCJUxcDzlPuoTwrrjIqFtokRnRQ_HpK8QVobKDNTdRX34hbzLEQXkcoQ_MyDn1XgN8jjdsVH2VHjj7l1j_vOvBLy61_Gb8ihX14ekdySWrFawx05MF_F7HN1H_bLN8j-vZY
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA5aBfXgs2J95uDFQ-ruJvvIsRZLpQ8LbaG3JZsHFEordevvd5LdlnpQ8LaE7LL7TZb5JpmZD6FH5VEV6ZgSX0KsyjJuCKfMI0YrsL7UvvCEE5uI-_1kMuGDsljd1cJorV3yma7bS3eWrxZyZbfK4A-PbLeUeBfthYwFflGutTk0YMzJcQFjoCRM4sn6VNLjz6PhAGLBgNUpA__P2Q8vtCWr4rxK6-Sf73OKjkv6iBuFvc_Qjp6fo6OtpoIXaNgrcwSJLe8gw9kix-sh3HD6iPjFVeHiQtLB2Qa_GzNbuIR6PJ1joIW4Q8awPnET_FwVjVuvo2ablNIJRALDyYkwEcsCLrQRkoYyVkD7kkiBKRINnE1wT1ADwQkQroBGXCWSakEzKXxhtJGUXqLKfDHXVwhzX9MsoTbui5kykvtMqEiyMIGP11FWQ89rKFNZ9hW38haz1MUXHk8B_NSCn5bg19DT5o6PoqfGH3OrFveteQXk17-MP6CD9qjXTbtv_c4NOrSPKjZMblElX670HdqXX_n0c3nv1s430yjA3Q
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=Multiple-Time-Slot+Multiple+Access+Binary+Computation+Offloading+in+the+K-User+Case&rft.jtitle=IEEE+transactions+on+signal+processing&rft.au=Liu%2C+Xiaomeng&rft.au=Davidson%2C+Timothy+N.&rft.date=2024&rft.pub=IEEE&rft.issn=1053-587X&rft.volume=72&rft.spage=3927&rft.epage=3944&rft_id=info:doi/10.1109%2FTSP.2024.3444194&rft.externalDocID=10637487
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1053-587X&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1053-587X&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1053-587X&client=summon