Delay-Optimal Back-Pressure Routing Algorithm for Multihop Wireless Networks

Although the back-pressure (BP) algorithm has been proven to be a throughput-optimal policy for traffic scheduling and routing in wireless networks, the optimal control of delays in the BP algorithm remains an open problem, especially for conventional multihop networks. To enhance the delay performa...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on vehicular technology Ročník 67; číslo 3; s. 2617 - 2630
Hlavní autoři: Hai, Long, Gao, Qinghua, Wang, Jie, Zhuang, He, Wang, Ping
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.03.2018
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
ISSN:0018-9545, 1939-9359
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Although the back-pressure (BP) algorithm has been proven to be a throughput-optimal policy for traffic scheduling and routing in wireless networks, the optimal control of delays in the BP algorithm remains an open problem, especially for conventional multihop networks. To enhance the delay performance, we proposed an improved BP algorithm called sojourn-time-based BP (STBP) by introducing a novel delay metric called the sojourn time backlog (STB). The STB considers the queue length and accumulated packet delays comprehensively. It provides more pressure to push forward flows suffering from greater delays. Based on this new metric, the calculation of the routing weight for each packet is determined for maximizing the difference of the STB in the routing process. The proposed routing algorithm is robust and distributed, and does not require any prior knowledge of network connections and load conditions. We analyze the network stability with delay considerations and prove the throughput optimality of the STBP in multihop networks. Simulation results reveal that the enhanced algorithm effectively improves the end-to-end delay while ensuring throughput optimality.
AbstractList Although the back-pressure (BP) algorithm has been proven to be a throughput-optimal policy for traffic scheduling and routing in wireless networks, the optimal control of delays in the BP algorithm remains an open problem, especially for conventional multihop networks. To enhance the delay performance, we proposed an improved BP algorithm called sojourn-time-based BP (STBP) by introducing a novel delay metric called the sojourn time backlog (STB). The STB considers the queue length and accumulated packet delays comprehensively. It provides more pressure to push forward flows suffering from greater delays. Based on this new metric, the calculation of the routing weight for each packet is determined for maximizing the difference of the STB in the routing process. The proposed routing algorithm is robust and distributed, and does not require any prior knowledge of network connections and load conditions. We analyze the network stability with delay considerations and prove the throughput optimality of the STBP in multihop networks. Simulation results reveal that the enhanced algorithm effectively improves the end-to-end delay while ensuring throughput optimality.
Author Hai, Long
Gao, Qinghua
Zhuang, He
Wang, Ping
Wang, Jie
Author_xml – sequence: 1
  givenname: Long
  orcidid: 0000-0001-8945-4153
  surname: Hai
  fullname: Hai, Long
  email: longhai@szu.edu.cn
  organization: College of Information Engineering, Shenzhen University, Shenzhen, China
– sequence: 2
  givenname: Qinghua
  surname: Gao
  fullname: Gao, Qinghua
  email: qhgao@dlut.edu.cn
  organization: Faculty of Electronic Information and Electrical Engineering, Dalian University of Technology, Dalian, China
– sequence: 3
  givenname: Jie
  orcidid: 0000-0003-1172-1551
  surname: Wang
  fullname: Wang, Jie
  email: wangjie@dlut.edu.cn
  organization: Faculty of Electronic Information and Electrical Engineering, Dalian University of Technology, Dalian, China
– sequence: 4
  givenname: He
  orcidid: 0000-0003-0408-7302
  surname: Zhuang
  fullname: Zhuang, He
  email: zhuang@ohtsuki.ics.keio.ac.jp
  organization: Faculty of Graduate School of Science and Technology, Keio University, Yokohama, Japan
– sequence: 5
  givenname: Ping
  orcidid: 0000-0002-8723-1498
  surname: Wang
  fullname: Wang, Ping
  email: wangping@szu.edu.cn
  organization: College of Information Engineering, Shenzhen University, Shenzhen, China
