sGSA: A SDMA–OFDMA greedy scheduling algorithm for WiMAX networks
Future wireless networks need to address the predicted growth in mobile traffic volume, expected to have an explosive growth in the next 5years mainly driven by video and web applications. Transmission schemes based on Orthogonal Frequency Division Multiple Access (OFDMA) combined with Space Divisio...
Gespeichert in:
Veröffentlicht in: | Computer networks (Amsterdam, Netherlands : 1999) Netherlands : 1999), 2012-10, Vol.56 (15), p.3511-3530 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 3530 |
---|---|
container_issue | 15 |
container_start_page | 3511 |
container_title | Computer networks (Amsterdam, Netherlands : 1999) |
container_volume | 56 |
creator | Zubow, Anatolij Marotzke, Johannes Camps-Mur, Daniel Costa, Xavier Perez |
description | Future wireless networks need to address the predicted growth in mobile traffic volume, expected to have an explosive growth in the next 5years mainly driven by video and web applications. Transmission schemes based on Orthogonal Frequency Division Multiple Access (OFDMA) combined with Space Division Multiple Access (SDMA) techniques are key promising technologies to increase current spectral efficiencies. A Joint SDMA–OFDMA system has to allocate resources in time, frequency and space dimensions to different mobile stations, resulting in a highly complex resource allocation problem. In contrast to related work approaches, in this paper we take a comprehensive view at the complete SDMA–OFDMA scheduling challenge and propose a SDMA–OFDMA Greedy Scheduling Algorithm (sGSA) for WiMAX systems. The proposed solution considers feasibility constraints in order to allocate resources for multiple mobile stations on a per packet basis by using (i) a low complexity SINR prediction algorithm, (ii) a cluster-based SDMA grouping algorithm and (iii) a computationally efficient frame layout scheme which allocates multiple SDMA groups per frame according to their packet QoS utility. A performance evaluation of the proposed sGSA solution as compared to state of the art solutions is provided, based on a comprehensive WiMAX simulation tool. |
doi_str_mv | 10.1016/j.comnet.2012.07.009 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1651442092</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S1389128612002642</els_id><sourcerecordid>2752477381</sourcerecordid><originalsourceid>FETCH-LOGICAL-c367t-e986d64d96ba9b80bd42f529ccd848acc53b694742c1e39f6eec621a0ca46af43</originalsourceid><addsrcrecordid>eNp9kLFOwzAURSMEEqXwBwyRWFgSbMdxYgakqNCC1KpDQbBZrvPSuqRxsRNQN_6BP-RLcFUmBqb3hnPvfe8GwTlGMUaYXa1iZdYNtDFBmMQoixHiB0EP5xmJMsT4od-TnEeY5Ow4OHFuhRCilOS9YOBGs-I6LMLZ7aT4_vyaDv0MFxag3IZOLaHsat0sQlkvjNXtch1WxobPelK8hD7xw9hXdxocVbJ2cPY7-8HT8O5xcB-Np6OHQTGOVMKyNgKes5LRkrO55PMczUtKqpRwpcqc5lKpNJkzTjNKFIaEVwxAMYIlUpIyWdGkH1zufTfWvHXgWrHWTkFdywZM5wRmKfZfIU48evEHXZnONv46gVGS-ZQ0Sz1F95SyxjkLldhYvZZ26yGxa1asxL5ZsWtWoEz4Zr3sZi8D_-y7Biuc0tAoKLUF1YrS6P8NfgAZ1oJC</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1037947575</pqid></control><display><type>article</type><title>sGSA: A SDMA–OFDMA greedy scheduling algorithm for WiMAX networks</title><source>Elsevier ScienceDirect Journals</source><creator>Zubow, Anatolij ; Marotzke, Johannes ; Camps-Mur, Daniel ; Costa, Xavier Perez</creator><creatorcontrib>Zubow, Anatolij ; Marotzke, Johannes ; Camps-Mur, Daniel ; Costa, Xavier Perez</creatorcontrib><description>Future wireless networks need to address the predicted growth in mobile traffic volume, expected to have an explosive growth in the next 5years mainly driven by video and web applications. Transmission schemes based on Orthogonal Frequency Division Multiple Access (OFDMA) combined with Space Division Multiple Access (SDMA) techniques are key promising technologies to increase current spectral efficiencies. A Joint SDMA–OFDMA system has to allocate resources in time, frequency and space dimensions to different mobile stations, resulting in a highly complex resource allocation problem. In contrast to related work approaches, in this paper we take a comprehensive view at the complete SDMA–OFDMA scheduling challenge and propose a SDMA–OFDMA Greedy Scheduling Algorithm (sGSA) for WiMAX systems. The proposed solution considers feasibility constraints in order to allocate resources for multiple mobile stations on a per packet basis by using (i) a low complexity SINR prediction algorithm, (ii) a cluster-based SDMA grouping algorithm and (iii) a computationally efficient frame layout scheme which allocates multiple SDMA groups per frame according to their packet QoS utility. A performance evaluation of the proposed sGSA solution as compared to state of the art solutions is provided, based on a comprehensive WiMAX simulation tool.</description><identifier>ISSN: 1389-1286</identifier><identifier>EISSN: 1872-7069</identifier><identifier>DOI: 10.1016/j.comnet.2012.07.009</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithms ; Data transmission ; Frames ; Greedy algorithms ; Interoperability ; Mathematical models ; OFDMA ; QoS ; Resource allocation ; Scheduler ; Scheduling ; Scheduling algorithms ; SDMA ; Stations ; Studies ; Traffic flow ; Wireless communication ; Wireless networks</subject><ispartof>Computer networks (Amsterdam, Netherlands : 1999), 2012-10, Vol.56 (15), p.3511-3530</ispartof><rights>2012 Elsevier B.V.</rights><rights>Copyright Elsevier Sequoia S.A. Oct 15, 2012</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c367t-e986d64d96ba9b80bd42f529ccd848acc53b694742c1e39f6eec621a0ca46af43</citedby><cites>FETCH-LOGICAL-c367t-e986d64d96ba9b80bd42f529ccd848acc53b694742c1e39f6eec621a0ca46af43</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S1389128612002642$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27901,27902,65534</link.rule.ids></links><search><creatorcontrib>Zubow, Anatolij</creatorcontrib><creatorcontrib>Marotzke, Johannes</creatorcontrib><creatorcontrib>Camps-Mur, Daniel</creatorcontrib><creatorcontrib>Costa, Xavier Perez</creatorcontrib><title>sGSA: A SDMA–OFDMA greedy scheduling algorithm for WiMAX networks</title><title>Computer networks (Amsterdam, Netherlands : 1999)</title><description>Future wireless networks need to address the predicted growth in mobile traffic volume, expected to have an explosive growth in the next 5years mainly driven by video and web applications. Transmission schemes based on Orthogonal Frequency Division Multiple Access (OFDMA) combined with Space Division Multiple Access (SDMA) techniques are key promising technologies to increase current spectral efficiencies. A Joint SDMA–OFDMA system has to allocate resources in time, frequency and space dimensions to different mobile stations, resulting in a highly complex resource allocation problem. In contrast to related work approaches, in this paper we take a comprehensive view at the complete SDMA–OFDMA scheduling challenge and propose a SDMA–OFDMA Greedy Scheduling Algorithm (sGSA) for WiMAX systems. The proposed solution considers feasibility constraints in order to allocate resources for multiple mobile stations on a per packet basis by using (i) a low complexity SINR prediction algorithm, (ii) a cluster-based SDMA grouping algorithm and (iii) a computationally efficient frame layout scheme which allocates multiple SDMA groups per frame according to their packet QoS utility. A performance evaluation of the proposed sGSA solution as compared to state of the art solutions is provided, based on a comprehensive WiMAX simulation tool.</description><subject>Algorithms</subject><subject>Data transmission</subject><subject>Frames</subject><subject>Greedy algorithms</subject><subject>Interoperability</subject><subject>Mathematical models</subject><subject>OFDMA</subject><subject>QoS</subject><subject>Resource allocation</subject><subject>Scheduler</subject><subject>Scheduling</subject><subject>Scheduling algorithms</subject><subject>SDMA</subject><subject>Stations</subject><subject>Studies</subject><subject>Traffic flow</subject><subject>Wireless communication</subject><subject>Wireless networks</subject><issn>1389-1286</issn><issn>1872-7069</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><recordid>eNp9kLFOwzAURSMEEqXwBwyRWFgSbMdxYgakqNCC1KpDQbBZrvPSuqRxsRNQN_6BP-RLcFUmBqb3hnPvfe8GwTlGMUaYXa1iZdYNtDFBmMQoixHiB0EP5xmJMsT4od-TnEeY5Ow4OHFuhRCilOS9YOBGs-I6LMLZ7aT4_vyaDv0MFxag3IZOLaHsat0sQlkvjNXtch1WxobPelK8hD7xw9hXdxocVbJ2cPY7-8HT8O5xcB-Np6OHQTGOVMKyNgKes5LRkrO55PMczUtKqpRwpcqc5lKpNJkzTjNKFIaEVwxAMYIlUpIyWdGkH1zufTfWvHXgWrHWTkFdywZM5wRmKfZfIU48evEHXZnONv46gVGS-ZQ0Sz1F95SyxjkLldhYvZZ26yGxa1asxL5ZsWtWoEz4Zr3sZi8D_-y7Biuc0tAoKLUF1YrS6P8NfgAZ1oJC</recordid><startdate>20121015</startdate><enddate>20121015</enddate><creator>Zubow, Anatolij</creator><creator>Marotzke, Johannes</creator><creator>Camps-Mur, Daniel</creator><creator>Costa, Xavier Perez</creator><general>Elsevier B.V</general><general>Elsevier Sequoia S.A</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>E3H</scope><scope>F2A</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20121015</creationdate><title>sGSA: A SDMA–OFDMA greedy scheduling algorithm for WiMAX networks</title><author>Zubow, Anatolij ; Marotzke, Johannes ; Camps-Mur, Daniel ; Costa, Xavier Perez</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c367t-e986d64d96ba9b80bd42f529ccd848acc53b694742c1e39f6eec621a0ca46af43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Algorithms</topic><topic>Data transmission</topic><topic>Frames</topic><topic>Greedy algorithms</topic><topic>Interoperability</topic><topic>Mathematical models</topic><topic>OFDMA</topic><topic>QoS</topic><topic>Resource allocation</topic><topic>Scheduler</topic><topic>Scheduling</topic><topic>Scheduling algorithms</topic><topic>SDMA</topic><topic>Stations</topic><topic>Studies</topic><topic>Traffic flow</topic><topic>Wireless communication</topic><topic>Wireless networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zubow, Anatolij</creatorcontrib><creatorcontrib>Marotzke, Johannes</creatorcontrib><creatorcontrib>Camps-Mur, Daniel</creatorcontrib><creatorcontrib>Costa, Xavier Perez</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Library & Information Sciences Abstracts (LISA)</collection><collection>Library & Information Science Abstracts (LISA)</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Computer networks (Amsterdam, Netherlands : 1999)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zubow, Anatolij</au><au>Marotzke, Johannes</au><au>Camps-Mur, Daniel</au><au>Costa, Xavier Perez</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>sGSA: A SDMA–OFDMA greedy scheduling algorithm for WiMAX networks</atitle><jtitle>Computer networks (Amsterdam, Netherlands : 1999)</jtitle><date>2012-10-15</date><risdate>2012</risdate><volume>56</volume><issue>15</issue><spage>3511</spage><epage>3530</epage><pages>3511-3530</pages><issn>1389-1286</issn><eissn>1872-7069</eissn><abstract>Future wireless networks need to address the predicted growth in mobile traffic volume, expected to have an explosive growth in the next 5years mainly driven by video and web applications. Transmission schemes based on Orthogonal Frequency Division Multiple Access (OFDMA) combined with Space Division Multiple Access (SDMA) techniques are key promising technologies to increase current spectral efficiencies. A Joint SDMA–OFDMA system has to allocate resources in time, frequency and space dimensions to different mobile stations, resulting in a highly complex resource allocation problem. In contrast to related work approaches, in this paper we take a comprehensive view at the complete SDMA–OFDMA scheduling challenge and propose a SDMA–OFDMA Greedy Scheduling Algorithm (sGSA) for WiMAX systems. The proposed solution considers feasibility constraints in order to allocate resources for multiple mobile stations on a per packet basis by using (i) a low complexity SINR prediction algorithm, (ii) a cluster-based SDMA grouping algorithm and (iii) a computationally efficient frame layout scheme which allocates multiple SDMA groups per frame according to their packet QoS utility. A performance evaluation of the proposed sGSA solution as compared to state of the art solutions is provided, based on a comprehensive WiMAX simulation tool.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.comnet.2012.07.009</doi><tpages>20</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1389-1286 |
ispartof | Computer networks (Amsterdam, Netherlands : 1999), 2012-10, Vol.56 (15), p.3511-3530 |
issn | 1389-1286 1872-7069 |
language | eng |
recordid | cdi_proquest_miscellaneous_1651442092 |
source | Elsevier ScienceDirect Journals |
subjects | Algorithms Data transmission Frames Greedy algorithms Interoperability Mathematical models OFDMA QoS Resource allocation Scheduler Scheduling Scheduling algorithms SDMA Stations Studies Traffic flow Wireless communication Wireless networks |
title | sGSA: A SDMA–OFDMA greedy scheduling algorithm for WiMAX networks |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-16T04%3A32%3A35IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=sGSA:%20A%20SDMA%E2%80%93OFDMA%20greedy%20scheduling%20algorithm%20for%20WiMAX%20networks&rft.jtitle=Computer%20networks%20(Amsterdam,%20Netherlands%20:%201999)&rft.au=Zubow,%20Anatolij&rft.date=2012-10-15&rft.volume=56&rft.issue=15&rft.spage=3511&rft.epage=3530&rft.pages=3511-3530&rft.issn=1389-1286&rft.eissn=1872-7069&rft_id=info:doi/10.1016/j.comnet.2012.07.009&rft_dat=%3Cproquest_cross%3E2752477381%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1037947575&rft_id=info:pmid/&rft_els_id=S1389128612002642&rfr_iscdi=true |