User Scheduling in Wireless Networks for Deterministic Service: An Efficient Genetic Algorithm Method

To meet the stringent latency and reliability requirements of deterministic service in 5G and beyond networks, we investigate the user selection scheme jointly considering multiple transmission time intervals in a radio access network system with multiple access technology. The objective is to maxim...

Full description

Saved in:
Bibliographic Details
Published in:IEEE networking letters Vol. 6; no. 1; pp. 1 - 5
Main Authors: Zhao, You, Zhu, Yuchao, Wang, Shaowei
Format: Journal Article
Language:English
Published: Piscataway IEEE 01.03.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Deterministic service
genetic algorithm
Genetic algorithms
Greedy algorithms
Interference
MIMO communication
Network latency
NP-hard problem
Optimization
Precoding
radio access network
Radio access networks
Scheduling
User satisfaction
Wireless networks
ISSN:2576-3156, 2576-3156
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract To meet the stringent latency and reliability requirements of deterministic service in 5G and beyond networks, we investigate the user selection scheme jointly considering multiple transmission time intervals in a radio access network system with multiple access technology. The objective is to maximize the number of users that satisfy both data volume and latency requirements. Due to the NP-hardness of the formulated optimization task, we propose an efficient genetic algorithm to find promising user subsets at low complexity. Numerical results demonstrate that our proposal outperforms the compared greedy algorithm and round-robin algorithm, which can provide a guideline for the design of systems with deterministic requirements in practice.
AbstractList To meet the stringent latency and reliability requirements of deterministic service in 5G and beyond networks, we investigate the user selection scheme jointly considering multiple transmission time intervals in a radio access network system with multiple access technology. The objective is to maximize the number of users that satisfy both data volume and latency requirements. Due to the NP-hardness of the formulated optimization task, we propose an efficient genetic algorithm to find promising user subsets at low complexity. Numerical results demonstrate that our proposal outperforms the compared greedy algorithm and round-robin algorithm, which can provide a guideline for the design of systems with deterministic requirements in practice.
Author Zhao, You
Wang, Shaowei
Zhu, Yuchao
Author_xml – sequence: 1
  givenname: You
  orcidid: 0009-0005-6048-3731
  surname: Zhao
  fullname: Zhao, You
  email: youzhao@smail.nju.edu.cn
  organization: School of Electronic Science and Engineering, Nanjing University, Nanjing, China
– sequence: 2
  givenname: Yuchao
  orcidid: 0000-0001-8822-4882
  surname: Zhu
  fullname: Zhu, Yuchao
  email: dz20230030@smail.nju.edu.cn
  organization: School of Electronic Science and Engineering, Nanjing University, Nanjing, China
– sequence: 3
  givenname: Shaowei
  orcidid: 0000-0003-0143-556X
  surname: Wang
  fullname: Wang, Shaowei
  email: wangsw@nju.edu.cn
  organization: School of Electronic Science and Engineering, Nanjing University, Nanjing, China
BookMark eNpNkEFPAjEQhRujiYj8ABMPTTwvtp2F3fVGENEE8QDE46a7nUJx6WJbNP57dwMHMoeZzLz3JvluyKWtLRJyx1mfc5Y9zuaTZV8wAX2AWDR1QTpikAwj4IPh5dl8TXrebxljgsVpkkKH4Mqjo4tyg-pQGbumxtJP47BC7-kcw2_tvjzVtaPPGNDtjDU-mJIu0P2YEp_oyNKJ1qY0aAOdosX2OqrWtTNhs6PvGDa1uiVXWlYee6feJauXyXL8Gs0-pm_j0SwqRTwMkSqKTHFgkGglNUuzNFFcgpbNhikogLNSSplpULKMleYgCqlAZ4ASleDQJQ_H3L2rvw_oQ76tD842L3ORQcpEwpK4UfGjqnS19w51vndmJ91fzlneAs1boHkLND8BbTz3R49BxDM9DDLOAf4BX7l0yg
CODEN INLEBB
Cites_doi 10.1109/PERVASIVE.2015.7087050
10.1109/TCOMM.2006.874008
10.1145/3084041.3084052
10.1109/JSYST.2017.2776401
10.1109/TVT.2021.3110726
10.1109/LCOMM.2003.809993
10.1109/TSP.2006.879269
10.1109/TNET.2018.2867582
10.1038/s41928-019-0355-6
10.1109/CCNC46108.2020.9045219
10.1109/TWC.2020.2969627
10.1109/TVT.2021.3087132
10.1007/s00464-014-3504-z
10.1109/LNET.2023.3262704
10.1109/COMST.2018.2869350
10.1109/LWC.2018.2843372
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2024
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2024
DBID 97E
RIA
RIE
AAYXX
CITATION
7SP
8FD
L7M
DOI 10.1109/LNET.2023.3342424
DatabaseName IEEE Xplore (IEEE)
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Electronics & Communications Abstracts
Technology Research Database
Advanced Technologies Database with Aerospace
DatabaseTitle CrossRef
Technology Research Database
Advanced Technologies Database with Aerospace
Electronics & Communications Abstracts
DatabaseTitleList
Technology Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISSN 2576-3156
EndPage 5
ExternalDocumentID 10_1109_LNET_2023_3342424
10359113
Genre orig-research
GrantInformation_xml – fundername: National Natural Science Foundation of China
  grantid: 61931023
  funderid: 10.13039/501100001809
