本論文在裝置對裝置(Device to Device, D2D)的通訊網路中提出一個啟發式(Heuristic Method)的RB (Resource Blocks)配置法，我們稱為完全圖的RB配置法(RB Allocations using Complete Graph, RACG)，在RACG中，我們將兩個D2D的直接通訊稱作一對(D2D Pair)，在挑選一個D2D Pair來優先配置RB時，我們先將多個D2D Pairs之間的干擾轉換成干擾拓樸圖，接著根據干擾拓樸圖中完全圖彼此之間的交集次數、D2D Pairs之間的干擾程度與D2D Pairs所需的RB個數來挑選出一個要優先配置RB的D2D Pair，在為此D2D Pair優先配置RB時，我們考慮RB的重複使用，當此D2D Pair不會與其他的D2D Pairs (已經被配置RB的)產生干擾時，我們會根據此D2D Pair所需的RB個數來挑選一個最適當的D2D Pair (使用RB個數最相近的)進行複用，當此D2D Pair的RB個數需求超過其他任何一個已分配RB的D2D Pair的RB個數時，我們會讓此D2D Pair使用已分配的最大RB個數再額外增加RB個數以補其不足。為了顯示本機制的優點，我們與以Degree為基礎的貪婪式RB 配置法(RB Allocations using Degree-based Greedy, RADG)進行比較，我們先使用Matlab進行數值模擬，在模擬中，我們設計兩種D2D Pairs的拓樸，分別為Hotspot與Random，模擬結果顯示RACG不論在哪種拓樸下都比RADG更能有效降低RB的使用個數以提升D2D Pair的連線成功率，最後為了比較RACG與RADG所花費的時間，我們分析時間複雜度。

In this thesis, we propose a heuristic method to allocate Resource Blocks (RB) in Device to Device (D2D) 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 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 use Matlab to perform numerical simulation. In the performance comparison, we design two topologies for D2D pairs, hotspot and random. Simulation results show that RACG is better than RADG in either hotspot or random topology. In addition, the proposed RACG can effectively reduce the number of RBs allocated and improve the successful connection rate of D2D pairs. At last, we compare the time complexity between RACG and RADG.

致謝 i
摘要 ii
Abstract iii
目錄 iv
圖目錄 vi
表目錄 vii
第一章　緒論 1
1.1 研究動機 1
1.2 研究方法 1
1.3 章節介紹 3
第二章　D2D在LTE的RB配置 4
2.1 OFDMA Frame 4
2.2 D2D的通訊與頻率複用 5
2.3 RADG 8
2.4 完全圖與Bron-Kerbosch演算法 9
2.5 相關研究 10
2.6 本論文使用完全圖的RB配置法 13
第三章　使用完全圖的RB配置法 14
3.1 D2D Pair的干擾拓樸圖 14
3.2 RACG 16
3.3 D2D Pair節點配置RB區塊 22
第四章　OFDMA Frame的效能分析 24
4.1 RB區塊與RB個數 24
4.2 環境拓樸 26
4.3 Hotspot分佈 27
4.4 Random分佈 31
4.5 時間複雜度 35
第五章　結論與未來工作 37
5.1 結論 37
5.2 未來工作 37
附錄 38
RACG 38
RADG 48
References 57
Acronyms 62
Index 63

