| Summary: | 碩士 === 國立清華大學 === 通訊工程研究所 === 100 === In this thesis, we consider the fairness issue in the resource allocation scheme for cellular downlink OFDMA systems. The conventional max-min fair approach simply leads to an equal rate result for each user. Consequently, the different rate demands among users are not well taken care of. On the other hand, the fairness and the overall throughput trade off. The fairness index is adjustable and the equal-rate fairness is one of the special case. In this thesis, the max-min weighted surplus rate fairness is presented. In this formulation, the adjustable fairness and different rate demands for individual user are considered. Since the problem is NP-hard, a resource allocation algorithm for general max-min problem is proposed. In this algorithm, we take care of conflicts in subcarrier assignments and design a penalty criteria to explore the opportunity cost, As result, better throughput-fairness region is achieved. The mathematical analysis for the proposed algorithm is devised. The effectiveness of the proposed algorithm has been verified numerically under various channel models with comparison to the conventional Greedy and Vogel's approaches.
|
|---|
