Power Controlled Scheduling with Consecutive Transmission Constraints: Complexity Analysis and Algorithm Design

We study the joint power control and minimum-frame-length scheduling problem in wireless networks, under the physical interference model and subject to consecutive transmission constraints. We start by investigating the complexity of the problem and present the first NP-completeness proof in the lit...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE INFOCOM 2009 s. 1530 - 1538
Hlavní autoři: Fu, L., Liew, S. C., Huang, J.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.04.2009
Témata:
Algorithm design and analysis
Approximation algorithms
Interference constraints
Optimal scheduling
Power control
Power system modeling
Protocols
Scheduling algorithm
Telecommunication traffic
Wireless networks
ISBN:1424435129, 9781424435128
ISSN:0743-166X
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 We study the joint power control and minimum-frame-length scheduling problem in wireless networks, under the physical interference model and subject to consecutive transmission constraints. We start by investigating the complexity of the problem and present the first NP-completeness proof in the literature. We propose a polynomial-time approximation algorithm, called guaranteed and greedy scheduling (GGS) algorithm, to tackle this problem. We prove a bounded approximation ratio of the proposed algorithm relative to the optimal scheduling algorithm. Moreover, the proposed algorithm significantly outperforms the state-of-the-art related algorithm. Interestingly, our algorithm together with its bounded approximation ratio is applicable even when the consecutive transmission constraint is relaxed. To the best of our knowledge, the proposed algorithm is the first known polynomial-time algorithm with a proven bounded approximation ratio for the joint power control and scheduling problem under the physical interference model. We further demonstrate the performance and advantages of our algorithm through extensive simulations.
AbstractList We study the joint power control and minimum-frame-length scheduling problem in wireless networks, under the physical interference model and subject to consecutive transmission constraints. We start by investigating the complexity of the problem and present the first NP-completeness proof in the literature. We propose a polynomial-time approximation algorithm, called guaranteed and greedy scheduling (GGS) algorithm, to tackle this problem. We prove a bounded approximation ratio of the proposed algorithm relative to the optimal scheduling algorithm. Moreover, the proposed algorithm significantly outperforms the state-of-the-art related algorithm. Interestingly, our algorithm together with its bounded approximation ratio is applicable even when the consecutive transmission constraint is relaxed. To the best of our knowledge, the proposed algorithm is the first known polynomial-time algorithm with a proven bounded approximation ratio for the joint power control and scheduling problem under the physical interference model. We further demonstrate the performance and advantages of our algorithm through extensive simulations.
Author Liew, S. C.
Fu, L.
Huang, J.
Author_xml – sequence: 1
  givenname: L.
  surname: Fu
  fullname: Fu, L.
  email: lqfu6@ie.cuhk.edu.hk
  organization: Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Hong Kong
– sequence: 2
  givenname: S. C.
  surname: Liew
  fullname: Liew, S. C.
  email: soung@ie.cuhk.edu.hk
  organization: Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Hong Kong
– sequence: 3
  givenname: J.
  surname: Huang
  fullname: Huang, J.
  email: jwhuang@ie.cuhk.edu.hk
  organization: Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Hong Kong
BookMark eNo1kM1OAjEcxGvERECegEtfYLEf2-6uN7KKkqiYiIk3Utr_Qk23S9pF5O1dFecymfwyc5gB6vnGA0JjSiaUkuJ6_jwrF08TRkgxEUQykpEzNCqynKYsTbmgXJyjwX9gRQ_1SZbyhEr5folGMX6QTqKrUdJHzUtzgIDLxrehcQ4MftVbMHtn_QYfbLv9QRH0vrWfgJdB-VjbGG3jf0EblPVtvOlCvXPwZdsjnnrljtFGrLzBU7dpQjdT41uIduOv0EWlXITRyYfobXa3LB-Sx8X9vJw-JpZmok0EV2tW0WyttGRMQip4qpiUhmlTSc7z1Igqp4pKQYQuoAJFGJGG6iyXwmg-ROO_XQsAq12wtQrH1ekv_g23g2De
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/INFCOM.2009.5062070
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISBN 9781424435135
1424435137
EndPage 1538
ExternalDocumentID 5062070
Genre orig-research
GroupedDBID 23M
29I
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ABLEC
ACGFS
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
IPLJI
M43
OCL
RIE
RIL
RIO
RNS
ID FETCH-LOGICAL-i175t-53ab2f17bac6226e4534a266d2cdf63384d5f81a16505c9efea0206d1c7865dc3
IEDL.DBID RIE
ISBN 1424435129
9781424435128
ISICitedReferencesCount 12
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000275366200171&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0743-166X
IngestDate Wed Aug 27 02:16:42 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-53ab2f17bac6226e4534a266d2cdf63384d5f81a16505c9efea0206d1c7865dc3
PageCount 9
ParticipantIDs ieee_primary_5062070
PublicationCentury 2000
PublicationDate 2009-April
PublicationDateYYYYMMDD 2009-04-01
PublicationDate_xml – month: 04
  year: 2009
  text: 2009-April
