計劃中文名稱: 在5G的D2D行動通訊網路上使用完全圖的資源區塊配置法

中文計畫摘要：
本計畫在裝置對裝置(Device to Device, D2D)的5G行動通訊網路中提出一個使用完全圖的RB配置法(Resource-block Allocations using Complete Graph, RACG)，在RACG中，我們將兩個D2D的直接通訊稱作一個D2D Pair，在挑選一個D2D Pair來優先配置RB時，我們先將多個D2D Pairs之間的干擾情況轉換成干擾拓樸完全圖，接著RACG會根據以下三個條件挑選一個D2D Pair優先配置RB:(1)干擾拓樸完全圖彼此之間的交集次數、(2) D2D Pairs彼此的干擾程度、(3) 一個D2D Pair所需的RB個數。當為此D2D Pair優先配置RB時，我們會考慮是否可以重複使用RB，也就是說，當此D2D Pair不會與其它已經配置RB的D2D Pairs產生干擾時，我們會根據此D2D Pair所需求的RB大小挑選一個最相近且已被分配的RB來進行複用，當此D2D Pair的RB需求超過其它任何已被分配的RB大小時，我們會讓此D2D Pair使用其中一個最大的RB另外再補其不足。為了驗證本機制的優點，我們將與使用Degree為基礎的貪婪式RB 配置法(RB Allocations using Degree-based Greedy, RADG)進行效能分析與比較，我們將使用Matlab進行模擬，在模擬中，我們將設計兩種D2D Pairs的拓樸，分別為Hotspot與Random，效能參數將包含整體RB的使用數與D2D Pairs的成功連線率。

關鍵字 ：5G、D2D、RB配置、頻率複用、完全圖、行動通訊網路。

英文計畫摘要：
In this project, we propose a heuristic method to allocate Resource Blocks (RB) in D2D (Device-to-Device) 5G mobile communication networks. We refer this method as to RB Allocations using Complete Graph (RACG). In RACG, direct communication between two D2Ds is referred to as a pair. A D2D pair is selected to allocate RB by priority. To differentiate the priority of D2D pairs, first we convert the interference among multiple D2D pairs into the interference topology. Then according to the number of intersections among complete graphs in the interference topology, the degree of interference among the D2D pairs, and the number of RBs requested by a D2D pair, we can select a D2D pair to allocate RB. When the selected D2D pair is allocated RB, we consider the reuse of RB. If this D2D pair won' t interfere with other D2D pairs (RB already allocated), we will select the nearest amount of RB from a D2D pair to reuse. If the number of RBs required by this D2D pair is greater than any RB already allocated, we will let this D2D pair to reuse the maximum number of already allocated RB and search for additional number of RB. In order to demonstrate the advantage of RACG, we will compare the system performance, in terms of OFDMA frame utilization and the number of RB allocated, between RACG and RB Allocations using Degree-based Greedy (RADG). We will use Matlab to perform numerical simulation. In the performance comparison, we will design two topologies for D2D pairs, hotspot and random. Simulation results will validate that RACG is better than RADG in either hotspot or random topology. In addition, we will demonstrate that the proposed RACG can effectively reduce the number of RBs allocated and improve the successful connection rate of D2D pairs.

關鍵字 ：5G, D2D, RB allocation, Frequency reuse, Complete graph, Mobile communication networks.