簡易檢索 / 詳目顯示
| 研究生： |
吳致平 Chih-ping Wu |
|---|---|
| 論文名稱： |
LTE下行資源分配與PSO演算法 PSO-based resource allocation in downlink LTE networks |
| 指導教授： | 賀嘉律 |
| 口試委員: | |
| 學位類別： |
碩士 Master |
| 系所名稱： |
資訊電機學院 - 通訊工程學系在職專班 Executive Master of Communication Engineering |
| 論文出版年： | 2014 |
| 畢業學年度： | 102 |
| 語文別： | 中文 |
| 論文頁數： | 41 |
| 中文關鍵詞： | 下行資源分配 、PSO演算法 |
| 外文關鍵詞： | resource allocation, PSO |
| 相關次數： | 點閱：19 下載：0 |
| 分享至: |
| 查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
在LTE系統中，每個子載波(Sub-carrier)會因使用者所處的環境不同，產生通道衰減(Fading)，因此為了使無限資源達到最有效的利用，必須將每個子載波分配給適當的用戶，尋找一組最佳的子載波分配方案，降低所需的發射功率。
本論文針對LTE系統中下行的資源分配，來進行討論，運用PSO演算法收斂速度快，搜索範圍大且實現簡單的特點，來減少計算的複雜度，同時為了解決PSO演算法易提早收斂，陷入局部最佳解的缺點，將PSO演算法結合基因演算法中交配及突變的策略，將PSO演算法的效能進一步的提升。
In this thesis, the problem of resource allocation in downlink long term evolution (LTE) networks is investigated. To increase the spectral and power efficiency, we propose a subcarrier allocation scheme based on particle swarm optimization (PSO) algorithm. PSO can be easily implemented in discrete optimization problem and fast converge to an optimal solution, but the solution may be just a local optimum. In order to avoid trapping at local optima, the strategies of crossover and mutation are used in the proposed method. Simulation results show that the proposed algorithm can efficiently reduce the total transmission power.
[1] J. Kennedy and R. Eberhart, “Particle swarm optimization,” In Proc. of the IEEE International Conference on Neural Networks, 1995, pp. 1942–1948.
[2] Y.W. Cheong, R.S. Cheng, K.B. Lataief, and R.D. Murch, “ Multiuser OFDM with adaptive subcarrier, bit, and power allocation,” IEEE J. Selected Areas Comm., vol.17, pp. 1747–175, Oct.1999.
[3] G. Zhang, “ Subcarrier and bit allocation for real-time services in multiuser OFDM systems,” In Proc. IEEE International Conference on Communications (ICC’04), vol.5, pp. 2985–2989, Jun. 2004.
[4] I. Ahmed, S. Sadeque and S. Pervin, “Margin adaptive resource allocation for multiuser OFDM systems by modified particle swarm optimization and differential evolution,” 21st International Conference on Electrical Communications and Computers, San Andres Cholula, 2011, pp. 277–231.
[5] 畢曉君，曹巍巍, “基于粒子群算法的OFDMA系統自適應子載波分配問題,” 哈爾濱工程大學學報, 2010, vol. 08.
[6] J. Kennedy and R. Eberhart, “A discrete binary version of the particle swarm algorithm,” In Proc. of the IEEE International Conference on System, Man and Cybernetics, Orlando, Florida, USA, 1997, vol. 5, pp. 4104–4108.
[7] 黃嵐,王康平,周春光,龐巍,董龍江,彭利, ” 粒子群優化算法求解旅行商問題,”吉林大學學報, 2003, vol.4, pp.477-480.
[8] H. Fan, “Discrete Particle Swarm Optimization for TSP based on Neighborhood, ”Journal of Computational Information Systems, vol. 6, no. 10, pp. 3407–3414, 2010.
[9] L. Davis, “Job shop scheduling with genetic algorithms,” International conference on Genetic algorithms and Their Applications, Mahwah, NJ, Lawrence Eribaum Associate, pp. 136–140, 1985.
[10] D.E. Goldberg and R.A. Lingle, “loci and traveling salesman problem,” International conference on Genetic algorithms and Their Applications, Mahwah, NJ, Lawrence Eribaum Associate, pp. 154–159, 1985.
[11] 梁艷春,吳春國,時小虎,葛宏偉, 群智能優化算法理論與應用. 北京:科學出版社, 2009, pp. 9–103.
