支援D2D之全雙工電信網路資源分配設計

Radio Resource Allocation for D2D-assisted Full-duplex Cellular Networks

高精為(Jing-Wei Kao)

指導教授 ： 逄愛君

國立臺灣大學/電機資訊學院/資訊工程學研究所/碩士(2014年)

https://doi.org/10.6342/NTU.2014.10924

摘要

隨著行動裝置(如智慧型手機與平板電腦) 與行動應用程式(如Line、WhatsApp)
普及，行動上網流量持續增加。面對未來之巨大資料量，如何有效率使用有限之無線頻譜資源將是一個重要課題，其相關技術包括: 全雙工與設備對設備之通訊等。全雙工技術允許上載與下載之雙向資料，能夠在相同時間與頻道上傳輸。本篇論文討論: (分散式) 全雙工電信網路資源分配問題。(分散式) 全雙工網路由具有全雙工能力之基地台與半雙工運作之手持裝置所組成。我們將所有手持裝置區分為兩個類別: 具有上載與下載需求之手持裝置。在我們所考慮之情境下，具全雙工能力之基地台扮演排程器角色，將無線通道分配給所有半雙工之手持裝置使用，每一個無線通道可讓有上載與下載需求之兩半雙工手持裝置一起分享，然此兩手持裝置之間會產生相同頻道之相互干擾問題，進而影響兩者之吞吐量。因此，對於整個系統而言，需要妥善分配無線通道來滿足所有半雙工手持裝置之需求，且使干擾問題最小化。問題之目標是要使用越少之蜂巢網路資源來滿足所有手持裝置之需求，且使用頻外之設備對設備通訊來資料卸載。為了解決此問題，我們將問題轉換為圖論中(完美) 二極圖之配對問題，使用匈牙利演算得到最佳配對方式，並藉由設備對設備之通訊，提出貪婪式篩選法來選擇資料卸載候選人。

關鍵字

全雙工 ； 自我干擾 ； 同頻干擾 ； 設備對設備之通訊 ； 資料卸載

並列摘要

With the prevalence of mobile devices (e.g., smart phones and tablet computers) and mobile apps (e.g., Line and WhatsApp), the volume of mobile data traffic increases tremendously. How to efficiently utilize the precious and scarce spectrum resources is a key problem for the next-generation wireless network. Full-duplex radio (FD) and deviceto-to-device communication (D2D) provide insights into solving the dilemma. FD enables data transmission and reception on the same frequency band at the same time. In this thesis, we study the single cell channel assignment problem for distributed full-duplex cellular network. A distributed full-duplex cellular network consists of FD-enabled base station (BS) with a population of half-duplex (HD) user equipment (UEs). All the UEs are classified into two categories with uplink and downlink data requests respectively. In the focused scenario, the FD-enabled scheduler (BS) allocates a wireless subchannel to a pair
of uplink and downlink HD UEs to satisfy their data requests, whereas the two nodes (UEs) suffer from the inter-node interference at the same time. From the perspective of the whole system, it takes a novel solution to assign the wireless subchannels appropriately for all UEs and reduce the effect of inter-node interference. Hence, the objective of our problem is set to minimize the number of consumed cellular resources to satisfy the requests of all UEs and take the inter-node interference into account at the same time. In order to tackle the problem, we propose a greedy approach for the selection of offloading candidates via
D2D under distributed full-duplex. For the interference minimization, we transform it into a graph matching problem. An efficient channel assignment algorithm is proposed.

並列關鍵字

Full-duplex (FD) ； Self-interference ； Inter-node interference ； Channel Assignment Problem ； Device-to-Device Communication (D2D) ； Data Offloading

參考文獻

[1] ERICSSON, “Ericsson white paper: Lte release 12,” 2013.

[2] M. Jain, J. T. Choi, T. Kim, D. Bharadia, S. Seth, K. Srinivasan, P. Levis, S. Katti, and P. Sinha, “Practical real-time full duplex wireless,” ACM Mobicom, vol. 52, no. 2, pp. 301–312, Sep. 2011.

[3] M. Duarte, C. Dick, and A. Sabharwal, “Experiment-driven characterization of fulld-duplex wireless systems,” Wireless Communications, IEEE Transactions on.

[4] D. Bharadia, E. McMilin, and S. Katti, “Full duplex radios,” ACM SIGCOMM, pp.375–386, Aug. 2013.

[5] X. Ge, J. Thompson, H.-C. Wu, R. Irmer, H. Jiang, G. Fettweis, and S. Alamouti, “5g wireless communication systems: Prospects and challenges,” IEEE Communications