【摘要】：隨著互聯網、云計算等網絡技術的發(fā)展,人們對于蜂窩移動通信的業(yè)務需求不斷增長,推動了未來移動通信的發(fā)展從最初簡單的語音通話朝著多樣化的方向發(fā)展。特別是在最近幾年的互聯網發(fā)展情況下,智能電腦和手機等大量電子產品涌入市場之后,社交網絡、資源共享、本地廣告等服務逐漸的運用使得用戶對移動通信的性能要求越來越高。在這種大環(huán)境下,希望自己能夠隨時隨地的接入互聯網,并能獲得更加安全并且較高的服務水平。因此,設備到設備(D2D,Device-to-Device)通信技術應運而生,近年來該技術一直是蜂窩移動通信領域的一個重要內容。本論文研究了移動蜂窩網絡中D2D通信資源分配算法。論文分為六個部分,其中第二部分詳細研究了移動蜂窩網絡中D2D通信技術,分別研究了LTE/LTE-A蜂窩網絡和D2D通信。論文的第三、四、五部分提出了三個資源分配算法,并對這三個算法進行了研究。首先研究了業(yè)務速率需求的D2D通信資源分配算法SARA,并與隨機資源分配算法RANDOM的性能作比較。仿真得出,不管在系統D2D通信滿意度還是系統吞吐量方面,SARA算法的性能明顯優(yōu)于RANDOM算法。然后研究了基于系統容量最大化的資源分配算法CMRA,并與隨機資源分配算法RANDOM算法的性能作比較。仿真得出,不管在系統總容量還是所有蜂窩用戶的容量損失方面,SARA算法的性能明顯優(yōu)于RANDOM算法。最后研究了基于系統容量和公平性的D2D通信資源分配算法CFRA,并與第四章的CMRA算法的性能作比較。仿真得出,在系統總容量方面,特別是移動用戶非均勻分布場景下,CFRA算法劣于CMRA算法;在公平性參數方面,特別是移動用戶非均勻分布場景下,CFRA算法遠優(yōu)于CMRA算法。因此,相對于CMRA算法,CFRA算法更適合應用于移動用戶非均勻分布的場景。
[Abstract]:With the development of Internet, cloud computing and other network technologies, the demand for cellular mobile communication is increasing, which promotes the development of mobile communication from the original simple voice call to a diversified direction. Especially with the development of the Internet in recent years, after a large number of electronic products, such as smart computers and mobile phones, poured into the market, social networks and resources were shared. The use of services such as local advertising makes users more and more demanding the performance of mobile communication. In this environment, I hope to be able to access the Internet anytime, anywhere, and can obtain a more secure and high level of service. As a result, D2DU device / to-Device (D2DU) communication technology has emerged as the times require, and has been an important part of cellular mobile communication in recent years. In this paper, D2D communication resource allocation algorithm in mobile cellular networks is studied. The thesis is divided into six parts. In the second part, the D2D communication technology in mobile cellular network is studied in detail, and the LTE/LTE-A cellular network and D2D communication are studied respectively. In the third, fourth and fifth parts, three resource allocation algorithms are proposed and studied. Firstly, the D2D communication resource allocation algorithm (SARA,) based on traffic rate requirement is studied and compared with the random resource allocation algorithm (RANDOM). Simulation results show that the performance of Sara algorithm is better than that of RANDOM algorithm in terms of system D2D communication satisfaction and system throughput. Then the resource allocation algorithm (CMRA,) based on system capacity maximization is studied and compared with the random resource allocation algorithm (RANDOM). Simulation results show that the performance of Sara algorithm is obviously superior to that of RANDOM algorithm in terms of the total capacity of the system and the capacity loss of all cellular users. Finally, the D2D communication resource allocation algorithm CFRA, based on system capacity and fairness is studied and compared with the CMRA algorithm in Chapter 4. The simulation results show that the CMRA algorithm is inferior to the CMRA algorithm in the total capacity of the system, especially in the case of non-uniform distribution of mobile users, and the algorithm is much better than the CMRA algorithm in fairness parameters, especially in the non-uniform distributed scenario of mobile users. Therefore, compared with CMRA algorithm, it is more suitable for mobile users with non-uniform distribution.
【學位授予單位】：南京郵電大學
【學位級別】：碩士
【學位授予年份】：2017
【分類號】：TN929.5

【相似文獻】

相關期刊論文 前10條

1 沈建苗;無線LAN:蜂窩網絡的終結者?[J];互聯網周刊;2001年29期

2 馬忠建,方旭明,傲丹;虛擬蜂窩網技術的研究與發(fā)展[J];數據通信;2004年06期

3 劉濤;戎蒙恬;史宏逵;;中繼蜂窩網絡中小區(qū)間和小區(qū)內的資源分割[J];信息安全與通信保密;2007年03期

4 ;MIMO[J];電子質量;2008年09期

5 李卓暉;龍芳;黃進永;;計算機輔助蜂窩網性能與可靠性優(yōu)化設計[J];廣東通信技術;2010年05期

6 李云;朱雪;廖超;;蜂窩網絡中能效最大的最優(yōu)中繼位置研究[J];重慶郵電大學學報(自然科學版);2014年01期

7 倪銳;周武e，

本文編號：2214205