BookMark eNp9kD1PwzAQhi1UJEphR2KJxJzijziJx1I-pUIRKjBGjnNp3aZxsR2h_ntctWJgYLLO9z53uucU9VrTAkIXBA8JweJ69jEbUkyyIc0yTHJ2hPpEMBELxkUP9XH4iwVP-Ak6dW4ZyiQRpI8mt9DIbTzdeL2WTXQj1Sp-teBcZyF6M53X7TwaNXNjtV-so9rY6LlrvF6YTfSpLTQhGr2A_zZ25c7QcS0bB-eHd4De7-9m48d4Mn14Go8msWI887GsSg6kojXNKagSEpmmPGWyrnNKMoLTUgkqRZoriSuQoQey5JxVnNThJMUG6Go_d2PNVwfOF0vT2TasLIICTkhOcxFS6T6lrHHOQl0o7aXXpvVW6qYguNiZK4K5HZYVB3MBxH_AjQ127PY_5HKPaAD4jedYZJgm7Ae7X3vJ
CODEN ITVTAB
CitedBy_id crossref_primary_10_1049_iet_com_2019_0371
crossref_primary_10_3390_aerospace11030191
crossref_primary_10_1109_TMC_2024_3487020
crossref_primary_10_1049_iet_net_2018_5085
crossref_primary_10_1007_s00607_021_00973_3
crossref_primary_10_1016_j_comnet_2023_109863
crossref_primary_10_3390_s21227706
crossref_primary_10_1109_ACCESS_2020_2968524
crossref_primary_10_1109_JIOT_2021_3049999
crossref_primary_10_1016_j_jnca_2021_103248
crossref_primary_10_1109_TMC_2023_3276697
crossref_primary_10_1016_j_comcom_2019_07_004
crossref_primary_10_1109_TVT_2022_3206616
crossref_primary_10_1007_s11276_024_03739_9
crossref_primary_10_1016_j_phycom_2022_101707
crossref_primary_10_1016_j_icte_2024_09_004
crossref_primary_10_3390_s23249789
Cites_doi 10.1109/GLOCOM.2016.7842330
10.1109/ISIT.2011.6034178
10.1109/TVT.2016.2518185
10.1109/ALLERTON.2009.5394872
10.1109/INMIC.2001.995315
10.1109/TWC.2012.030512.110828
10.1109/TNET.2013.2291793
10.1109/TVT.2015.2417810
10.1007/11533719_16
10.1109/TMC.2016.2613529
10.1109/9.182479
10.1109/ICC.2014.6883750
10.1109/TNET.2015.2404852
10.1186/s13638-015-0260-2
10.1109/GLOCOM.2014.7037581
10.1016/j.tcs.2009.05.031
10.1109/INFOCOM.2015.7218603
10.1109/INFCOM.2009.5062089
10.1109/TWC.2014.2316168
10.1109/TMC.2015.2478456
10.1109/MCSA.1999.749281
10.1109/JSAC.2004.837349
10.1109/TNET.2010.2094204
10.1109/VTCFall.2015.7390894
10.1109/MWC.2016.7422412
10.1145/1161089.1161116
10.1109/TPDS.2016.2556670
10.1109/TNET.2012.2227790
10.1145/1791212.1791246
10.1016/j.tcs.2009.05.013
10.1109/TNET.2015.2404331
10.1109/18.212277
10.1109/TVT.2014.2307076
10.1109/TNET.2012.2191157
10.1109/26.780463
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2018
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2018
DBID 97E
RIA
RIE
AAYXX
CITATION
7SP
8FD
FR3
KR7
L7M
DOI 10.1109/TVT.2017.2770183
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
Electronics & Communications Abstracts
Technology Research Database
Engineering Research Database
Civil Engineering Abstracts
Advanced Technologies Database with Aerospace
DatabaseTitle CrossRef
Civil Engineering Abstracts
Engineering Research Database
Technology Research Database
Advanced Technologies Database with Aerospace
Electronics & Communications Abstracts
DatabaseTitleList Civil Engineering Abstracts

Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library (IEL) (UW System Shared)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1939-9359
EndPage 2630
ExternalDocumentID 10_1109_TVT_2017_2770183
8097024
Genre orig-research
GrantInformation_xml – fundername: Scientific Research Staring Foundation
  grantid: JCYJ20150324141711694
– fundername: National Natural Science Foundation of China; Natural Science Foundation of China
  grantid: 61701314; 61671102; 61401059; 61402293; 61401057; 61602316
  funderid: 10.13039/501100001809
– fundername: Fundamental Research Funds for the Central Universities
  grantid: DUT16QY33
  funderid: 10.13039/501100012226
– fundername: Seed Funding from Scientific and Technical Innovation Council of Shenzhen Government
  grantid: 827-000035
– fundername: China Postdoctoral Science Foundation
  grantid: 2017M612733
  funderid: 10.13039/501100002858
