서지주요정보
Scheduling schemes for throughput maximization and fairness in OFDMA systems
서명 / 저자 Scheduling schemes for throughput maximization and fairness in OFDMA systems / Tien-Dzung Nguyen.
발행사항 [대전 : 한국정보통신대학교, 2006].
Online Access 원문보기 원문인쇄

소장정보

등록번호

DM0000759

소장위치/청구기호

학술문화관(문화관) 보존서고

ICU/MS06-73 2006

휴대폰 전송

도서상태

이용가능(대출불가)

사유안내

반납예정일

리뷰정보

초록정보

The future generation of wireless communication systems are expected to support high-speed data rate services as well as high spectrum efficiency in terms of capacity. There has been the need for more efficient use of scarce spectrum and a promising candidate is Orthogonal Frequency Division Multiplexing (OFDM) technique. The efficient utilization of spectrum requires Dynamic Resource Allocation (DRA) strategies with the flexibility to adapt to varying wireless network conditions, user requirements and Quality-of-Service (QoS) constraints, will be one of the major components for the design of a new air interface. In multiuser OFDMA systems, DRA is a general strategy to assign subcarriers and power to different users in order to maximize system performance under some constraint, such as: * Maximizing system throughput, * Minimizing total transmitting power, * Keeping fairness among users, * Proportional fairness, etc. Most of the previous approaches deal with maximization of system throughput (the total transmission rate) or minimization of the total transmitted power under users' QoS constraints. The formulated problem and their solutions are focused on the efficiency issue. These approaches benefit the users closer to the base station or with a higher power capability. On the other hand, another common problem in OFDMA systems is starvation of getting services due to the lack of system fairness. In this work, we emphasize on achieving the tradeoff between system throughput and fairness, i.e maximizing system throughput while keeping system fairness, under users' QoS and transmitted power constraints in downlink case. Firstly, we propose practical, heuristic algorithms based on Proportional Fairness (PF) Scheduling adopted in single carrier systems to enhance system throughput and maintain system fairness as well as to satisfy users' QoS. Secondly, we formulate the PF optimization problem and analyze this problem using optimization theory. From necessary conditions for optimality, we propose an efficient subcarrier and power allocation with low complexity. The simulation results show that proposed algorithms can achieve the tradeoff between system throughput and fairness.

서지기타정보

서지기타정보
청구기호 {ICU/MS06-73 2006
형태사항 vii, 48 p. : 삽화 ; 26 cm
언어 영어
일반주기 지도교수의 영문표기 : Young-Nam Han
지도교수의 한글표기 : 한영남
학위논문 학위논문(석사) - 한국정보통신대학교 : 공학부,
서지주기 References : p. 46-48
QR CODE

책소개

전체보기

목차

전체보기

이 주제의 인기대출도서