【摘要】：隨著無線通信技術(shù)的快速發(fā)展,人們對于通信系統(tǒng)的傳輸速率、系統(tǒng)容量以及頻譜利用率等方面的要求變得越來越高。為了改善頻譜資源日益緊張的現(xiàn)狀,終端直通技術(shù)(Device-to-Device,D2D)作為一種短距離直接通信技術(shù)應(yīng)運而生。D2D通信就是當兩個終端距離較近時,可以在基站的控制下直接進行數(shù)據(jù)傳輸,而不需要經(jīng)過基站中繼轉(zhuǎn)發(fā)。在網(wǎng)絡(luò)負載較高的情況下,D2D通信可以復(fù)用蜂窩系統(tǒng)的頻譜資源,提高頻譜利用率。但頻譜復(fù)用會產(chǎn)生同頻干擾,如何通過合理的資源分配算法降低D2D用戶和蜂窩用戶之間的干擾,變得至關(guān)重要。通常情況下,基站可以通過信道分配、功率控制和模式選擇等方式來分配資源。在分析了國內(nèi)外對于D2D通信的研究后,本文進一步對資源分配算法進行研究,具體工作和研究成果如下:首先,現(xiàn)有的算法都是假定D2D用戶在各個信道上的功率相同,沒有考慮信道質(zhì)量的差異。針對以上不足,提出了一種集中式資源分配的最優(yōu)算法。該算法以最大化D2D用戶總?cè)萘繛槟繕私⑼箖?yōu)化函數(shù),控制蜂窩用戶和D2D用戶的發(fā)射功率。通過拉格朗日乘子法求解最優(yōu)功率,并把信道分配給具有最大容量的D2D用戶。仿真結(jié)果表明,該算法能顯著增大D2D用戶總?cè)萘?提升系統(tǒng)的整體性能,但計算復(fù)雜度較高。其次,為了降低算法復(fù)雜度,便于在實際場景下應(yīng)用,提出了一種分布式資源分配的次優(yōu)算法。該算法在兩個階段分別進行信道分配和功率控制,先選出D2D用戶的復(fù)用信道集合,然后在信道分配完成的基礎(chǔ)上,優(yōu)化蜂窩用戶和D2D用戶的發(fā)射功率,最大化D2D用戶總?cè)萘�。仿真結(jié)果表明,該算法能有效降低算法復(fù)雜度,性能較為接近最優(yōu)算法。最后,考慮到實際場景下還存在用戶分布不均勻的情況,為了提高系統(tǒng)公平性,提出了一種基于公平性改進的次優(yōu)算法。該算法重點改進了信道分配方案,定義了復(fù)用參數(shù)和復(fù)用參數(shù)門限值,限制每個D2D用戶復(fù)用的信道數(shù)量。仿真結(jié)果表明,該算法在用戶分布不均勻的場景下顯著提高了系統(tǒng)公平性,且性能也較為接近最優(yōu)算法。
[Abstract]:With the rapid development of wireless communication technology, the requirements of transmission rate, system capacity and spectrum efficiency of communication system become more and more high. In order to improve the shortage of spectrum resources, terminal through technology (Device-to-Device,D2D), as a short-range direct communication technology, emerges as the times require. D2D communication is that when two terminals are close, the data can be transmitted directly under the control of the base station. It does not need to be relayed through the base station. In the case of high network load, D2D communication can reuse the spectrum resources of the cellular system and improve the spectrum efficiency. However, spectrum multiplexing can produce co-frequency interference. How to reduce the interference between D2D users and cellular users through a reasonable resource allocation algorithm becomes very important. In general, the base station can allocate resources through channel allocation, power control and mode selection. After analyzing the research of D2D communication at home and abroad, this paper further studies the resource allocation algorithm. The specific work and research results are as follows: firstly, the existing algorithms assume that the power of D2D users is the same in each channel. The difference in channel quality is not taken into account. In order to solve the above problems, an optimal algorithm for centralized resource allocation is proposed. To maximize the total capacity of D2D users, the algorithm establishes a convex optimization function to control the transmit power of both cellular and D2D users. The optimal power is solved by Lagrange multiplier method and the channel is allocated to D2D users with maximum capacity. Simulation results show that the proposed algorithm can significantly increase the total capacity of D2D users and improve the overall performance of the system, but the computational complexity is high. Secondly, in order to reduce the complexity of the algorithm and facilitate its application in practical scenarios, a sub-optimal algorithm for distributed resource allocation is proposed. The algorithm performs channel allocation and power control in two stages, and selects the multiplexed channel set of D2D users, then optimizes the transmission power of cellular users and D2D users based on the completion of channel allocation, and maximizes the total capacity of D2D users. Simulation results show that the algorithm can effectively reduce the complexity of the algorithm and the performance is close to the optimal algorithm. Finally, in order to improve the fairness of the system, an improved sub-optimal algorithm based on fairness is proposed in order to improve the fairness of the system. The algorithm focuses on improving the channel allocation scheme, defines multiplexing parameters and threshold values of multiplexing parameters, and limits the number of channels to be multiplexed by each D2D user. Simulation results show that the proposed algorithm can significantly improve the fairness of the system in the scenario of uneven user distribution, and the performance of the algorithm is close to that of the optimal algorithm.
【學(xué)位授予單位】：杭州電子科技大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TN929.5