GroupedDBID -~X
.DC
0R~
29I
3EH
4.4
5GY
5VS
6IK
97E
AAIKC
AAJGR
AAMNW
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFO
ACGFS
ACIWK
ACNCT
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
EJD
HZ~
H~9
IAAWW
IBMZZ
ICLAB
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
MS~
O9-
OCL
P2P
RIA
RIE
RNS
RXW
TAE
TN5
VH1
AAYXX
CITATION
7SP
8FD
FR3
KR7
L7M
RIG
ID FETCH-LOGICAL-c357t-adb5e1d2f282ecbe4a66563aff8217106bc92a968ca0dea656eab553d51f939c3
IEDL.DBID RIE
ISICitedReferencesCount 33
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000427863000063&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0018-9545
IngestDate Mon Jun 30 10:20:34 EDT 2025
Sat Nov 29 02:18:27 EST 2025
Tue Nov 18 21:59:35 EST 2025
Wed Aug 27 08:34:59 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c357t-adb5e1d2f282ecbe4a66563aff8217106bc92a968ca0dea656eab553d51f939c3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0003-0408-7302
0000-0002-8723-1498
0000-0003-1172-1551
0000-0001-8945-4153
PQID 2015118289
PQPubID 85454
PageCount 14
ParticipantIDs crossref_citationtrail_10_1109_TVT_2017_2770183
proquest_journals_2015118289
ieee_primary_8097024
crossref_primary_10_1109_TVT_2017_2770183
PublicationCentury 2000
PublicationDate 2018-03-01
PublicationDateYYYYMMDD 2018-03-01
PublicationDate_xml – month: 03
  year: 2018
  text: 2018-03-01
  day: 01
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on vehicular technology
PublicationTitleAbbrev TVT
PublicationYear 2018
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
ref13
ref34
ref12
ref37
ref15
ref36
ref14
ref30
ref33
ref32
ref10
ref2
ref1
dvir (ref11) 2011; 41
ref17
ref38
ref16
ref19
ref18
mekkittikul (ref20) 1996
neely (ref31) 2003
ref24
ref23
ref26
ref25
ref22
ref21
ref28
ref27
ref29
ref8
ref7
ref9
ref4
ref3
ref6
ref5
References_xml – ident: ref3
  doi: 10.1109/GLOCOM.2016.7842330
– ident: ref32
  doi: 10.1109/ISIT.2011.6034178
– ident: ref37
  doi: 10.1109/TVT.2016.2518185
– ident: ref19
  doi: 10.1109/ALLERTON.2009.5394872
– ident: ref34
  doi: 10.1109/INMIC.2001.995315
– ident: ref6
  doi: 10.1109/TWC.2012.030512.110828
– ident: ref2
  doi: 10.1109/TNET.2013.2291793
– ident: ref38
  doi: 10.1109/TVT.2015.2417810
– ident: ref29
  doi: 10.1007/11533719_16
– ident: ref27
  doi: 10.1109/TMC.2016.2613529
– ident: ref25
  doi: 10.1109/9.182479
– ident: ref10
  doi: 10.1109/ICC.2014.6883750
– ident: ref17
  doi: 10.1109/TNET.2015.2404852
– ident: ref18
  doi: 10.1186/s13638-015-0260-2
– ident: ref23
  doi: 10.1109/GLOCOM.2014.7037581
– volume: 41
  start-page: 405
  year: 2011
  ident: ref11
  article-title: Backpressure-based routing protocol for DTNs
  publication-title: SIGCOMM Comput Commun Rev
– start-page: 226
  year: 1996
  ident: ref20
  article-title: A starvation free algorithm for achieving 100% throughput in an input-queued
  publication-title: Proc Int Conf Netw Commun
– ident: ref28
  doi: 10.1016/j.tcs.2009.05.031
– ident: ref4
  doi: 10.1109/INFOCOM.2015.7218603
– ident: ref8
  doi: 10.1109/INFCOM.2009.5062089
– ident: ref35
  doi: 10.1109/TWC.2014.2316168
– year: 2003
  ident: ref31
  article-title: Dynamic power allocation and routing for satellite and wireless networks with time-varying channels
– ident: ref5
  doi: 10.1109/TMC.2015.2478456
– ident: ref33
  doi: 10.1109/MCSA.1999.749281
– ident: ref12
  doi: 10.1109/JSAC.2004.837349
– ident: ref13
  doi: 10.1109/TNET.2010.2094204
– ident: ref16
  doi: 10.1109/VTCFall.2015.7390894
– ident: ref1
  doi: 10.1109/MWC.2016.7422412
– ident: ref24
  doi: 10.1145/1161089.1161116
– ident: ref7
  doi: 10.1109/TPDS.2016.2556670
– ident: ref9
  doi: 10.1109/TNET.2012.2227790
– ident: ref14
  doi: 10.1145/1791212.1791246
– ident: ref30
  doi: 10.1016/j.tcs.2009.05.013
– ident: ref15
  doi: 10.1109/TNET.2015.2404331
