請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/54130
標題: | LTE網路中機械通訊隨機存取的動態資源分配 Dynamic Resource Allocation for Random Access of M2M communications in LTE |
作者: | Yuan-Chi Pang 龎元綺 |
指導教授: | 魏宏宇(Hung-Yu Wei) |
關鍵字: | 機械通訊,長期演進技術,隨機存取,資源分配, M2M,LTE,Random access,Resource allocation, |
出版年 : | 2015 |
學位: | 碩士 |
摘要: | 世界正蓬勃發展的物聯網,將使得機械通訊的聯網裝置大增,在次世代的無線網路系統LTE 中,這些裝置的連網需求有極高可能將會造成隨機存取的碰撞。在這篇論文中,為了解決這個問題並提高LTE 連網效能,我們提出了連線數量的估計方法,並以此為基礎分析兩個不同的情境,第一個為考慮機械通訊與人對人通訊的共存情形下之賽局理論分析,另一個則為海量接取下的動態資源分配系統Context-Aware Dynamic Resource Allocation (CADRA)。CADRA 的設計概念是先估計連線數量,再適當分配資源,在穩定成功率下追求最高效率,這個方法也可以進一步套用於多種異質性應用下的情境。我們並透過模擬方式驗證理論,並和標準文件中的解決方案做比較,驗證它的可行性。 According to the prediction, the devices in the Internet of Things will grow explosively. While the huge number of machine-to-machine (M2M) devices connects to the LTE system, the bursty random access attempts from them are potential to cause severe random access collisions. To resolve the problem and improve the performance of LTE RACH, this work gives a map on estimating the number of connections. After that, two scenarios for network access are analyzed. One is a game theoretic analysis to a hybrid scenario, and the other is a context-aware dynamic resource allocation (CADRA) scheme designed for massive devices. CADRA is a two-phased method to resolve random access contention. Phase I is for the estimation of random access attempts, and phase II is for the resource allocation in pursuit of high resource efficiency given high success probability. This approach is also competent in diverse applications with different delay constraint. We evaluate the performance and find that our proposed scheme has better performance over other contention solutions in terms of success probability, resource efficiency and delay. |
URI: | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/54130 |
全文授權: | 有償授權 |
顯示於系所單位: | 電機工程學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-104-1.pdf 目前未授權公開取用 | 756.9 kB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。