GroupedDBID 0R~
97E
AAJGR
AASAJ
AAWTH
ABAZT
ABJNI
ABQJQ
ABVLG
AGQYO
AHBIQ
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
EBS
EJD
IFIPE
JAVBF
OCL
RIA
RIE
AAYXX
CITATION
7SP
8FD
L7M
ID FETCH-LOGICAL-c246t-dbb9d13037fdaf08987d1a3fa0370d3b310caaa9f3dac4df132bad3f93eaed213
IEDL.DBID RIE
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001554476500014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2576-3156
IngestDate Sun Nov 30 05:22:43 EST 2025
Sat Nov 29 02:55:34 EST 2025
Wed Aug 27 03:04:37 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 1
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-c246t-dbb9d13037fdaf08987d1a3fa0370d3b310caaa9f3dac4df132bad3f93eaed213
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0009-0005-6048-3731
0000-0001-8822-4882
0000-0003-0143-556X
PQID 2938027074
PQPubID 4437228
PageCount 5
ParticipantIDs proquest_journals_2938027074
ieee_primary_10359113
crossref_primary_10_1109_LNET_2023_3342424
PublicationCentury 2000
PublicationDate 2024-03-01
PublicationDateYYYYMMDD 2024-03-01
PublicationDate_xml – month: 03
  year: 2024
  text: 2024-03-01
  day: 01
PublicationDecade 2020
PublicationPlace Piscataway
PublicationPlace_xml – name: Piscataway
PublicationTitle IEEE networking letters
PublicationTitleAbbrev LNET
PublicationYear 2024
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 ref13
ref12
ref15
ref14
ref11
ref10
ref2
ref1
ref16
ref8
ref7
ref9
ref4
ref3
ref6
ref5
References_xml – ident: ref7
  doi: 10.1109/PERVASIVE.2015.7087050
– ident: ref3
  doi: 10.1109/TCOMM.2006.874008
– ident: ref5
  doi: 10.1145/3084041.3084052
– ident: ref15
  doi: 10.1109/JSYST.2017.2776401
– ident: ref2
  doi: 10.1109/TVT.2021.3110726
– ident: ref4
  doi: 10.1109/LCOMM.2003.809993
– ident: ref16
  doi: 10.1109/TSP.2006.879269
– ident: ref8
  doi: 10.1109/TNET.2018.2867582
– ident: ref11
  doi: 10.1038/s41928-019-0355-6
– ident: ref14
  doi: 10.1109/CCNC46108.2020.9045219
– ident: ref13
  doi: 10.1109/TWC.2020.2969627
– ident: ref1
  doi: 10.1109/TVT.2021.3087132
– ident: ref12
  doi: 10.1007/s00464-014-3504-z
– ident: ref9
  doi: 10.1109/LNET.2023.3262704
– ident: ref10
  doi: 10.1109/COMST.2018.2869350
– ident: ref6
  doi: 10.1109/LWC.2018.2843372
