Joint throughput maximization and fair scheduling in uplink DS-CDMA systems

Li, C; Papavassiliou, S

dc.contributor.author	Li, C	en
dc.contributor.author	Papavassiliou, S	en
dc.date.accessioned	2014-03-01T02:49:39Z
dc.date.available	2014-03-01T02:49:39Z
dc.date.issued	2004	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/34668
dc.subject	Correspondence Problem	en
dc.subject	Fair Scheduling	en
dc.subject	Indexation	en
dc.subject	Performance Evaluation	en
dc.subject	Scheduling Algorithm	en
dc.subject	Stochastic Approximation	en
dc.subject	Throughput Maximization	en
dc.subject	Time-varying Channel	en
dc.subject	Multi Objective Optimization Problem	en
dc.title	Joint throughput maximization and fair scheduling in uplink DS-CDMA systems	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/SARNOF.2004.1302873	en
heal.identifier.secondary	http://dx.doi.org/10.1109/SARNOF.2004.1302873	en
heal.publicationDate	2004	en
heal.abstract	In this paper we study the problem of the uplink system throughput maximization while we still maintain fairness among the various users despite their time-varying channel conditions. We first rigorously formulate the corresponding problem as a multi-objective optimization problem with constraints, and then by introducing the concept of power index capacity, we devise a scheduling algorithm that is shown to	en
heal.journalName	Sarnoff Symposium, IEEE	en
dc.identifier.doi	10.1109/SARNOF.2004.1302873	en