PublicationDecade 2000
PublicationTitle IEEE INFOCOM 2009
PublicationTitleAbbrev INFCOM
PublicationYear 2009
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000507010
ssj0008726
Score 1.8374883
Snippet We study the joint power control and minimum-frame-length scheduling problem in wireless networks, under the physical interference model and subject to...
SourceID ieee
SourceType Publisher
StartPage 1530
SubjectTerms Algorithm design and analysis
Approximation algorithms
Interference constraints
Optimal scheduling
Power control
Power system modeling
Protocols
Scheduling algorithm
Telecommunication traffic
Wireless networks
Title Power Controlled Scheduling with Consecutive Transmission Constraints: Complexity Analysis and Algorithm Design
URI https://ieeexplore.ieee.org/document/5062070
WOSCitedRecordID wos000275366200171&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
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB5q8aAXH634Zg8ejU2aZHfjTapFQWvBB72VzT5KoSbSpoL_3p1NUhW8eEuy5MFmMt-X2ZlvAM4ixqQFAuNJE3MvEgq_Oa08mkRdlqIwrquveL1ngwEfjZJhA85XtTBaa5d8pi9w063lq1wuMVTWie2p1kTXYI0xWtZqreIpviU2PkJZ5YU5c63WSglOSkd1UVeICFdrPVX7vJIjCvykczfo9x4fSiHL6n6_Gq843Olv_e-Jt6H9XcBHhito2oGGznZh84f2YAvyIfZHI70yVX2mFXmy709hYvqEYHQWhxZaLtEfEgdp1iQwtuYGXGuJYnFJ0KGgqGbxSWqBEyIyRa5mk3xuL_NGrl2SSBte-jfPvVuv6r7gTS2lKLw4FGnXBCwVklqOpqM4jISFc9WVylD7Zxup2PBABJbjxTLRRgtLPakKJOM0VjLcg2aWZ3ofSCLCNA2p4MqSF0tpuJCCi8RI7LbuU3kALZy68XspsDGuZu3w78NHsFEv6fjBMTSL-VKfwLr8KKaL-amzii86k7JS
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3JTsMwELVKQQIuLAWx4wNHQrPZcbihQtWKNlSioN4qx3aqSiVBbYrE3-NxkgISF25JrCxyJvNexjNvELryg0BoIEgskRBm-VzCN6ekRUPfDWIQxjX1Fa-9IIrYaBQOauh6VQujlDLJZ-oGNs1avszEEkJlTaJP1Sa6htaJ77t2Ua21iqjYmtrYAGalH2aBabZWiHBSOqrKujzAuErtqdxnpSCRY4fNbtRuPfULKcvyjr9arxjkae_875l30cF3CR8erMBpD9VUuo-2f6gPNlA2gA5puFUkq8-UxM_6DUpITZ9giM_C0EKJJXhEbEBNGwVE18yAaS6RL24xuBSQ1cw_cSVxgnkq8d1sks31Zd7wvUkTOUAv7Ydhq2OV_ResqSYVuUU8HruJE8RcUM3SlE88n2tAl66QCdX_tr4kCXO4o1keEaFKFNfkk0pHBIwSKbxDVE-zVB0hHHIvjj3KmdT0RZMaxgVnPEwE9Fu3qThGDZi68XshsTEuZ-3k78OXaLMz7PfGvW70eIq2qgUe2zlD9Xy-VOdoQ3zk08X8wljIF7H4tZk
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%3Abook&rft.genre=proceeding&rft.title=IEEE+INFOCOM+2009&rft.atitle=Power+Controlled+Scheduling+with+Consecutive+Transmission+Constraints%3A+Complexity+Analysis+and+Algorithm+Design&rft.au=Fu%2C+L.&rft.au=Liew%2C+S.+C.&rft.au=Huang%2C+J.&rft.date=2009-04-01&rft.pub=IEEE&rft.isbn=9781424435128&rft.issn=0743-166X&rft.spage=1530&rft.epage=1538&rft_id=info:doi/10.1109%2FINFCOM.2009.5062070&rft.externalDocID=5062070
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0743-166X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0743-166X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0743-166X&client=summon