【參考文獻】

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

1 陳亞軍;季新生;黃開枝;康小磊;;基于安全中斷概率的D2D安全接入策略[J];通信學(xué)報;2016年08期

2 彭軍;馬東;劉凱陽;張倩倩;張曉勇;;基于LTE D2D技術(shù)的車聯(lián)網(wǎng)通信架構(gòu)與數(shù)據(jù)分發(fā)策略研究[J];通信學(xué)報;2016年07期

3 錢志鴻;王雪;;面向5G通信網(wǎng)的D2D技術(shù)綜述[J];通信學(xué)報;2016年07期

4 王靜;劉向陽;楊洋;王新梅;;LTE通信系統(tǒng)中D2D多播傳輸方案設(shè)計[J];西安電子科技大學(xué)學(xué)報;2016年03期

5 程永生;朱江;林孝康;;引入D2D通信的蜂窩網(wǎng)上行資源分配算法[J];電子與信息學(xué)報;2014年12期

6 黃俊偉;劉曉江;;基于Kuhn-Munkres最優(yōu)匹配的D2D資源分配算法設(shè)計[J];計算機應(yīng)用研究;2015年03期

7 劉雯雯;楊陽;彭濤;王文博;;蜂窩終端直通混合網(wǎng)絡(luò)中基于不同終端速率要求的資源調(diào)度策略[J];電子與信息學(xué)報;2014年10期

8 姚駿;黃清;;蜂窩網(wǎng)絡(luò)中基于D2D位置的聯(lián)合模式選擇與資源分配方案[J];電信科學(xué);2014年08期

9 王華華;呂南;張莉;;一種改進的上行信道估計算法[J];西安郵電大學(xué)學(xué)報;2014年01期

10 孫曉梅;王斌;王文鼐;張梅;;帶有D2D通信的LTE網(wǎng)絡(luò)中提高公平性的方案[J];南京郵電大學(xué)學(xué)報(自然科學(xué)版);2013年06期

相關(guān)碩士學(xué)位論文 前8條

1 尹充;LTE-Advanced系統(tǒng)中D2D通信干擾管理與資源分配研究[D];北京郵電大學(xué);2015年

2 付博方;D2D多播通信場景下的中繼選擇與數(shù)據(jù)分發(fā)機制研究[D];北京郵電大學(xué);2015年

3 孔力;LTE系統(tǒng)下D2D通信的資源復(fù)用與干擾協(xié)調(diào)技術(shù)研究[D];北京郵電大學(xué);2015年

4 姚駿;D2D通信的無線資源管理技術(shù)研究[D];北京交通大學(xué);2014年

5 皮愛霞;LTE系統(tǒng)下D2D多播重傳技術(shù)研究[D];西安電子科技大學(xué);2014年

6 劉佳;LTE系統(tǒng)下D2D通信的干擾控制與資源分配[D];西安電子科技大學(xué);2014年

7 徐燕芳;LTE終端直通通信系統(tǒng)的模式選擇和資源分配[D];浙江大學(xué);2013年

8 李玉;蜂窩控制下的D2D通信系統(tǒng)關(guān)鍵技術(shù)研究[D];安徽大學(xué);2011年

，

本文編號：2219627