Optimal Distributed Scheduling under Time-Varying Conditions: A Fast-CSMA Algorithm with Applications
Recently, low-complexity and distributed Carrier Sense Multiple Access (CSMA)-based scheduling algorithms have attracted extensive interest due to their throughput-optimal characteristics in general network topologies. However, these algorithms are not well-suited for time-varying environments (i.e....
Uloženo v:
| Vydáno v: | IEEE transactions on wireless communications Ročník 12; číslo 7; s. 3278 - 3288 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
New York, NY
IEEE
01.07.2013
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Témata: | |
| ISSN: | 1536-1276, 1558-2248 |
| 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 | Recently, low-complexity and distributed Carrier Sense Multiple Access (CSMA)-based scheduling algorithms have attracted extensive interest due to their throughput-optimal characteristics in general network topologies. However, these algorithms are not well-suited for time-varying environments (i.e., serving real-time traffic under time-varying channel conditions in wireless networks) for two reasons: (1) the mixing time of the underlying CSMA Markov Chain grows with the size of the network, which, for large networks, generates unacceptable delay for deadline-constrained traffic; (2) since the dynamic CSMA parameters are influenced by the arrival and channel state processes, the underlying CSMA Markov Chain may not converge to a steady-state under strict deadline constraints and fading channel conditions. In this paper, we attack the problem of distributed scheduling for time-varying environments. Specifically, we propose a Fast-CSMA (FCSMA) policy in fully-connected topologies, which converges much faster than the existing CSMA algorithms and thus yields significant advantages for time-varying applications. Then, we design optimal policies based on FCSMA techniques in two challenging and important scenarios in wireless networks for scheduling inelastic traffic with/without channel state information (CSI) over wireless fading channels. |
|---|---|
| AbstractList | Recently, low-complexity and distributed Carrier Sense Multiple Access (CSMA)-based scheduling algorithms have attracted extensive interest due to their throughput-optimal characteristics in general network topologies. However, these algorithms are not well-suited for time-varying environments (i.e., serving real-time traffic under time-varying channel conditions in wireless networks) for two reasons: (1) the mixing time of the underlying CSMA Markov Chain grows with the size of the network, which, for large networks, generates unacceptable delay for deadline-constrained traffic; (2) since the dynamic CSMA parameters are influenced by the arrival and channel state processes, the underlying CSMA Markov Chain may not converge to a steady-state under strict deadline constraints and fading channel conditions. In this paper, we attack the problem of distributed scheduling for time-varying environments. Specifically, we propose a Fast-CSMA (FCSMA) policy in fully-connected topologies, which converges much faster than the existing CSMA algorithms and thus yields significant advantages for time-varying applications. Then, we design optimal policies based on FCSMA techniques in two challenging and important scenarios in wireless networks for scheduling inelastic traffic with/without channel state information (CSI) over wireless fading channels. |
| Author | Eryilmaz, A. Bin Li |
| Author_xml | – sequence: 1 surname: Bin Li fullname: Bin Li email: lib@ece.osu.edu organization: Dept. of Electr. & Comput. Eng., Ohio State Univ., Columbus, OH, USA – sequence: 2 givenname: A. surname: Eryilmaz fullname: Eryilmaz, A. email: eryilmaz@ece.osu.edu organization: Dept. of Electr. & Comput. Eng., Ohio State Univ., Columbus, OH, USA |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=27599902$$DView record in Pascal Francis |
| BookMark | eNqFkU1rFTEUhgepYFv9BYIERHAzt_nORNwMo9VCpYtedRlyk0ybkpsZkwzSf29up7roxkU-CM97kpPnpDmKU3RN8wbBDUJQnm1_DhsMEdlAjmldEEYIs2fNMWKsazGm3dFhT3iLsOAvmpOc7yBEgjN23Lirufi9DuCTzyX53VKcBdfm1tkl-HgDlmhdAlu_d-0Pne4PR8MUrS9-ivkD6MG5zqUdrr_1oA83U_Lldg9-1xn08xy80Q_gy-b5qEN2rx7X0-b7-eft8LW9vPpyMfSXrSGcl9Yhy6nBdCdrB47vUEdHwpGx3DLNqJWIW47IyPgoHKHSEkepkBTujNCd6chp836tO6fp1-JyUXufjQtBRzctWSGKZS1CBazo2yfo3bSkWF9XKSTq6CCp1LtHSmejw5h0ND6rOdU_S_cKCyalhLhyH1fOpCnn5EZlfHnovSTtg0JQHVyp6kodXKnVlVpd1Th_Ev97w3-Dr9egd879C1WzuCOC_AEtjKFU |
| CODEN | ITWCAX |
| CitedBy_id | crossref_primary_10_1016_j_future_2015_10_021 crossref_primary_10_1109_TNET_2014_2333008 crossref_primary_10_1109_TVT_2016_2625326 crossref_primary_10_1109_TWC_2017_2653113 crossref_primary_10_1109_TNET_2014_2301170 crossref_primary_10_1109_TNET_2022_3228173 crossref_primary_10_1109_JIOT_2016_2573679 crossref_primary_10_1109_TMC_2014_2346757 crossref_primary_10_1016_j_inffus_2016_11_008 crossref_primary_10_1109_TIT_2017_2773542 crossref_primary_10_1109_LCOMM_2016_2547951 crossref_primary_10_1109_TNET_2015_2470076 crossref_primary_10_1109_TWC_2019_2951564 crossref_primary_10_1109_TNET_2015_2503394 crossref_primary_10_1109_TWC_2021_3109427 crossref_primary_10_1007_s11235_017_0275_6 crossref_primary_10_1145_3224429 crossref_primary_10_1109_TNET_2015_2432119 crossref_primary_10_1109_TNET_2022_3223315 crossref_primary_10_1016_j_comcom_2023_08_010 crossref_primary_10_1145_3292040_3219626 |
| Cites_doi | 10.1109/TNET.2011.2172953 10.1109/CDC.2010.5717965 10.1109/INFCOM.2011.5935086 10.1109/INFCOM.2011.5935124 10.1109/CISS.2008.4558577 10.1109/INFCOM.2010.5462090 10.2307/1427479 10.1109/ISIT.2010.5513290 10.1109/CDC.2007.4434819 10.1007/978-3-031-79995-2 10.1109/TNET.2009.2030681 10.1109/INFCOM.2003.1208724 10.1109/18.212277 10.1109/9.182479 10.1145/1555349.1555365 10.1109/TNET.2009.2035046 10.1109/18.568722 10.1214/aoap/1177004828 10.1109/TIT.2011.2168897 10.1109/INFCOM.2009.5061954 10.1109/JSAC.2011.110508 10.1109/TNET.2004.842226 |
| ContentType | Journal Article |
| Copyright | 2014 INIST-CNRS Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jul 2013 |
| Copyright_xml | – notice: 2014 INIST-CNRS – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jul 2013 |
| DBID | 97E RIA RIE AAYXX CITATION IQODW 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| DOI | 10.1109/TWC.2013.062413.121125 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Pascal-Francis 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 ANTE: Abstracts in New Technology & Engineering Engineering Research Database |
| 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 Engineering Research Database ANTE: Abstracts in New Technology & Engineering |
| DatabaseTitleList | Technology Research Database 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 Applied Sciences |
| EISSN | 1558-2248 |
| EndPage | 3288 |
| ExternalDocumentID | 3035287561 27599902 10_1109_TWC_2013_062413_121125 6552837 |
| Genre | orig-research |
| 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 IQODW RIG 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| ID | FETCH-LOGICAL-c366t-e1d64c24b9112e6b184f361cd6d5a54d916d613f56f7e349d3e447940bc7a8c83 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 35 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000322661200015&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 | Sat Sep 27 21:55:45 EDT 2025 Mon Jun 30 10:20:04 EDT 2025 Mon Jul 21 09:17:26 EDT 2025 Sat Nov 29 02:55:04 EST 2025 Tue Nov 18 22:36:02 EST 2025 Wed Aug 27 02:52:42 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 7 |
| Keywords | Parameter estimation Wireless telecommunication Network architecture Information rate Time variation Optimal design Convergence speed Markov chain Topological structure Carrier sense multiple access Channel estimation Convergence rate Delay time Optimal planning CSMA Fast algorithm Fading channels Fading wireless fading Time variable channel Scheduling Steady state Information transmission distributed algorithm Telecommunication channels Wireless network deadline-constrained scheduling |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c366t-e1d64c24b9112e6b184f361cd6d5a54d916d613f56f7e349d3e447940bc7a8c83 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 content type line 23 |
| PQID | 1417141803 |
| PQPubID | 105736 |
| PageCount | 11 |
| ParticipantIDs | pascalfrancis_primary_27599902 crossref_primary_10_1109_TWC_2013_062413_121125 ieee_primary_6552837 crossref_citationtrail_10_1109_TWC_2013_062413_121125 proquest_miscellaneous_1429916470 proquest_journals_1417141803 |
| PublicationCentury | 2000 |
| PublicationDate | 2013-07-01 |
| PublicationDateYYYYMMDD | 2013-07-01 |
| PublicationDate_xml | – month: 07 year: 2013 text: 2013-07-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York, NY |
| PublicationPlace_xml | – name: New York, NY – name: New York |
| PublicationTitle | IEEE transactions on wireless communications |
| PublicationTitleAbbrev | TWC |
| PublicationYear | 2013 |
| Publisher | IEEE Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: Institute of Electrical and Electronics Engineers – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref13 ref12 ref14 shakkottai (ref6) 2002; 207 ref30 ref11 ref2 ref17 ref16 ref19 ref18 bertsekas (ref27) 2007 tassiulas (ref23) 0 li (ref15) 2012 ref26 ref25 ref22 li (ref28) 0 ref21 lin (ref20) 0 neely (ref24) 2010 ref29 ref8 ref7 ref9 ref4 ref3 ref5 li (ref1) 0 ni (ref10) 0 |
| References_xml | – year: 0 ident: ref10 article-title: Q-CSMAa: queue length-based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks publication-title: Proc 2010 IEEE International Conference on Computer Communications – year: 0 ident: ref28 article-title: On the boundaries of randomization for throughput-optimal scheduling in wireless networks publication-title: Proc 2010 Allerton Conference on Communication Control and Computing – ident: ref29 doi: 10.1109/TNET.2011.2172953 – ident: ref11 doi: 10.1109/CDC.2010.5717965 – ident: ref8 doi: 10.1109/INFCOM.2011.5935086 – ident: ref14 doi: 10.1109/INFCOM.2011.5935124 – volume: 207 start-page: 185 year: 2002 ident: ref6 article-title: Scheduling for multiple flows sharing a time-varying channel: the exponential rule publication-title: Translations of the AMS Series 2 A volume in memory of F Karpelevich – ident: ref22 doi: 10.1109/CISS.2008.4558577 – ident: ref17 doi: 10.1109/INFCOM.2010.5462090 – ident: ref30 doi: 10.2307/1427479 – year: 2007 ident: ref27 publication-title: Dynamic Programming and Optimal Control – ident: ref19 doi: 10.1109/ISIT.2010.5513290 – ident: ref21 doi: 10.1109/CDC.2007.4434819 – year: 2010 ident: ref24 publication-title: Stochastic Network Optimization with Aapplication to Communication and Queueing Systems Morgan & Claypool doi: 10.1007/978-3-031-79995-2 – ident: ref7 doi: 10.1109/TNET.2009.2030681 – ident: ref5 doi: 10.1109/INFCOM.2003.1208724 – year: 0 ident: ref1 article-title: A fast-csma algorithm for deadline-constrained scheduling over wireless fading channels publication-title: Proc 2011 International Workshop on Resource Allocation and Cooperation in Wireless Networks – ident: ref3 doi: 10.1109/18.212277 – ident: ref2 doi: 10.1109/9.182479 – year: 0 ident: ref23 article-title: Linear complexity algorithms for maximum throughput in radio networksand input queued switches publication-title: Proc 1998 IEEE International Conference on Computer Communications – ident: ref12 doi: 10.1145/1555349.1555365 – year: 2012 ident: ref15 article-title: Optimal distributed scheduling under time-varying conditions: a fast-CSMA algorithm with applications – ident: ref9 doi: 10.1109/TNET.2009.2035046 – ident: ref26 doi: 10.1109/18.568722 – ident: ref25 doi: 10.1214/aoap/1177004828 – ident: ref13 doi: 10.1109/TIT.2011.2168897 – ident: ref16 doi: 10.1109/INFCOM.2009.5061954 – ident: ref18 doi: 10.1109/JSAC.2011.110508 – ident: ref4 doi: 10.1109/TNET.2004.842226 – year: 0 ident: ref20 article-title: The impact of imperfect scheduling on cross-layer rate control in multihop wireless networks publication-title: Proc 2005 IEEE International Conference on Computer Communications |
| SSID | ssj0017655 |
| Score | 2.2810068 |
| Snippet | Recently, low-complexity and distributed Carrier Sense Multiple Access (CSMA)-based scheduling algorithms have attracted extensive interest due to their... |
| SourceID | proquest pascalfrancis crossref ieee |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 3278 |
| SubjectTerms | Algorithm design and analysis Algorithms Applied sciences Channels CSMA deadline-constrained scheduling Detection, estimation, filtering, equalization, prediction distributed algorithm Exact sciences and technology Fading Information, signal and communications theory Markov analysis Markov processes Multiaccess communication Networks Organization and planning of networks (techniques and equipments) Policies Schedules Scheduling Signal and communications theory Signal, noise Studies Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Traffic engineering Traffic flow Transmission and modulation (techniques and equipments) Wireless communication wireless fading Wireless networks |
| Title | Optimal Distributed Scheduling under Time-Varying Conditions: A Fast-CSMA Algorithm with Applications |
| URI | https://ieeexplore.ieee.org/document/6552837 https://www.proquest.com/docview/1417141803 https://www.proquest.com/docview/1429916470 |
| Volume | 12 |
| WOSCitedRecordID | wos000322661200015&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/eLvHCXMwlV1Nb9QwEB21FQc4lI-CSFsqI3EkXSdOxjG3aGHFAQpSS-ktcmK7VGo3VTbb31-Pk0aLQELcItlWojx_zHhm3gN4J7yJIExax8Zw5x0U52LlkjxuFGoslBRN0Do8_yJPToqLC_V9C95PtTDW2pB8Zo_pMcTyTdus6apshjlRkcht2JYSh1qtKWIgMSic-gVMujISx2rghKvZ2c855XCJY44URSJChYSksTcOoqCsQnmReuV_jRs0Lf7YnsOZs3j6f1_7DHZH25KVw2R4Dlt2-QKebDAO7oH95reIG9_pIxHmktaVNezUA2coI_2SUUlZx6guJD7XHZVAsXlLUW2anR9YyRZ61cfz068lK68v2-6q_3XD6C6XlRuR8JfwY_HpbP45HpUW4kYg9rFNDGYeldpvfanF2rt9TmDSGDS5zjPjbUjjz32Xo5NWZMoImxE1Pa8bqYumEK9gZ9ku7WtgymUajeKonXe-rFNZ4rwXUkhhUaCoI8gffnvVjDTkpIZxXQV3hKvKw1URXNUAVzXAFcFsGnc7EHH8c8QegTL1HvGI4Og3lKf2VObeWuZpBIcPsFfjgl55D4mU4pOCiwjeTs1-KVJ8RS9tu6Y-KVnbmeT7f3_1ATxOg5oGZfsewk7fre0beNTc9Ver7ijM53ue_u-x |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Lb9QwEB6VggQceLWIQClG4ki6TuzYMbdoYVXEdkHqUnqLEj9KpXaDsll-Px4njRaBhLhFsq1E-fyY8cx8H8Ab5k0EZtI6NoY676A4FyuXZLFWohK5kkwHrcOzuVws8vNz9WUH3o61MNbakHxmj_AxxPJNozd4VTYRGVKRyFtwO-M8pX211hgzkCJonPoljMoyUgz1wAlVk-W3KWZxsSMqMI6ElAoJimNvHUVBWwUzI6u1_zmuV7X4Y4MOp87s4f997yN4MFiXpOinw2PYsasncH-Lc3AP7Ge_SVz7Tu-RMhfVrqwhpx46gznpFwSLylqClSHxWdViERSZNhjXxvn5jhRkVq27eHp6UpDi6qJpL7vv1wRvc0mxFQvfh6-zD8vpcTxoLcSaCdHFNjGCe1xqv_mlVtTe8XNMJNoIk1UZN96KNP7kd5lw0jKuDLMcyelprWWV65w9hd1Vs7LPgCjHK2EUFZXz7pd1iifO-yG5ZFYwweoIspvfXuqBiBz1MK7K4JBQVXq4SoSr7OEqe7gimIzjfvRUHP8csYegjL0HPCI4_A3lsT2VmbeXaRrBwQ3s5bCk195HQq34JKcsgtdjs1-MGGGpVrbZYJ8U7W0u6fO_v_oV3D1enszL-cfFpxdwLw3aGpj7ewC7XbuxL-GO_tldrtvDMLd_ATuV8vg |
| 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=Optimal+Distributed+Scheduling+under+Time-Varying+Conditions%3A+A+Fast-CSMA+Algorithm+with+Applications&rft.jtitle=IEEE+transactions+on+wireless+communications&rft.au=Li%2C+Bin&rft.au=Eryilmaz%2C+Atilla&rft.date=2013-07-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=1536-1276&rft.eissn=1558-2248&rft.volume=12&rft.issue=7&rft.spage=3278&rft_id=info:doi/10.1109%2FTWC.2013.062413.121125&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=3035287561 |
| 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 |