Resource allocation in HSDPA using best-users selection under code constraints

We consider the open issue of resource allocation in HSDPA networks for the purpose of enhancing the system´s performance both in terms of throughput and fairness while taking into consideration resource constraints specific to the HSDPA architecture. In particular, we propose a two-best user scheduling approach with an optimal power allocation aimed at maximizing data throughput and a selection criterion designed to ensure adaptive proportional fairness between users with different resource requirements and constraints. Compared to the popular carrier-to-interference ratio (CIR) and proportional fairness (PF) methods, the proposed technique, called two-best adaptive proportional fairness (APF) is shown to provide higher performance both in terms of throughput and fairness even when users experience different channel propagating conditions.