Improved Bounds on the Throughput Efficiency of Greedy Maximal Scheduling in Wireless Networks
In this paper, we derive new bounds on the throughput efficiency of Greedy Maximal Scheduling (GMS) for wireless networks of arbitrary topology under the general k -hop interference model. These results improve the known bounds for networks with up to 26 nodes under the 2-hop interference model. We...
Saved in:
| Published in | IEEE/ACM transactions on networking Vol. 19; no. 3; pp. 709 - 720 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
New York
IEEE
01.06.2011
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1063-6692 1558-2566 |
| DOI | 10.1109/TNET.2010.2089534 |
Cover
| Abstract | In this paper, we derive new bounds on the throughput efficiency of Greedy Maximal Scheduling (GMS) for wireless networks of arbitrary topology under the general k -hop interference model. These results improve the known bounds for networks with up to 26 nodes under the 2-hop interference model. We also prove that GMS is throughput-optimal in small networks. In particular, we show that GMS achieves 100% throughput in networks with up to eight nodes under the 2-hop interference model. Furthermore, we provide a simple proof to show that GMS can be implemented using only local neighborhood information in networks of any size. |
|---|---|
| AbstractList | In this paper, we derive new bounds on the throughput efficiency of Greedy Maximal Scheduling (GMS) for wireless networks of arbitrary topology under the general k -hop interference model. These results improve the known bounds for networks with up to 26 nodes under the 2-hop interference model. We also prove that GMS is throughput-optimal in small networks. In particular, we show that GMS achieves 100% throughput in networks with up to eight nodes under the 2-hop interference model. Furthermore, we provide a simple proof to show that GMS can be implemented using only local neighborhood information in networks of any size. In this paper, we derive new bounds on the throughput efficiency of Greedy Maximal Scheduling (GMS) for wireless networks of arbitrary topology under the general [Formula Omitted]-hop interference model. These results improve the known bounds for networks with up to 26 nodes under the 2-hop interference model. We also prove that GMS is throughput-optimal in small networks. In particular, we show that GMS achieves 100% throughput in networks with up to eight nodes under the 2-hop interference model. Furthermore, we provide a simple proof to show that GMS can be implemented using only local neighborhood information in networks of any size. |
| Author | Srikant, R Leconte, M Jian Ni |
| Author_xml | – sequence: 1 givenname: M surname: Leconte fullname: Leconte, M email: mathieu.leconte@inria.fr organization: Technicolor, INRIA, Paris, France – sequence: 2 surname: Jian Ni fullname: Jian Ni email: jianni@illinois.edu organization: Coordinated Sci. Lab., Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA – sequence: 3 givenname: R surname: Srikant fullname: Srikant, R email: rsrikant@illinois.edu organization: Coordinated Sci. Lab., Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA |
| BookMark | eNp9kD1PHDEQhi0EEh_JD4jSWGlSLYzttb0uCboAEh8Fh9LFMrtjzmTPvti7gfv37OkQBUWqmZGedzTzHJLdmCIS8oXBMWNgTuY3s_kxh2nk0Bgp6h1ywKRsKi6V2p16UKJSyvB9cljKEwATwNUB-X25XOX0Dzv6I42xKzRFOiyQzhc5jY-L1TjQmfehDRjbNU2enmfEbk2v3UtYup7etQvsxj7ERxoi_RUy9lgKvcHhOeU_5RPZ864v-PmtHpH7n7P52UV1dXt-eXZ6VbWC10NVQ8eF5ODBOAdSO-TqgQmFznCtFQqOXvK6NqwR2oHvBG_RaWUcPAhvGnFEvm_3Ts_8HbEMdhlKi33vIqax2KYxNfAazER--0A-pTHH6TjbaKZlw9Vmnd5CbU6lZPS2DYMbQopDdqG3DOzGut1Ytxvr9s36lGQfkqs8icrr_2a-bjMBEd95qYQUWotXtpqO9g |
| CODEN | IEANEP |
| CitedBy_id | crossref_primary_10_1109_TMC_2017_2777828 crossref_primary_10_1109_TPDS_2013_202 crossref_primary_10_1109_TMC_2018_2866093 crossref_primary_10_1007_s11134_015_9441_2 crossref_primary_10_1016_j_comnet_2021_108243 crossref_primary_10_1109_TNET_2015_2451090 crossref_primary_10_1109_TWC_2020_3025448 crossref_primary_10_1186_s40649_014_0004_1 crossref_primary_10_1109_LCOMM_2014_2358217 crossref_primary_10_1142_S0218126618501189 crossref_primary_10_1109_LWC_2019_2961361 crossref_primary_10_3390_s18124205 crossref_primary_10_1109_TWC_2014_2327102 crossref_primary_10_1002_net_21505 crossref_primary_10_1109_TNET_2014_2365440 crossref_primary_10_1002_ett_4419 crossref_primary_10_1287_moor_2013_0588 crossref_primary_10_1109_TNET_2011_2177101 crossref_primary_10_1016_j_comnet_2016_02_008 |
| Cites_doi | 10.1145/1374618.1374634 10.1109/TAC.2008.2006819 10.1145/1530748.1530758 10.1109/INFCOM.2010.5462229 10.1109/INFCOM.2005.1498460 10.1109/TNET.2008.918109 10.1109/9.182479 10.1109/INFCOM.2010.5462046 10.1109/18.61109 10.1109/INFOCOM.2008.165 10.1109/TIT.2007.913537 10.1109/INFOCOM.2008.169 10.1109/18.21215 10.1007/BF02523693 10.1023/A:1016747704458 10.1145/1860093.1860100 10.1007/3-540-49116-3_24 10.1109/INFOCOM.2006.176 10.1239/aap/1151337082 10.1016/0196-6774(86)90019-2 10.1109/TAC.2008.2006820 10.1145/1530748.1530771 10.1137/0215074 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jun 2011 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jun 2011 |
| DBID | 97E RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| DOI | 10.1109/TNET.2010.2089534 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef 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://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1558-2566 |
| EndPage | 720 |
| ExternalDocumentID | 2374574581 10_1109_TNET_2010_2089534 5635377 |
| Genre | orig-research |
| GroupedDBID | -DZ -~X .DC 0R~ 29I 4.4 5GY 5VS 6IK 85S 8US 97E 9M8 AAJGR AAKMM AALFJ AARMG AASAJ AAWTH AAWTV ABAZT ABPPZ ABQJQ ABVLG ACGFS ACGOD ACIWK ACM ADBCU ADL AEBYY AEFXT AEJOY AENSD AETEA AETIX AFWIH AFWXC AGQYO AGSQL AHBIQ AI. AIBXA AIKLT AKJIK AKQYR AKRVB ALLEH ALMA_UNASSIGNED_HOLDINGS ATWAV BDXCO BEFXN BFFAM BGNUA BKEBE BPEOZ CCLIF CS3 D0L EBS EJD FEDTE GUFHI HF~ HGAVV HZ~ H~9 I07 ICLAB IEDLZ IES IFIPE IFJZH IPLJI JAVBF LAI LHSKQ M43 MVM O9- OCL P1C P2P PQQKQ RIA RIE RNS ROL TN5 UPT UQL VH1 XOL YR2 ZCA AAYOK AAYXX CITATION RIG 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| ID | FETCH-LOGICAL-c324t-40d23520f09aa057ae26b136ea92776e32ef524491837a0fd32cea769a0b3f983 |
| IEDL.DBID | RIE |
| ISSN | 1063-6692 |
| IngestDate | Thu Sep 04 19:19:22 EDT 2025 Sun Jun 29 16:25:18 EDT 2025 Tue Jul 01 01:49:15 EDT 2025 Thu Apr 24 22:51:26 EDT 2025 Tue Aug 26 17:18:08 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-c324t-40d23520f09aa057ae26b136ea92776e32ef524491837a0fd32cea769a0b3f983 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23 |
| PQID | 871758268 |
| PQPubID | 32020 |
| PageCount | 12 |
| ParticipantIDs | proquest_miscellaneous_889402409 crossref_citationtrail_10_1109_TNET_2010_2089534 crossref_primary_10_1109_TNET_2010_2089534 ieee_primary_5635377 proquest_journals_871758268 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2011-June 2011-06-00 20110601 |
| PublicationDateYYYYMMDD | 2011-06-01 |
| PublicationDate_xml | – month: 06 year: 2011 text: 2011-June |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE/ACM transactions on networking |
| PublicationTitleAbbrev | TNET |
| PublicationYear | 2011 |
| 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 | ref12 ref15 ref14 ref10 ref2 ref1 joo (ref13) 2007 ref17 ref16 mckeown (ref20) 1995 ref19 ref18 ref24 hoepman (ref11) 2004 ref26 ref25 ref21 ref28 ref27 garey (ref8) 1979 ref7 ref9 ref4 ref3 ref6 ref5 penttinen (ref22) 2005 preis (ref23) 1999 |
| References_xml | – ident: ref12 doi: 10.1145/1374618.1374634 – ident: ref24 doi: 10.1109/TAC.2008.2006819 – ident: ref17 doi: 10.1145/1530748.1530758 – ident: ref21 doi: 10.1109/INFCOM.2010.5462229 – year: 1995 ident: ref20 publication-title: Scheduling algorithms for input-queued cell switches – ident: ref18 doi: 10.1109/INFCOM.2005.1498460 – ident: ref4 doi: 10.1109/TNET.2008.918109 – ident: ref26 doi: 10.1109/9.182479 – ident: ref3 doi: 10.1109/INFCOM.2010.5462046 – ident: ref6 doi: 10.1109/18.61109 – year: 1979 ident: ref8 publication-title: Computers and Intractability A Guide to the Theory of NP-Completeness – ident: ref14 doi: 10.1109/INFOCOM.2008.165 – ident: ref5 doi: 10.1109/TIT.2007.913537 – ident: ref28 doi: 10.1109/INFOCOM.2008.169 – ident: ref9 doi: 10.1109/18.21215 – ident: ref10 doi: 10.1007/BF02523693 – year: 2005 ident: ref22 article-title: Low-complexity distributed fair scheduling for wireless multi-hop networks publication-title: Proc RAWNET – start-page: 1128 year: 2007 ident: ref13 article-title: Performance limits of greedy maximal matching in multi-hop wireless networks publication-title: Proc IEEE CDC – ident: ref2 doi: 10.1023/A:1016747704458 – year: 2004 ident: ref11 publication-title: Simple distributed weighted matchings – ident: ref15 doi: 10.1145/1860093.1860100 – start-page: 259 year: 1999 ident: ref23 article-title: Linear time 1/2-approximation algorithm for maximum weighted matching in general graphs publication-title: Proc STACS doi: 10.1007/3-540-49116-3_24 – ident: ref27 doi: 10.1109/INFOCOM.2006.176 – ident: ref7 doi: 10.1239/aap/1151337082 – ident: ref1 doi: 10.1016/0196-6774(86)90019-2 – ident: ref25 doi: 10.1109/TAC.2008.2006820 – ident: ref16 doi: 10.1145/1530748.1530771 – ident: ref19 doi: 10.1137/0215074 |
| SSID | ssj0013026 |
| Score | 2.1508474 |
| Snippet | In this paper, we derive new bounds on the throughput efficiency of Greedy Maximal Scheduling (GMS) for wireless networks of arbitrary topology under the... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 709 |
| SubjectTerms | Computational modeling Greedy Maximal Scheduling (GMS) Interference Longest Queue First (LQF) Networks Numerical models Proving Schedules Scheduling Scheduling algorithm Throughput throughput optimality Topology Wireless networks |
| Title | Improved Bounds on the Throughput Efficiency of Greedy Maximal Scheduling in Wireless Networks |
| URI | https://ieeexplore.ieee.org/document/5635377 https://www.proquest.com/docview/871758268 https://www.proquest.com/docview/889402409 |
| Volume | 19 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1NT9wwEB0Bp_YAbSliS1v50BMii9d27PjYVotQJfbSReJE5K8gBCSrbiIBv77jOLttKap6ixTHsvL88WbmeQbgk2W-8jJ3GZVWZELjUjSq0JmaMGdEbooqqXxn8vRcfLvILzbgaH0XJoTQi8_COD72sXzfuC66yo5zPB25UpuwidMs3dX6FTGgfWk1tHB4JqVmQwRzQvXxfDadJxEXo4XOufjjDOqLqvy1E_fHy8kOnK0GllQlN-OutWP3-CRn4_-O_BVsDzyTfE4T4zVshPoNvPwt--AuXCaHQvDkS6yttCRNTZAOknkq3bPoWjLtE0zE25mkqUjU6PgHcmbur--w7--It49C9ityXZMoo73FbZPMkrB8-RbOT6bzr6fZUG4hc8iqWrQkPUM6RiuqjUEaZwKTdsJlMJopJQNnocqRDWjcBZShlefMBaOkNtTyShd8D7bqpg77QCbWiWicFUZzoby01rGKCq944SwT-QjoCoDSDbnIY0mM27K3SaguI2ZlxKwcMBvB4fqTRUrE8a_GuxGDdcPh94_gYIVyOSzVZYkWI9pMONYRkPVbXGMxcGLq0HTYpNAi5oLT757v9wBeJFdzdM68h632Rxc-IFdp7cd-kv4EzwvkpQ |
| linkProvider | IEEE |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1Lb9QwEB6VcoAeeBXEUh4-cEJk67UdOz4C2mqB7l5IpZ6I_EpVUZKqm0jAr2ccZ5enELdIcSwrn-15fTMD8NwyX3uZu4xKKzKh8SgaVehMzZgzIjdFnVi-K7k4Ee9O89MdeLnNhQkhDOSzMI2PQyzft66PrrLDHKUjV-oaXEe5L_KUrfUjZkCH5mpo4_BMSs3GGOaM6sNyNS8TjYvRQudc_CKFhrYqf9zFg4A5ug3LzdISr-TTtO_s1H37rWrj_679DtwaNU3yKm2Nu7ATmnuw91P9wX34mFwKwZPXsbvSmrQNQYWQlKl5z2XfkflQYiLmZ5K2JpGl47-Spfly_hnn_oCI-0hlPyPnDYlE2gu8OMkqUcvX9-HkaF6-WWRjw4XMoV7VoS3pGSpktKbaGFTkTGDSzrgMRjOlZOAs1DnqAxrvAWVo7TlzwSipDbW81gV_ALtN24SHQGbWiWieFUZzoby01rGaCq944SwT-QToBoDKjdXIY1OMi2qwSqiuImZVxKwaMZvAi-0nl6kUx78G70cMtgPH3z-Bgw3K1XhY1xXajGg14VonQLZv8ZTF0IlpQtvjkEKLWA1OP_r7vM_gxqJcHlfHb1fvD-BmcjxHV81j2O2u-vAENZfOPh027Hfuzefy |
| 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=Improved+Bounds+on+the+Throughput+Efficiency+of+Greedy+Maximal+Scheduling+in+Wireless+Networks&rft.jtitle=IEEE%2FACM+transactions+on+networking&rft.au=Leconte%2C+M&rft.au=Jian+Ni&rft.au=Srikant%2C+R&rft.date=2011-06-01&rft.pub=IEEE&rft.issn=1063-6692&rft.volume=19&rft.issue=3&rft.spage=709&rft.epage=720&rft_id=info:doi/10.1109%2FTNET.2010.2089534&rft.externalDocID=5635377 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1063-6692&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1063-6692&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1063-6692&client=summon |