ebook img

Resource Allocation for Smart Phones in 4G LTE-Advanced Carrier Aggregation PDF

102 Pages·2012·1.03 MB·English
by  
Save to my drive
Quick download
Download
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.

Preview Resource Allocation for Smart Phones in 4G LTE-Advanced Carrier Aggregation

Resource Allocation for Smart Phones in 4G LTE-Advanced Carrier Aggregation RebeccaL.Kurrle ThesissubmittedtotheFacultyofthe VirginiaPolytechnicInstituteandStateUniversity inpartialfulfillmentoftherequirementsforthedegreeof MasterofScience in ElectricalEngineering T.CharlesClancy,Chair LamineMili A.A.(Louis)Beex November14,2012 Arlington,VA Keywords: RateAllocation,4GLTE-Advanced,CarrierAggregation Copyright2012,RebeccaL.Kurrle Resource Allocation for Smart Phones in 4G LTE-Advanced Carrier Aggregation RebeccaL.Kurrle (ABSTRACT) Thepurposeofthisthesisistoexploretheconceptofresourceschedulingandpricinganditsrela- tiontocarrieraggregation. ThefirstmaintopicisamodifiedFrankKellyalgorithmthatallowsfor the use of utility functions that are piecewise concave, but not a member of a strictly ’diminishing return’model. ThisadjustmenttotheFrankKellyalgorithmallowsresourceallocationtotakeinto account devices with multiple applications. The second topic introduces the idea of scheduling resourcesinacarrieraggregationscenarioassumingthecarriersarescheduledsequentially. Contents 1 Introduction 1 2 Background 3 2.1 UtilityandCostFunctions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 CommonRateAllocationConsiderations . . . . . . . . . . . . . . . . . . . . . . 6 2.3 FrankKellyAlgorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 2.4 CarrierAggregation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 2.5 CarrierAggregationScenarios . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 2.6 AdditionalPhysicalLayerConsiderations . . . . . . . . . . . . . . . . . . . . . . 21 2.7 UserHardwareConsiderations . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23 2.8 PreviousRateAllocationWorkforCarrierAggregation . . . . . . . . . . . . . . . 24 2.8.1 PacketSchedulingResourceAllocation . . . . . . . . . . . . . . . . . . . 24 2.8.2 UserGrouping . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26 iii 2.8.3 UtilityMaximization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 3 AlgorithmsandSimulationSetup 30 3.1 UtilityFunctionSet-up . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 3.2 ElasticUtilityFunctionApproximation . . . . . . . . . . . . . . . . . . . . . . . 35 3.3 CostFunctionAssumptions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 3.4 ModifiedFrankKellyAlgorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 3.5 RateAllocationAcrossMultipleCarriers . . . . . . . . . . . . . . . . . . . . . . 39 3.6 ScenarioConsiderationsandSimulationSet-up . . . . . . . . . . . . . . . . . . . 43 4 SimulationResults 46 4.1 ResultsofModifiedFrankKellyAlgorithm . . . . . . . . . . . . . . . . . . . . . 46 4.2 ResultsofRateAllocationforMultipleCarriers . . . . . . . . . . . . . . . . . . . 58 4.2.1 Scenario1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59 4.2.2 Scenario2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59 4.2.3 Scenario3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61 4.2.4 Scenario4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62 4.3 AdditionalResultConsiderations . . . . . . . . . . . . . . . . . . . . . . . . . . . 65 4.3.1 Start-upandSteady-StateSolutions . . . . . . . . . . . . . . . . . . . . . 65 4.3.2 Sub-optimalSolutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . 66 5 ConclusionsandFutureWork 68 5.1 Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 68 5.2 FutureWork . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 69 A ProgramSource 72 List of Figures 2.1 ExampleUtilityFunctions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.2 ExampleParetoFront,2Users[4] . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.3 USFrequencySpectrumAllocation . . . . . . . . . . . . . . . . . . . . . . . . . 13 2.4 CarrierAggregationScenariosinFrequency[9] . . . . . . . . . . . . . . . . . . . 14 2.5 PrimaryandSecondaryCarriers[8] . . . . . . . . . . . . . . . . . . . . . . . . . 16 2.6 BaseStationScenarios[9] . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 2.7 UserEquipmentExample[7] . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23 2.8 RoundRobinScheduling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24 2.9 EdgeversusCoreUsers[20] . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25 2.10 UserGroupingExample[22] . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27 3.1 ExampleApplicationUtilityFunctions . . . . . . . . . . . . . . . . . . . . . . . . 33 3.2 TotalUtilityFunctionExample . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 vi 3.3 MarginalUtilityExample . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41 3.4 ExampleMATLABScenario1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44 3.5 ExampleMATLABScenario2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44 3.6 ExampleMATLABScenario3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45 3.7 ExampleMATLABScenario4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45 4.1 ConcaveFitUtilityFunctionConvergence,5Users . . . . . . . . . . . . . . . . . 48 4.2 Non-ConcaveUtilityFunctionConvergence,5Users . . . . . . . . . . . . . . . . 49 4.3 ShadowPricesforConcaveFitFunctions,5Users . . . . . . . . . . . . . . . . . . 50 4.4 ShadowPricesforNon-ConcaveUtilityFunction,5Users . . . . . . . . . . . . . 50 4.5 ExampleResourceAllocationError,5Users(User1) . . . . . . . . . . . . . . . . 51 4.6 ConcaveFitConvergence,10Users . . . . . . . . . . . . . . . . . . . . . . . . . 52 4.7 Non-ConcaveUtilityFunctionConvergence,10Users . . . . . . . . . . . . . . . . 53 4.8 ConcaveFitConvergence,50Users . . . . . . . . . . . . . . . . . . . . . . . . . 53 4.9 Non-ConcaveUtilityFunctionConvergence,50Users . . . . . . . . . . . . . . . . 54 4.10 ShadowPrice,ConcaveFitUtilityFunction,10Users . . . . . . . . . . . . . . . . 54 4.11 ShadowPrice,Non-ConcaveUtilityFunction,10Users . . . . . . . . . . . . . . . 55 4.12 ShadowPrice,ConcaveFitUtilityFunction,50Users . . . . . . . . . . . . . . . . 55 4.13 ShadowPrice,Non-ConcaveUtilityFunction,50Users . . . . . . . . . . . . . . . 56 4.14 RateAllocationErrorExample,User1,10UsersCase . . . . . . . . . . . . . . . 57 4.15 RateAllocationErrorExample,User1,50UsersCase . . . . . . . . . . . . . . . 57 4.16 ShadowPriceofScenario1,Carrier1 . . . . . . . . . . . . . . . . . . . . . . . . 60 4.17 ShadowPriceofScenario1,Carrier2 . . . . . . . . . . . . . . . . . . . . . . . . 60 4.18 ShadowPriceofScenario2,Carrier1 . . . . . . . . . . . . . . . . . . . . . . . . 61 4.19 ShadowPriceofScenario2,Carrier2 . . . . . . . . . . . . . . . . . . . . . . . . 62 4.20 ShadowPriceofScenario3,Carrier1 . . . . . . . . . . . . . . . . . . . . . . . . 63 4.21 ShadowPriceofScenario3,Carrier2 . . . . . . . . . . . . . . . . . . . . . . . . 63 4.22 ShadowPriceofScenario4,Carrier1 . . . . . . . . . . . . . . . . . . . . . . . . 64 4.23 ShadowPriceofScenario4,Carrier2 . . . . . . . . . . . . . . . . . . . . . . . . 65 List of Tables 2.1 DataRateRequirementsforCommonApplications . . . . . . . . . . . . . . . . . 5 2.2 SpectralEfficiencyofModulationandCodingSchemes[29] . . . . . . . . . . . . 22 3.1 ConcaveFitFunctions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 4.1 FractionofCasesthatConverge,5Users . . . . . . . . . . . . . . . . . . . . . . . 47 4.2 ResourceAllocationError,5Users . . . . . . . . . . . . . . . . . . . . . . . . . . 51 4.3 ResourceAllocationError,AllCases . . . . . . . . . . . . . . . . . . . . . . . . . 56 4.4 ConvergenceofBaseStationScenarios . . . . . . . . . . . . . . . . . . . . . . . 59 4.5 SummaryofCarrierAggregationResults . . . . . . . . . . . . . . . . . . . . . . 64 ix Chapter 1 Introduction As smart phones and mobile computing become more commonplace, the demand on cellular net- worksisontherise. Giventhelimitedfrequencybandavailabletocellularproviders,thisdemand canexceednetworkcapacity. Lookingatthedemandfromtheperspectiveoftheuser,smartphones have a large number of applications and most of them require network resources. In the current 3GPP 4G LTE standard, users are limited to one carrier [9]. In instances where one carrier does not provide enough bandwidth for a given user, this user would experience a diminished Quality of Serve (QoS) with slower applications [16]. A new feature of the 3GPP LTE-Advanced cellular standard that will work to solve these problems, from the perspective of the network and user, is carrieraggregation[7]. Thisnewfeatureof4GLTE-Advancedallowsformultiplecarrierstobeusedbyasingleuser[7]. The additional carriers per user will allow users to use their smart phones without a loss of QoS. Carrieraggregationalsohelpstolessentheloadonthenetwork. Ifacarrieroutsidethetraditional cellular frequency band can be used, the stress on the traditional cellular band will diminish [16]. Frequencybandsthatmayallowforthistypeofon-demandcarrieraggregationcanbeinthepublic serviceband,previouslyreservedmilitarybands,orothernon-traditionalcellularbands. 1

Description:
Keywords: Rate Allocation, 4G LTE-Advanced, Carrier Aggregation .. (PRB), will be more expensive in the case where users demand more
See more

The list of books you might like

Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.