– ident: ref26
  doi: 10.1109/18.212277
– ident: ref36
  doi: 10.1109/TVT.2014.2307076
– ident: ref22
  doi: 10.1109/TNET.2012.2191157
– ident: ref21
  doi: 10.1109/26.780463
SSID ssj0014491
Score 2.4301982
Snippet Although the back-pressure (BP) algorithm has been proven to be a throughput-optimal policy for traffic scheduling and routing in wireless networks, the...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 2617
SubjectTerms Algorithms
Back-pressure algorithm
Computer simulation
Delay
delay optimal control
Delays
Heuristic algorithms
Knowledge management
Markov analysis
multi-hop networks
Optimal control
Optimization
Queues
Routing
Spread spectrum communication
Stability analysis
Throughput
Traffic delay
Wireless networks
Title Delay-Optimal Back-Pressure Routing Algorithm for Multihop Wireless Networks
URI https://ieeexplore.ieee.org/document/8097024
https://www.proquest.com/docview/2015118289
Volume 67
WOSCitedRecordID wos000427863000063&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/IET Electronic Library (IEL) (UW System Shared)
  customDbUrl:
  eissn: 1939-9359
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0014491
  issn: 0018-9545
  databaseCode: RIE
  dateStart: 19670101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB5q8aAHX1WsVsnBi-C2eW_2WB_Fg1QPVXoLm83GFtOmpKngv3d2kwZFEbwFZgaWb3d2ZrLzALhAC0UtizvEtXhC0EIlhLmuRzzOHI9aXPV40sMm6HAYjMfsqQFXdS2MlFInn8mu-tRv-XEmVupXWS8wGUWbsgEblPplrVb9YuC61XQ8CxUY3YL1k6TJeqOXkcrhol2bUiQ730yQnqny4yLW1mWw-7917cFO5UUa_XLb96Eh5wew_aW3YAsebmXKP8gjXgkzZL3m4o2UtYC5NFQeEHIZ_fQ1y6fFZGag72roYtxJtjBUSmyKrMawTBJfHsLz4G50c0-q0QlEIMQF4XHkSSu2E4yopIiky3103ByeJAHGIBgGRoLZnPmB4GYsOdIkjzzPiT0rYQ4TzhE059lcHoOB5NgSyChFgNpuBwGLeeQz9AyoHzPeht4azVBUfcXVeIs01PGFyULEP1T4hxX-bbisJRZlT40_eFsK75qvgroNnfWGhZXSLZWcjpcCdvK71Cls2ep86BSyDjSLfCXPYFO8F9Nlfq7P0ycU58fN
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB5qFdSDrypWq-bgRXDbvJM91kepWKOHKr2FzWZji32RtoL_3tlNGhRF8BaYGVi-3dmZyc4D4BwtlGcYzCK2wRKCFioh1LYd4jBqOZ7BZI8nNWzCCwK_16NPJbgsamGEECr5TNTlp3rLjyd8IX-VNXydemhTVmDVsW1Tz6q1ijcD287n4xmowugYLB8lddrovnRlFpdXNz0PydY3I6Smqvy4ipV9aW3_b2U7sJX7kVoz2_hdKInxHmx-6S5Ygc6NGLIP8oiXwghZrxh_I1k1YCo0mQmEXFpz-DpJB_P-SEPvVVPluP3JVJNJsUNk1YIsTXy2D8-t2-51m-TDEwhHkOeExZEjjNhMMKYSPBI2c9F1s1iS-BiFYCAYcWoy6vqc6bFgSBMschwrdoyEWpRbB1AeT8biEDQkxwZHRsF91HfT92nMIpeib-C5MWVVaCzRDHneWVwOuBiGKsLQaYj4hxL_MMe_CheFxDTrqvEHb0XiXfDlUFehttywMFe7mZRTEZNPj36XOoP1dvehE3bugvtj2DDlWVEJZTUoz9OFOIE1_j4fzNJTdbY-AaHryxQ
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=Delay-Optimal+Back-Pressure+Routing+Algorithm+for+Multihop+Wireless+Networks&rft.jtitle=IEEE+transactions+on+vehicular+technology&rft.au=Hai%2C+Long&rft.au=Gao%2C+Qinghua&rft.au=Wang%2C+Jie&rft.au=Zhuang%2C+He&rft.date=2018-03-01&rft.pub=IEEE&rft.issn=0018-9545&rft.volume=67&rft.issue=3&rft.spage=2617&rft.epage=2630&rft_id=info:doi/10.1109%2FTVT.2017.2770183&rft.externalDocID=8097024
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9545&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9545&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9545&client=summon