發(fā)布時(shí)間：2018-09-18 07:27

【摘要】：近年來(lái),隨著5G研究工作的積極開展,其關(guān)鍵技術(shù)也受到廣大研究者的青睞。其中D2D(Device-to-Device)技術(shù)優(yōu)勢(shì)突出,成為了研究的熱點(diǎn)。D2D通信可以使終端設(shè)備之間直接通信,從而減輕基站負(fù)載、降低傳遞時(shí)延、提高通信質(zhì)量。如今網(wǎng)絡(luò)中用戶需求呈爆炸性增長(zhǎng),而網(wǎng)絡(luò)中資源是有限的,因此在D2D通信過(guò)程中,良好的資源分配方案是減少干擾、提升資源利用率的關(guān)鍵。本文致力于研究D2D通信中資源分配的優(yōu)化算法,主要研究工作有以下兩點(diǎn):第一,由于點(diǎn)對(duì)點(diǎn)數(shù)據(jù)共享業(yè)務(wù)需求的增多,為了降低網(wǎng)絡(luò)服務(wù)延遲,提高通信效率,可以將緩存技術(shù)應(yīng)用于D2D通信,來(lái)應(yīng)對(duì)媒體業(yè)務(wù)的增長(zhǎng)。在D2D緩存技術(shù)中,緩存命中率是衡量系統(tǒng)緩存性能好壞的關(guān)鍵指標(biāo),如何分配有限的緩存資源,使緩存命中率最大化是研究的重點(diǎn)。本文對(duì)現(xiàn)有的D2D緩存技術(shù)進(jìn)行了分類總結(jié),提出了基于全雙工通信的D2D緩存模型,并建立優(yōu)化模型求解出了使緩存命中率最大的緩存資源分配方案。仿真結(jié)果顯示,本文所提出的基于全雙工的D2D緩存技術(shù)的緩存命中率相較于半雙工模式有明顯的提升。第二,由于D2D設(shè)備之間的通信不經(jīng)過(guò)基站的轉(zhuǎn)發(fā),終端需要處理設(shè)備配對(duì)、模式選擇、信道估計(jì)以及功率分配一系列問(wèn)題,由此帶來(lái)額外的電量消耗。將能量收集技術(shù)應(yīng)用于D2D通信,能夠有效增加通信節(jié)點(diǎn)的傳輸功率,提升系統(tǒng)容量。本文研究了基于能量收集的D2D通信技術(shù),在高斯白噪聲信道中構(gòu)建了基于能量收集的D2D通信模型,并通過(guò)為收發(fā)節(jié)點(diǎn)合理分配通信時(shí)長(zhǎng),使系統(tǒng)容量最大化。在此基礎(chǔ)上,研究了陰影衰落信道中的能量收集D2D系統(tǒng)容量?jī)?yōu)化問(wèn)題,并仿真分析了系統(tǒng)容量的平穩(wěn)性。
[Abstract]:In recent years, with the active development of 5G research, its key technology is also favored by the majority of researchers. Among them, D2D (Device-to-Device) technology has become the focus of research. D2D communication can make the terminal equipment communicate directly, thus reducing the load of the base station, reducing the transmission delay and improving the communication quality. Nowadays, the demand of users in the network increases explosively, but the resources in the network are limited. Therefore, in D2D communication, a good resource allocation scheme is the key to reduce interference and improve the utilization of resources. This paper focuses on the optimization algorithm of resource allocation in D2D communication. The main research work is as follows: first, due to the increasing demand for point-to-point data sharing services, in order to reduce network service delay and improve communication efficiency, Cache technology can be applied to D-D communication to cope with the growth of media business. In D2D cache technology, cache hit ratio is the key index to evaluate the system cache performance. How to allocate limited cache resources and maximize cache hit ratio is the focus of research. In this paper, the existing D2D cache technology is classified and summarized, and a D2D cache model based on full-duplex communication is proposed, and an optimized model is established to solve the cache resource allocation scheme, which makes the cache hit rate maximum. The simulation results show that the cache hit ratio of D2D cache based on full duplex proposed in this paper is much higher than that of half-duplex mode. Second, because the communication between D2D devices is not transmitted through the base station, the terminal needs to deal with a series of problems such as device pairing, mode selection, channel estimation and power allocation, resulting in additional power consumption. The application of energy collection technology to D2D communication can effectively increase the transmission power of communication nodes and enhance the system capacity. In this paper, the D2D communication technology based on energy collection is studied, and the D2D communication model based on energy collection is constructed in Gao Si white noise channel, and the system capacity is maximized by allocating the communication time to the transceiver node reasonably. On this basis, the capacity optimization problem of energy collection D2D systems in shadowed fading channels is studied, and the stability of the system capacity is simulated and analyzed.
【學(xué)位授予單位】：電子科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TN929.5

【參考文獻(xiàn)】

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

1 龔文熔;無(wú)線蜂窩網(wǎng)絡(luò)中的D2D多播資源分配技術(shù)研究[D];北京郵電大學(xué);2015年

2 馮大權(quán);D2D通信無(wú)線資源分配研究[D];電子科技大學(xué);2015年

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

1 黃小檸;面向無(wú)線緩存的D2D技術(shù)研究[D];電子科技大學(xué);2016年

2 梁彪;內(nèi)容分發(fā)網(wǎng)絡(luò)協(xié)作緩存算法研究[D];北京交通大學(xué);2016年

，

本文編號(hào)：2247213