針對下鏈路LTE-A網路所設計且以提昇傳輸速率為目標之資源管理技術

Abstract

由於頻譜與能量資源的有限且珍貴，資源分配問題在近幾年越來越重要。然而，不恰當的資源分配會導致強烈的細胞間干擾，此干擾會嚴重的影響整體系統效能。因此在這篇論文中，我們將整個資源分配問題轉化為數學最佳化問題，且根據此最佳化問題提出解決策略。在聯合載波選擇與功率分配 JCP 策略中，通道選擇與功率分配將會在幾何程序 (Geometric Programming)的轉化與干擾未知的假設下被聯合求解。然而，顧慮到JCP策略的高複雜度，提出另一個簡化策略 (JCP-S)。此策略將在干擾固定假設的最佳化問題中求解，期望能達到降低複雜度的效果。此外，儘管已經做出簡化，聯合問題依然是複雜的。因此，提出更簡化的 HCP 策略以及 HCP-S 策略。其概念是將整個聯合問題分解為兩個子問題，也就是說通道選擇和功率分配將根據所提之演算法被依序分別求解。最後，模擬結果顯示JCP策略的效能高於其他所提若干之簡化策略，且因為效能與複雜度的考量下，兩者間存在著權衡概念。

Because of the scarcity of spectrum and energy resource, the problems about allocation of these resources become more and more important in recent years. However, inappropriate resource allocation may bring about high inter-cell interference which has a great effect on the performance of the entire system. Thus, in this thesis, we provide the optimal formulation of the resource allocation problem and proposed several schemes to solve this problem. In joint component carrier selection and power allocation (JCP) scheme, the channel and power resource are jointly solved based on geometric programming and the consideration of undeterministic interference term. Pondering on the high complexity and computational cost in JCP scheme, another simplified scheme, called JCP-S scheme, is proposed where the interference term is assume to be fixed with expectation to lower the complexity. Besides, on account of that the complexity is still high to solve problem from joint view, heuristic scheme, called HCP scheme and HCP-S scheme, are then proposed and try to separate the joint problem into two parts. In other words, channel selection and power allocation problems are solved according to the corresponding algorithms successively. Simulation results demonstrate that the data rate performance of JCP scheme is better than that of the other simplified schemes. However, there exists a trade-off between JCP scheme and the other simplified schemes considering the performance and the complexity.