SSID ssj0002048783
Score 2.2626524
Snippet To meet the stringent latency and reliability requirements of deterministic service in 5G and beyond networks, we investigate the user selection scheme jointly...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Index Database
Publisher
StartPage 1
SubjectTerms Deterministic service
genetic algorithm
Genetic algorithms
Greedy algorithms
Interference
MIMO communication
Network latency
NP-hard problem
Optimization
Precoding
radio access network
Radio access networks
Scheduling
User satisfaction
Wireless networks
Title User Scheduling in Wireless Networks for Deterministic Service: An Efficient Genetic Algorithm Method
URI https://ieeexplore.ieee.org/document/10359113
https://www.proquest.com/docview/2938027074
Volume 6
WOSCitedRecordID wos001554476500014&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: 2576-3156
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002048783
  issn: 2576-3156
  databaseCode: RIE
  dateStart: 20190101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8MwDLbYxIELDzHEYKAcOCF1dEtYG24TDHEYFRIb2q1Kk3RMGh3aOn4_dpohEOLArepbdhJ_jj_bABdocrvCKhsQGKUwYxZIoXkgemifcAwp4QiyL8MoSeLJRD75ZHWXC2OtdeQz26ZDF8s3C72mrTKc4fwaJyevQS2KelWy1teGClWgjWLuI5edUF4Nk8GoTe3B25wLSoP4YXtcM5VfK7AzK_d7__yhfdj1-JH1K4UfwJYtDsGOcSCxZ5S_IWL5lM0KRrTWOS5jLKmI3iuG8JTdefaLK8_M_EJxw_oFG7haEvg5RpWo6Wp_Pl0sZ-XrG3t0baYbML4fjG4fAt8_IdBd0SsDk2XSkI2KcqPyMJZxZDqK5wrPhIZniOy0Ukrm3CgtTI6OaaYMzyVH5Zluhx9BvVgU9hgYulWxRuggVcaF5T0pBPUm1xodrtxkURMuN5JN36syGalzL0KZkhpSUkPq1dCEBony242VFJvQ2igj9TNplSIcidF1RqRz8sdjp7CDbxcVMawF9XK5tmewrT_K2Wp57gbJJyfdu94
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFA46Bb34AxWnU3PwJHR2S1wbb0M3JnZFcJPdSpqkczA72Tr_ft9LM1HEg7fSH6TkS_K-l3zvPUIuweQ2uZHGQzKKx4ypJ7hiHm-BfYIxJLkVyL5EQRyHo5F4csHqNhbGGGPFZ6aOl_YsX8_UErfKYIazG5icbJ1sYOksF671taWCOWiDkLmzy4YvrqO4M6hjgfA6YxwDIX5YH1tO5dcabA1Ld_efv7RHdhyDpO0S8n2yZvIDYoYwlOgzIKBRWj6mk5yisHUKCxmNS6n3ggJBpfdO_2ITNFO3VNzSdk47NpsENEcxFzU-bU_Hs_mkeH2jfVto-pAMu53BXc9zFRQ81eStwtNpKjRaqSDTMvNDEQa6IVkm4Y6vWQrcTkkpRca0VFxn4JqmUrNMMIBPNxvsiFTyWW6OCQXHKlRAHoRMGTesJTjH6uRKgcuV6TSokqtVzybvZaKMxDoYvkgQhgRhSBwMVXKIXfntxbIXq6S2AiNxc2mRACEJwXkGrnPyx2cXZKs36EdJ9BA_npJtaImXMrEaqRTzpTkjm-qjmCzm53bAfAIbPb8n
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=User+Scheduling+in+Wireless+Networks+for+Deterministic+Service%3A+An+Efficient+Genetic+Algorithm+Method&rft.jtitle=IEEE+networking+letters&rft.au=Zhao%2C+You&rft.au=Zhu%2C+Yuchao&rft.au=Wang%2C+Shaowei&rft.date=2024-03-01&rft.pub=IEEE&rft.eissn=2576-3156&rft.volume=6&rft.issue=1&rft.spage=1&rft.epage=5&rft_id=info:doi/10.1109%2FLNET.2023.3342424&rft.externalDocID=10359113
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2576-3156&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2576-3156&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2576-3156&client=summon