簡易檢索 / 詳目顯示

研究生: 李俊毅
Lee, Chun Yi
論文名稱: One-to-many resource allocation for device-to-device communications underlaying LTE-Advanced networks
在LTE-A網路下以一對多資源分配的D2D通訊
指導教授: 高榮駿
口試委員: 楊舜仁
趙熙綠
學位類別: 碩士
Master
系所名稱: 電機資訊學院 - 資訊工程學系
Computer Science
論文出版年: 2014
畢業學年度: 102
語文別: 英文
論文頁數: 30
中文關鍵詞: 4G資源分配點到點通訊頻譜使用率
相關次數: 點閱:2下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 設備到設備(D2D)通信作為墊層高級LTE網絡被證明是有效的,改善網絡的性能,並釋放通信業務負荷的基站。通過重用蜂窩用戶的資源塊中,D2D通信可以提高整體頻譜效率。然而,由於再利用蜂窩用戶(線索)的相同的資源塊中,有D2D對與線索之間的相互干擾。在本文中,我們分析這是如何通過分配線索D2D對的資源塊在滿足服務質量(QoS)的線索的質量,以最大化總吞吐量的問題。我們制定上行資源分配問題,其中一個CUE可以共享同一個以上的D2D對所述資源。我們也證明了它是一個NP難問題,並提出了一種啟發式算法,稱為貪婪吞吐量最大(GTM)算法來最大化總吞吐量。仿真結果表明,該算法不僅具有更高的吞吐量,也有較大的耆那教的公平性指數較其他人。


    Device-to-device (D2D) communications as an underlaying LTE-Advanced network are proved to be efficient in improving the network performance and releasing the traffic load of base station. By reusing the resource block of cellular users, the D2D communications can enhance the overall spectral efficiency. However, due to reusing the same resource block of cellular users (CUEs), there are mutual interference among D2D pairs and CUEs. In this paper, we analyze the problem which is how to maximize the total throughput by assigning the resource blocks of CUEs to D2D pairs under satisfying the quality of service (QoS) of CUEs. We formulate the uplink resource allocation problem where one CUE can share the resource with more than one D2D pairs. We also prove it is a NP-hard problem, and propose a heuristic algorithm called Greedy Throughput Maximum (GTM) algorithm to maximize the total throughput. Simulations results show that our algorithm not only has more throughput, but also has bigger Jain's fairness index than other else.

    在LTE-A網路下以一對多資源分配的D2D通訊 i Abstract i Table of contents ii List of figures iii Chapter 1 Introduction 1 1.1 Motivation 1 1.2 Related work 3 Chapter 2 System model and Problem formulation 6 2.1 System model 6 2.2 Problem formulation 8 Chapter 3 Resource allocation algorithm 11 Lemma 1. 11 3.1 Greedy Throughput Maximum algorithm 13 Chapter 4 Simulation 18 4.1 Compared algorithm 18 4.1.1 Greedy resource allocation algorithm 18 4.1.2 Optimal resource allocation algorithm 18 4.1.3 Random resource allocation algorithm 19 4.2 Simulation settings 19 4.3 Simulation results 20 Chapter 5 Conclusion 28 Reference 29

    [1] T. Han, R. Yin, Y. Xu, and G. Yu, “Uplink channel reusing selection optimization for device-to-device communication underlaying cellular networks,” in Proc. IEEE PIMRC’2012, pp. 559 –564, Sept. 2012.
    [2] Zulhasnine M., et al., "Efficient resource allocation for device-to-device communication underlaying LTE network", IEEE 6th WiMob conference 2010, pp.368-375, 11-13 Oct. 2010
    [3] D. Feng, L. Lu, Y. Yuan-Wu, G. Y. Li,G. Feng, and S. Li, “Device-todevice communications underlaying cellular networks,” IEEE Trans. Commun., vol. 61, no. 8, pp. 3541–3551, Aug. 2013.
    [4] Min Sheng, Xijun Wang, Yan Zhang, Junyu Liu, Kan Wang, "Resource allocation for maximizing the device-to-device communications underlaying LTE-Advanced networks," IEEE in ICCC, pp.60-64, Aug.2013
    [5] Stefano Basagni, "Finding a Maximal Weighted Independent Set in Wireless Networks," in Telecommunication Systems, Volume 18, Issue 1-3 , pp 155-168, 2001-09-01
    [6] C.-H. Yu, K. Doppler, C. B. Ribeiro, and O. Tirkkonen, “Resource shaing optimization for device-to-device communication underlaying cellular networks,” IEEE Transactions on Wireless Communications,vol. 10, no. 8, pp. 2752–2763, Aug. 2011.
    [7] http://en.wikipedia.org/wiki/Channel_state_information
    [8] http://en.wikipedia.org/wiki/Knapsack_problem
    [9] P. Janis, V. Koivunen, C. Ribeiro, J. Korhonen, K. Doppler, and K. Hugl, “Interference-aware resource allocation for device-to-device radio underlaying cellular networks,” in Proc. IEEE VTC Spring, Apr. 2009.
    [10] C. Xu, L. Song, Z. Han, Q. Zhao, X. Wang, and B. Jiao, “Interference-Aware Resource Allocation for Device-to-Device Communications as an Underlay Using Sequential Second Price Auction,” in Proc. IEEE ICC,Jun. 2012.
    [11] A. Gibbons., Algorithm Graph Theory. Cambridge University Press, 1985
    [12] D. West et al., Introduction to Graph Theory. Prentice Hall, 2001.
    [13] http://en.wikipedia.org/wiki/Fairness_measure
    [14] C. Xu, L. Song, Z. Han, D. Li, and B. Jiao, “Resource allocation using a reverse iterative combinatorial auction for device-to-device underlay cellular networks,” in Proc. IEEE Global Communications Conference, Anaheim, Dec. 2012.

    [15] Chia-Hao Yu, et al., "Resource Sharing Optimization for De-vice-to-Device Communication Underlaying Cellular Net-works", IEEE Transactions on Wireless Communications, vol.10, no.8, pp.2752-2763, August 2011
    [16] K. Doppler, C.-H. Yu, C. B. Ribeiro, and P. Janis, “Mode selection for device-to-device communication underlaying an LTE-Advanced network,” in IEEE Wireless Communications and Networking Conference, 2010.

    無法下載圖示 全文公開日期 本全文未授權公開 (校內網路)
    全文公開日期 本全文未授權公開 (校外網路)

    QR CODE