Cited time in webofscience Cited time in scopus

Scheduling for carrier aggregation with LTE-A

Title
Scheduling for carrier aggregation with LTE-A
Alternative Title
주파수 집성기술이 적용된 LTE-A 에서 Max-min 최적화기법을 사용한 스케쥴링 기법
Author(s)
Song, Yeung Uk
DGIST Authors
Kim, Jong HyunSong, Yeung UkChoi, Jihwan P.
Advisor
Choi, Jihwan P.
Co-Advisor(s)
Kim, Jong Hyun
Issued Date
2016
Awarded Date
2016. 2
Type
Thesis
Subject
Carrier aggregationresource allocation schemeLong term evolution-advancedoptimization
Abstract
The 4th generation mobile communication systems, LTE-A, have explosive subscriber increase and the demand of supporting backward capability for LTE users. Therefore, LTE- A systems need more careful allocation of communication resources to provide enough data rate from BS for subscriber devices. This thesis deals with scheduling for efficient resource distribution according to whether the subscriber can use carrier aggregation.
We propose the scheduling with a max-min optimization tool to improve the performance of subscribers as distinct cell coverage areas are served with different frequency bands. The simulation results show performance improvement of the subscribers both for LTE and LTE-A. ⓒ 2016 DGIST
Table Of Contents
I.INTRODUCTION 1 --
II.RELATE WORK 3 --
2.1LTE-A 3 --
2.2Data frame structure 3 --
2.3Carrier aggregation 6 --
2.4CA scheduling 8 --
III.PROPOSED SCHEDULING 11 --
IV.SIMULATION 16 --
4.1Channel composition 16 --
4.2Comparison scheduling 17 --
4.3Simulation environment 18 --
4.4Estimation result 19 --
V.CONCLUSION 24 --
VI. REFERENCE 25
URI
http://dgist.dcollection.net/jsp/common/DcLoOrgPer.jsp?sItemId=000002229424

http://hdl.handle.net/20.500.11750/1442
DOI
10.22677/thesis.2229424
Degree
Master
Department
Information and Communication Engineering
Publisher
DGIST
Files in This Item:
000002229424.pdf

000002229424.pdf

기타 데이터 / 943.81 kB / Adobe PDF download
Appears in Collections:
Department of Electrical Engineering and Computer Science Theses Master

qrcode

  • twitter
  • facebook
  • mendeley

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE