Data traffic scheduling algorithm for multiuser OFDM system with adaptive modulation considering fairness among users

Cited 5 time in webofscience Cited 0 time in scopus
  • Hit : 1223
  • Download : 228
DC FieldValueLanguage
dc.contributor.authorJeong, SBko
dc.contributor.authorKim, Sehunko
dc.contributor.authorLee, Hko
dc.date.accessioned2007-11-20T07:37:14Z-
dc.date.available2007-11-20T07:37:14Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued2005-07-
dc.identifier.citationCOMPUTERS & OPERATIONS RESEARCH, v.32, no.7, pp.1723 - 1737-
dc.identifier.issn0305-0548-
dc.identifier.urihttp://hdl.handle.net/10203/2057-
dc.description.abstractOrthogonal frequency division multiplexing (OFDM) is regarded as a very promising digital modulation technique for achieving high rate transmission. However, the increasing number of wireless data users and the deployment of broadband wireless networks have brought about issues of fairness among users and system throughput. In this paper, we propose an efficient scheduling algorithm to maximize system throughput while providing a level of fairness among users for non-real-time data traffic in the downlink of a multiuser OFDM system. We establish a practical scheduling procedure to implement our scheme considering fairness among users and also formulate the resource allocation problem for rate, power, and subcarrier allocation as an integer program that maximizes system throughput. Next, we present a computationally efficient heuristic algorithm for a problem based on the Lagrangian relaxation procedure. Through the computing simulation, we show that the proposed scheme performs better than other schemes in terms of both system throughput and fairness among users. (C) 2003 Elsevier Ltd. All rights reserved.-
dc.languageEnglish-
dc.language.isoen_USen
dc.publisherPERGAMON-ELSEVIER SCIENCE LTD-
dc.subjectRELAXATION-
dc.subjectSERVICE-
dc.titleData traffic scheduling algorithm for multiuser OFDM system with adaptive modulation considering fairness among users-
dc.typeArticle-
dc.identifier.wosid000226855900004-
dc.identifier.scopusid2-s2.0-9644266762-
dc.type.rimsART-
dc.citation.volume32-
dc.citation.issue7-
dc.citation.beginningpage1723-
dc.citation.endingpage1737-
dc.citation.publicationnameCOMPUTERS & OPERATIONS RESEARCH-
dc.identifier.doi10.1016/j.cor.2003.11.021-
dc.embargo.liftdate9999-12-31-
dc.embargo.terms9999-12-31-
dc.contributor.localauthorKim, Sehun-
dc.contributor.nonIdAuthorJeong, SB-
dc.contributor.nonIdAuthorLee, H-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorOFDM-
dc.subject.keywordAuthoradaptive modulation-
dc.subject.keywordAuthorfairness-
dc.subject.keywordAuthorthroughput maximization problem-
dc.subject.keywordAuthortraffic scheduling-
dc.subject.keywordPlusRELAXATION-
dc.subject.keywordPlusSERVICE-
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 5 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0