[1] “LTE: Evolved Universal Terrestrial Radio Access (E-UTRA): Physical channels and modulations,” 3GPP TS 36.211, ver.12.7.0, Oct. 2015.
[2] “LTE; Evolved Universal Terrestrial Radio Access (E-UTRA) and Evolved Universal Terrestrial Radio Access Network (E-UTRAN),” 3GPP TS 36.300, ver.13.3.0, April, 2016
[3] S. Mumtaz and J. Rodriguez, Smart Device to Smart Device Communication, Springer International Publishing, New Delhi, India, Apr. 2014.
[4] P. Phunchongharn, E. Hossain, and D. I. Kim, “Resource Allocation for Device-to-Device Communication LTE-Advanced Networks,” IEEE Wireless Communications, Vol. 20, no. 4, pp.91-100, Aug. 2013.
[5] C. Lee, S. Min, and J. S. Shin, “Resource Allocation for Device-to-Device Communications Based on Graph-Coloring,” International Symposium on Intelligent Signal Processing and Communication Systems, Nusa Dua, Indonesia, pp. 451-455, 9-12 Nov. 2015.
[6] C. Bron and J. Kerbosch, “Algorithm 457: finding all cliques of an undirected graph,” Communications of the ACM, Vol. 16, no. 9, pp. 575-577, Sep. 1973.
[7] R. P. Grimaldi, “Discrete and Combinatorial Mathematics,” Pearson College Division, 2004.
[8] F. Wang, Y. Li, Z. Wang, and Z. Yang, “Social-Community-Aware Resource Allocation for D2D Communications Underlaying Cellular Networks,” IEEE Transactions on Vehicular Technology, Vol. 65, no.5, pp. 3628-3640, May 2016.
[9] H. Wu, L. Wang, T. Svensson, and Z. Han, “Resource allocation for wireless caching in socially-enabled D2D communications,” IEEE International Conf. on Communications, Kuala Lumpur, Malaysia, pp. 1-6, 22-27 May 2016.
[10] D. Wu, Y. Xu, and Q. Wu, “Resource Allocation for D2D Wireless Networks with Asymmetric Social Weighted Graph,” IEEE Communications Letters, Vol. 21, no. 9, pp. 2085-2088, Sep. 2017.
[11] Z. Zhou, C. Gao, and C. Xu, “Joint peer discovery and resource allocation for social-aware D2D communications: A matching approach,” IEEE International Conference on Communication Systems, Shenzhen, China, 14-16 Dec. 2016.
[12] Y. Sun, T. Wang, L. Song, and Z. Han, “Efficient resource allocation for mobile social networks in D2D communication underlaying cellular networks,” IEEE International Conference on Communications, Sydney, Australia, pp. 2466-2471, 10-14 June 2014.
[13] X. Liu, X. Li, and C. Liu, “Position-based mode selection and resource allocation for D2D communications underlaying cellular networks,” International Conference on Wireless Communications and Signal Processing, Nanijing, China, pp. 1-6, 11-13 Oct. 2017.
[14] N. P. Kuruvatti, A. Klein, L.Ji, C. Zhou, O. Bulakci, J. Eichinger, R. Sattiraju, and H. D. Schotten, “Robustness of Location Based D2D Resource Allocation against Positioning Errors,” 2015 IEEE 81st Vehicular Technology Conference, Glasgow, UK, pp. 1-6, 11-14 May 2015.
[15] F. Chiti, D. D. Giacomo, R. Fantacci, and L. Pierucci, ” Interference aware approach for D2D communications,” 2016 IEEE International Conference on Communications, Kuala Lumpur, Malaysia, pp. 1-6, 22-27 May 2016.
[16] M. C. Lucas-Estan, and J. Gozalvez, “Distance-Based Radio Resource Allocation for Device to Device Communications,” 2017 IEEE 85th Vehicular Technology Conference, Sydney, Australia, pp. 1-5, 4-7 June 2017.
[17] M. Rodziewicz, “Location-based mode selection and resource allocation in cellular networks with D2D underlay,” 21th European Wireless Conference Proceedings of European Wireless, Budapest, Hungary, pp. 1-6 , 20-22 May 2015.
[18] X. Chen, R. Q. Hu, J. Jeon, and G. Wu, “Optimal Resource Allocation and Mode Selection for D2D Communication Underlaying Cellular Networks,” 2015 IEEE Global Communications Conference, San Diego, USA , pp. 1-6, 6-10 Dec. 2015.
[19] B. Holfeld, T. Jaeuthe, and T. Wirth, “Resource Sharing with Minimum QoS Requirements for D2D Links Underlaying Cellular Networks,” 2015 IEEE 81st Vehicular Technology Conference, Glasgow, UK, pp. 1-7, 11-14 May 2015.
[20] D. Zheng, C. He, L. Jiang, J. Ding, Q. Zhang, and Qi Xi, “QoS-based resource allocation for multi-D2D communications in heterogeneous networks,” 2015 IEEE International Conference on Communication Workshop, London, UK, pp. 602-607, 8-12 June 2015.
[21] C. Liu and J. Zheng, “A QoS-Aware Resource Allocation Algorithm for Device-to-Device Communication Underlaying Cellular Networks,” 2017 IEEE 85th Vehicular Technology Conference, Sydney, Australia, pp. 1-5, 4-7 June 2017.
[22] B. Yu and Q. Zhu, “A QoS-based resource allocation algorithm for D2D communication underlaying cellular networks,” 2016 Sixth International Conference on Information Science and Technology, Dalian, China, pp. 406-410, 6-8 May 2016.
[23] T. Yang, R. Zhang, X. Cheng, and L. Yang, “Graph Coloring Based Resource Sharing (GCRS) Scheme for D2D Communications Underlaying Full-Duplex Cellular Networks,” IEEE Transactions on Vehicular Technology, Vol. 66, no. 8, pp. 7506-7517. Aug. 2017.
[24] R. Zhang, X. Cheng, L. Yang, and B. Jiao, “Interference Graph-Based Resource Allocation (InGRA) for D2D Communications Underlaying Cellular Networks,” IEEE Trans. on Vehicular Technology, Vol. 64, no. 8, pp. 3844-3850, Aug. 2015.
[25] A. Pratap, and R. Misra, “Resource sharing in D2D communication underlaying cellular LTE-A networks,” 2015 International Conference on Advances in Computing, Communications and Informatics, Kochi, India, pp. 103-109, 10-13 Aug. 2015.
[26] K. Zhao, M. Sheng, J. Liu, Y. Dai, L. Liu, Y. Shi, and J. Li, “Graph-based joint mode selection and resource allocation scheme for D2D and cellular hybrid network using SCMA,” 2016 8th International Conference on Wireless Communications & Signal Processing, Yangzhou, China, pp. 1-5, 13-15 Oct. 2016.
[27] X. Cai, J. Zheng, and Y. Zhang, “A Graph-coloring based resource allocation algorithm for D2D communication in cellular networks,” 2015 IEEE International Conf. on Communications, London, UK, pp. 5429-5434, 8-12 June 2015.
[28] J.W. Moon and L. Moser, “On cliques in graphs,” Israel J. Math, Vol.3, no.1, pp. 23-28, Mar. 1965.