HEAL DSpace

Joint Throughput Maximization and Fair Uplink Transmission Scheduling in CDMA Systems

Αποθετήριο DSpace/Manakin

Εμφάνιση απλής εγγραφής

dc.contributor.author Papavassiliou, S en
dc.contributor.author Li, C en
dc.date.accessioned 2014-03-01T01:30:58Z
dc.date.available 2014-03-01T01:30:58Z
dc.date.issued 2009 en
dc.identifier.issn 1687-1499 en
dc.identifier.uri https://dspace.lib.ntua.gr/xmlui/handle/123456789/19698
dc.subject Throughput Maximization en
dc.subject.classification Engineering, Electrical & Electronic en
dc.subject.classification Telecommunications en
dc.subject.other Cdma systems en
dc.subject.other Channel conditions en
dc.subject.other Code-division multiple-access en
dc.subject.other Control parameters en
dc.subject.other Fairness constraints en
dc.subject.other Fixed targets en
dc.subject.other Fundamental problems en
dc.subject.other Global searches en
dc.subject.other High throughputs en
dc.subject.other Knapsack problems en
dc.subject.other Optimal sets en
dc.subject.other Optimal solutions en
dc.subject.other Optimal transmissions en
dc.subject.other Optimization problems en
dc.subject.other Performance evaluations en
dc.subject.other Power indices en
dc.subject.other Qos constraints en
dc.subject.other Quality-of-service en
dc.subject.other Simple methods en
dc.subject.other Stochastic approximation methods en
dc.subject.other Through-put maximizations en
dc.subject.other Throughput maximization problems en
dc.subject.other Two-step approaches en
dc.subject.other Up-link transmissions en
dc.subject.other Uplink systems en
dc.subject.other Wireless systems en
dc.subject.other Approximation theory en
dc.subject.other Binary sequences en
dc.subject.other Control system analysis en
dc.subject.other Integer programming en
dc.subject.other Optimal systems en
dc.subject.other Scheduling en
dc.subject.other Throughput en
dc.subject.other Optimization en
dc.title Joint Throughput Maximization and Fair Uplink Transmission Scheduling in CDMA Systems en
heal.type journalArticle en
heal.identifier.primary 10.1155/2009/564692 en
heal.identifier.secondary http://dx.doi.org/10.1155/2009/564692 en
heal.identifier.secondary 564692 en
heal.language English en
heal.publicationDate 2009 en
heal.abstract We study the fundamental problem of optimal transmission scheduling in a code-division multiple-access wireless system in order to maximize the uplink system throughput, while satisfying the users quality-of-service (QoS) requirements and maintaining fairness among them. The corresponding problem is expressed as a weighted throughput maximization problem, under certain power and QoS constraints, where the weights are the control parameters reflecting the fairness constraints. With the introduction of the power index capacity, it is shown that this optimization problem can be converted into a binary knapsack problem, where all the corresponding constraints are replaced by the power index capacities at some certain system power index. A two-step approach is followed to obtain the optimal solution. First, a simple method is proposed to find the optimal set of users to receive service for a given fixed target system load, and then the optimal solution is obtained as a global search within a certain range. Furthermore, a stochastic approximation method is presented to effectively identify the required control parameters. The performance evaluation reveals the advantages of our proposed policy over other existing ones and confirms that it achieves very high throughput while maintains fairness among the users, under different channel conditions and requirements. Copyright (C) 2009 S. Papavassiliou and C. Li. en
heal.publisher HINDAWI PUBLISHING CORPORATION en
heal.journalName Eurasip Journal on Wireless Communications and Networking en
dc.identifier.doi 10.1155/2009/564692 en
dc.identifier.isi ISI:000265974500001 en
dc.identifier.volume 2009 en


Αρχεία σε αυτό το τεκμήριο

Αρχεία Μέγεθος Μορφότυπο Προβολή

Δεν υπάρχουν αρχεία που σχετίζονται με αυτό το τεκμήριο.

Αυτό το τεκμήριο εμφανίζεται στην ακόλουθη συλλογή(ές)

Εμφάνιση απλής εγγραφής