Efficient Scheduling Algorithms for Multiantenna CDMA Systems
In multiple-input-multiple-output (MIMO) multiuser systems, simultaneously serving multiple users achieves high data rates. However, high-performance transmit beamforming requires an adequately designed user-selection scheme. Optimal scheduling can be only obtained through a high computationally com...
Uloženo v:
| Vydáno v: | IEEE transactions on vehicular technology Ročník 61; číslo 2; s. 521 - 532 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
New York, NY
IEEE
01.02.2012
Institute of Electrical and Electronics Engineers |
| 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 | In multiple-input-multiple-output (MIMO) multiuser systems, simultaneously serving multiple users achieves high data rates. However, high-performance transmit beamforming requires an adequately designed user-selection scheme. Optimal scheduling can be only obtained through a high computationally complex exhaustive search, and hence, low-complexity heuristic algorithms are required. In addition, employing a multiple-access scheme such as code division (CDMA) largely increases the complexity of optimal scheduling, and it becomes unemployable even for a moderate number of users and antennas. In this context, this paper proposes three heuristic scheduling algorithms for MIMO CDMA systems using zero-forcing beamforming (ZFBF). We use a graph-theoretical approach to model the system as a weighted undirected graph. The problem of user selection is then formulated as a graph coloring problem, namely, the maximum weight N -colorable subgraph problem. Then, we design two heuristics to solve this graph problem. The first algorithm is a low-complexity greedy algorithm. The second algorithm is based on a tabu search approach to resolve efficiently the complexity/performance tradeoff. Numerical and simulation results show the sub-optimal performances and robustness of the proposed low-complexity algorithms. |
|---|---|
| AbstractList | In multiple-input-multiple-output (MIMO) multiuser systems, simultaneously serving multiple users achieves high data rates. However, high-performance transmit beamforming requires an adequately designed user-selection scheme. Optimal scheduling can be only obtained through a high computationally complex exhaustive search, and hence, low-complexity heuristic algorithms are required. In addition, employing a multiple-access scheme such as code division (CDMA) largely increases the complexity of optimal scheduling, and it becomes unemployable even for a moderate number of users and antennas. In this context, this paper proposes three heuristic scheduling algorithms for MIMO CDMA systems using zero-forcing beamforming (ZFBF). We use a graph-theoretical approach to model the system as a weighted undirected graph. The problem of user selection is then formulated as a graph coloring problem, namely, the maximum weight N -colorable subgraph problem. Then, we design two heuristics to solve this graph problem. The first algorithm is a low-complexity greedy algorithm. The second algorithm is based on a tabu search approach to resolve efficiently the complexity/performance tradeoff. Numerical and simulation results show the sub-optimal performances and robustness of the proposed low-complexity algorithms. |
| Author | Driouch, E. Ajib, W. |
| Author_xml | – sequence: 1 givenname: E. surname: Driouch fullname: Driouch, E. email: elmahdi@uqam.ca organization: Dept. of Comput. Sci., Univ. of Quebec at Montreal, Montreal, QC, Canada – sequence: 2 givenname: W. surname: Ajib fullname: Ajib, W. email: ajib.wessam@uqam.ca organization: Dept. of Comput. Sci., Univ. of Quebec at Montreal, Montreal, QC, Canada |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=25565014$$DView record in Pascal Francis |
| BookMark | eNp9kD1vwjAQhq2KSgXavVKXLB1D_Z146IAo_ZBAHaBdI8ecwVVwkG0G_n2DQAwdOp1Oep_3dM8A9XzrAaF7gkeEYPW0_F6OKCZkRElRSkqvUJ8opnLFhOqhPsakzJXg4gYNYvzpVs4V6aPnqbXOOPApW5gNrPaN8-ts3Kzb4NJmGzPbhmy-b5LTPoH3Opu8zMfZ4hATbOMtura6iXB3nkP09TpdTt7z2efbx2Q8yw1VLOUFB9CEWkFBG17LosC4rpUpwECpMS9qpQyA5CUjktfMYKJsrWhpDF6VINkQPZ56dzoa3digvXGx2gW31eFQUSGk6D7qcviUM6GNMYC9RAiujpqqTlN11FSdNXWI_IMYl3RyrU9Bu-Y_8OEEOgC43JFYSS44-wW-j3ag |
| CODEN | ITVTAB |
| CitedBy_id | crossref_primary_10_1049_iet_com_2017_0399 crossref_primary_10_1109_COMST_2016_2618870 crossref_primary_10_1007_s11277_014_1932_7 crossref_primary_10_1109_TVT_2012_2227344 crossref_primary_10_1051_matecconf_20165702015 crossref_primary_10_1016_j_phycom_2023_102070 crossref_primary_10_1109_ACCESS_2016_2630999 crossref_primary_10_1109_TWC_2025_3542900 crossref_primary_10_1007_s11277_014_1881_1 |
| Cites_doi | 10.1109/TIT.2002.1003822 10.1109/TCOMM.2005.852841 10.1016/0020-0190(87)90107-4 10.1109/TVT.2007.898396 10.1109/TWC.2009.070311 10.1109/TIT.1983.1056659 10.1109/GLOCOM.2007.166 10.1109/TCOMM.2009.03.060604 10.1109/VETECS.2011.5956602 10.1109/TSP.2005.855401 10.1109/TIT.2003.813523 10.1109/TVT.2005.851337 10.1109/TVT.2009.2038925 10.1109/JSAC.2005.862421 10.1109/TWC.2002.800537 10.1145/800119.803884 10.1109/TCOMM.2006.881339 10.1109/TWC.2005.850307 10.1109/ICC.1995.525188 10.1093/comjnl/10.1.85 10.1007/BF02239976 10.1109/TVT.2008.2009059 10.1145/359094.359101 10.1016/j.sigpro.2011.04.024 10.1109/VETECS.2009.5073303 |
| ContentType | Journal Article |
| Copyright | 2015 INIST-CNRS |
| Copyright_xml | – notice: 2015 INIST-CNRS |
| DBID | 97E RIA RIE AAYXX CITATION IQODW |
| DOI | 10.1109/TVT.2011.2178622 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Pascal-Francis |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| 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 Applied Sciences |
| EISSN | 1939-9359 |
| EndPage | 532 |
| ExternalDocumentID | 25565014 10_1109_TVT_2011_2178622 6096454 |
| Genre | orig-research |
| 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 IQODW RIG |
| ID | FETCH-LOGICAL-c293t-74eea12f52eac4b67700bb9c7ece8a047b99cee6483164b3c019fb928cc0d8e63 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 13 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000300427400009&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 Jul 21 09:14:16 EDT 2025 Tue Nov 18 20:38:48 EST 2025 Sat Nov 29 02:18:07 EST 2025 Tue Aug 26 17:18:14 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Access control tabu search (TS) Wireless telecommunication Beam forming Theoretical model Tabu search Coding Selection criterion Optimal planning Antenna High rate transmission zero-forcing beamforming (ZFBF) MIMO system Multiple access High performance multiple-input-multiple-output (MIMO) code-division multiple-access (CDMA) systems Scheduling Graph theory Graph coloring Algorithm performance Code division multiple access Heuristic method Greedy algorithm Subgraph Graph colouring |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c293t-74eea12f52eac4b67700bb9c7ece8a047b99cee6483164b3c019fb928cc0d8e63 |
| PageCount | 12 |
| ParticipantIDs | pascalfrancis_primary_25565014 ieee_primary_6096454 crossref_citationtrail_10_1109_TVT_2011_2178622 crossref_primary_10_1109_TVT_2011_2178622 |
| PublicationCentury | 2000 |
| PublicationDate | 2012-02-01 |
| PublicationDateYYYYMMDD | 2012-02-01 |
| PublicationDate_xml | – month: 02 year: 2012 text: 2012-02-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York, NY |
| PublicationPlace_xml | – name: New York, NY |
| PublicationTitle | IEEE transactions on vehicular technology |
| PublicationTitleAbbrev | TVT |
| PublicationYear | 2012 |
| Publisher | IEEE Institute of Electrical and Electronics Engineers |
| Publisher_xml | – name: IEEE – name: Institute of Electrical and Electronics Engineers |
| References | ref13 ref12 ref15 ref14 ref11 ref10 ref2 ref1 ref17 ref16 ref19 ref18 kim (ref21) 2006; 54 ref24 ref26 ref25 ref20 ref22 ref27 ref8 ref9 paulraj (ref23) 2003 ref4 ref3 ref6 ref5 swannack (ref7) 2004 |
| References_xml | – ident: ref19 doi: 10.1109/TIT.2002.1003822 – ident: ref18 doi: 10.1109/TCOMM.2005.852841 – ident: ref26 doi: 10.1016/0020-0190(87)90107-4 – ident: ref12 doi: 10.1109/TVT.2007.898396 – ident: ref14 doi: 10.1109/TWC.2009.070311 – ident: ref3 doi: 10.1109/TIT.1983.1056659 – ident: ref15 doi: 10.1109/GLOCOM.2007.166 – ident: ref10 doi: 10.1109/TCOMM.2009.03.060604 – ident: ref27 doi: 10.1109/VETECS.2011.5956602 – ident: ref5 doi: 10.1109/TSP.2005.855401 – start-page: 440 year: 2004 ident: ref7 article-title: Low complexity multiuser scheduling for maximizing throughput in the MIMO broadcast channel publication-title: Proc Allerton Conf Commun Control Comput – ident: ref2 doi: 10.1109/TIT.2003.813523 – ident: ref8 doi: 10.1109/TVT.2005.851337 – ident: ref13 doi: 10.1109/TVT.2009.2038925 – ident: ref4 doi: 10.1109/JSAC.2005.862421 – ident: ref11 doi: 10.1109/TWC.2002.800537 – year: 2003 ident: ref23 publication-title: Introduction to SpaceTime Wireless Communications – ident: ref24 doi: 10.1145/800119.803884 – volume: 54 start-page: 1710 year: 2006 ident: ref21 article-title: Linear MMSE space-time equalizer for MIMO multicode CDMA systems publication-title: IEEE Trans Commun doi: 10.1109/TCOMM.2006.881339 – ident: ref20 doi: 10.1109/TWC.2005.850307 – ident: ref1 doi: 10.1109/ICC.1995.525188 – ident: ref25 doi: 10.1093/comjnl/10.1.85 – ident: ref17 doi: 10.1007/BF02239976 – ident: ref9 doi: 10.1109/TVT.2008.2009059 – ident: ref16 doi: 10.1145/359094.359101 – ident: ref22 doi: 10.1016/j.sigpro.2011.04.024 – ident: ref6 doi: 10.1109/VETECS.2009.5073303 |
| SSID | ssj0014491 |
| Score | 2.105805 |
| Snippet | In multiple-input-multiple-output (MIMO) multiuser systems, simultaneously serving multiple users achieves high data rates. However, high-performance transmit... |
| SourceID | pascalfrancis crossref ieee |
| SourceType | Index Database Enrichment Source Publisher |
| StartPage | 521 |
| SubjectTerms | Access methods and protocols, osi model Applied sciences Base stations Coding, codes Color Complexity theory Detection, estimation, filtering, equalization, prediction Exact sciences and technology Graph coloring Information, signal and communications theory MIMO Multiaccess communication multiple-input-multiple-output (MIMO) code-division multiple-access (CDMA) systems scheduling Scheduling algorithm Signal and communications theory Signal, noise Systems, networks and services of telecommunications tabu search (TS) Telecommunications Telecommunications and information theory Teleprocessing networks. Isdn Transmission and modulation (techniques and equipments) Vectors zero-forcing beamforming (ZFBF) |
| Title | Efficient Scheduling Algorithms for Multiantenna CDMA Systems |
| URI | https://ieeexplore.ieee.org/document/6096454 |
| Volume | 61 |
| WOSCitedRecordID | wos000300427400009&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/eLvHCXMwlV1LS8NAEB5q8aAHX1Wsj5KDF8HYPDbZ7LFUixeLYJXewu5mtxZqKm3q73c22YYWRPAWyG4I3-xmvs3MfANwQ1Qo_dCXbhjGyiVcEFfoKHM9qTOdUZ9r22yCDofJeMxeGnBX18IopcrkM3VvLstYfjaXK_OrrBsj3yYR2YEdSuOqVquOGBBiu-P5uIGRFqxDkh7rjt5HlVYn0m8k8MGWCyp7qpiMSL5EUHTVzWLDxQwO__dyR3BgqaTTq2x_DA2Vn8D-hsBgC4w48bQseXRe0TqZSTufOL3ZZL6YFh-fSwcpq1PW4BqA85w7_YfnnmNlzE_hbfA46j-5tmGCK9FrFy4lSnE_0FGAn1MiYko9TwgmqZIq4R6hgjF0ijFJQjwliVAiv9OCBYmUXpaoODyDZj7P1Tk4ytM04DgvorjHA50wHisj5c45ZQnx29BdY5hKqyZumlrM0vJU4bEUUU8N6qlFvQ239YyvSknjj7EtA3A9zmLbhs6Wmer7RkfNBEgvfp93CXv49KBKtr6CZrFYqWvYld_FdLnolOvoB7olxdE |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bS8MwFD7MKagP3sV5mX3wRbCul6xpHsd0TNyG4JS9lTRN5mB2sou_35M2KxuI4FuhDS1fmp4vPed8H8ANkb5wfVfYvh9Im_CY2LGqJ7YjVKIS6nJlzCZorxcOBuylBHdFL4yUMis-k_f6MMvlJxOx0L_KagHybVInG7CpnbNMt1aRMyDE-OO5uISRGCyTkg6r9d_7uVonEnCk8N5aEMpcVXRNJJ8hLCr3s1gJMq39_z3eAewZMmk18tk_hJJMj2B3RWLwGLQ88ShrerRecX4SXXg-tBrj4WQ6mn98ziwkrVbWhashTlNuNR-6DcsImZ_AW-ux32zbxjLBFhi35zYlUnLXU3UPP6gkDih1nDhmgkohQ-4QGjOGYTEgoY_7pNgXyPBUzLxQCCcJZeCfQjmdpPIMLOko6nEcV6e4yj0VMh5ILebOOWUhcStQW2IYCaMnrm0txlG2r3BYhKhHGvXIoF6B22LEV66l8ce1xxrg4jqDbQWqa9NUnNdKajpFev77uGvYbve7najz1Hu-gB28k5eXXl9CeT5dyCvYEt_z0Wxazd6pHzVJyRo |
| 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=Efficient+Scheduling+Algorithms+for+Multiantenna+CDMA+Systems&rft.jtitle=IEEE+transactions+on+vehicular+technology&rft.au=Driouch%2C+Elmahdi&rft.au=Ajib%2C+Wessam&rft.date=2012-02-01&rft.issn=0018-9545&rft.eissn=1939-9359&rft.volume=61&rft.issue=2&rft.spage=521&rft.epage=532&rft_id=info:doi/10.1109%2FTVT.2011.2178622&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TVT_2011_2178622 |
| 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 |