【摘要】：隨著無線通信技術(shù)的發(fā)展,系統(tǒng)對(duì)帶寬的需求日益旺盛。為了滿足用戶的需求,ITU(International Telecommunication Union,國際電信聯(lián)盟)提出了載波聚合等關(guān)鍵技術(shù)來擴(kuò)充帶寬,但是這一應(yīng)用使得資源分配變得復(fù)雜,本文重點(diǎn)研究LTE-A(Long Term Evolution Advanced)系統(tǒng)中載波聚合下的資源分配優(yōu)化問題。針對(duì)窄帶用戶的資源分配,若以系統(tǒng)吞吐量為優(yōu)化目標(biāo),可以得到最優(yōu)的系統(tǒng)吞吐量,但是用戶之間存在嚴(yán)重的不公平性;而若以用戶公平性為優(yōu)化目標(biāo),會(huì)因?yàn)樾诺蕾|(zhì)量差的用戶占用大量資源而導(dǎo)致吞吐量下降。本文設(shè)計(jì)了一種基于統(tǒng)一效用函數(shù)的交叉熵資源分配算法,該算法根據(jù)用戶的需求對(duì)資源進(jìn)行分配,平衡了吞吐量和公平性兩大指標(biāo),從而得到最大的用戶滿意度。另外,針對(duì)窄帶用戶和寬帶用戶共存時(shí)的資源分配問題,本文研究了BF(Brute Force)算法和MSU(Maximum System Utility)算法。BF算法通過組合所有的資源分配方式,對(duì)比分析性能來獲取解決方案,所以求得的方法是最優(yōu)的,但是它的時(shí)間復(fù)雜度和系統(tǒng)開銷很大;MSU算法使用效用函數(shù)達(dá)到最大的用戶滿意度,在用戶公平性前提下盡可能最大化系統(tǒng)的吞吐量,但是其計(jì)算時(shí)間較大。本文設(shè)計(jì)了一種改進(jìn)型的基于交叉熵的資源分配方案,在保證性能與BF算法和MSU算法非常接近的前提下,有效縮短了計(jì)算時(shí)間。并且仿真結(jié)果也驗(yàn)證了該算法的有效性和優(yōu)越性。
[Abstract]:With the development of wireless communication technology, the demand for bandwidth is becoming more and more exuberant. In order to meet the needs of users, ITU (International Telecommunication Union, (International Telecom Union) proposed carrier aggregation and other key technologies to expand bandwidth, but this application makes resource allocation complex. This paper focuses on the optimization of resource allocation under carrier aggregation in LTE-A (Long Term Evolution Advanced) systems. For the resource allocation of narrowband users, if the system throughput is taken as the optimization goal, the optimal system throughput can be obtained, but there is a serious unfairness among the users, and if the user fairness is taken as the optimization goal, the throughput will decrease because the users with poor channel quality occupy a lot of resources. In this paper, a cross entropy resource allocation algorithm based on unified utility function is designed. The algorithm allocates resources according to the needs of users, balances throughput and fairness, and obtains the maximum user satisfaction. In addition, in order to solve the problem of resource allocation when narrowband users and broadband users coexist, this paper studies BF (Brute Force) algorithm and MSU (Maximum System Utility) algorithm. BF algorithm obtains the solution by combining all the resource allocation methods and comparing and analyzing the performance, so the method is optimal, but its time complexity and system overhead are very large. MSU algorithm uses utility function to achieve maximum user satisfaction and maximizes the throughput of the system under the premise of user fairness, but its computing time is large. In this paper, an improved resource allocation scheme based on cross entropy is designed, which effectively shortens the computing time on the premise that the performance is very close to that of BF algorithm and MSU algorithm. The simulation results also verify the effectiveness and superiority of the algorithm.
【學(xué)位授予單位】：西安電子科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類號(hào)】：TN929.5

【參考文獻(xiàn)】

相關(guān)期刊論文 前3條

1 闊永紅;萬仁勇;陳健;王健;;下行多用戶CoMP系統(tǒng)資源分配算法[J];通信學(xué)報(bào);2013年06期

2 ;Resource scheduling in downlink LTE-advanced system with carrier aggregation[J];The Journal of China Universities of Posts and Telecommunications;2012年01期

3 萬彭;杜志敏;;LTE和LTE-Advanced關(guān)鍵技術(shù)綜述[J];現(xiàn)代電信科技;2009年09期

，

本文編號(hào)：2509640