Download presentation
Presentation is loading. Please wait.
Published by位 匡 Modified 8年之前
1
Mode Selection and Resource Allocation for Deviceto- Device Communications in 5G Cellular Networks 104523019 林柏毅 104523049 羅傑文
2
Introduction Mode Selection Resource Allocation Power control
3
5G(fifth-generation) 遠景 1. 網速的進化,從 Mbps 為單位躍升為 Gbps ,短距離傳輸速率甚至 達到 10~20Gbps ,是目前 LTE 的 100 倍以上。 2. 物物可相連,突破過去蜂巢式基地台的限制可以容納更多裝置 連結使用並具備低延遲性的特性,可以支持的設備數量是 4G 網 絡的 10 倍,將可開啟物聯網時代的新天地。
4
5G 面臨的問題 未來行動裝置越來越多,要如何在有限頻譜內放入更多的裝置成 為了一大問題 5G 解決方案之一: D2D (Device-to-Device)communication (intel Qualcomm…. 等 )
5
D2D (Device-to-Device)communication 優點: Reuse spectrum resource, Offloading the traffic load from BS (Base station) 面臨挑戰: mode selection,resource allocation, interference,D2D discovery, Synchronizaton…. 等
6
Introduction At first, according to mode selection criteria, the system determine whether underlay mode should be used. Second, resource allocation scheme focuses on minimizing overall interference. Last, a power control method is to improve the performance of D2D systems.
7
D2D system model
8
Mode Selection SINR of CUE can be express as : The distance between D-Tx & CUE can be calculated as : The original SNR of CUE is given as : After D2D underlay mode has been adopted, the transmission Qos of CUE should be guaranteed.
11
The underlay mode can be selected.
12
Resource allocation In order to maximize the total throughput after the introduction of D2D communications, we switch the optimization problem into minimize the interference caused by frequency reuse Resource reuse matrix
13
heuristic overall optimization resource allocation algorithm (HORA) STEP1:Compute the interference when each D2D pair reuses different CUE resource, the interference is denoted as i i,k,then build the interference matrix I M,N STEP2:Construct the resource reuse indication matrix X M,N STEP3:Build the objective function. The objective is to find the optimal resource allocation method that minimizes the total co- channel interference
14
Step 4: By using the Hungarian Algorithm [22-24], the optimal C-links assignment matrix X* can be calculated.
15
Hungarian Algorithm 40 60 15 25 30 45 55 30 25
16
STEP1 : Row Reduce 40 60 15 25 30 45 55 30 25 25 45 0 0 5 20 30 5 0
17
STEP2 : Column Reduce 25 45 0 0 5 20 30 5 0 25 35 0 0 0 20 30 0 0
18
STEP3 : Test for an optimal assignment 25 35 0 0 0 20 30 0 0
19
STEP4 : Making the final assignment 25 35 0 0 0 20 30 0 0 40 60 15 25 30 45 55 30 25 Min=25+30+15=70
20
Power control Decrease transmit power of eNB Increase transmit power of D2D
23
Simulation result
Similar presentations