LTE物聯通訊群組傳呼機制之數學分析模型

Modeling LTE Group Paging Mechanism for Machine-Type Communications

張正廷(Cheng-Ting Chang)

指導教授 ： 楊舜仁

國立清華大學/電機資訊學院/資訊工程學系/碩士(2013年)

https://doi.org/10.6843/NTHU.2013.00698

摘要

越來越多物聯通訊設備的出現，使得大量設備同時執行隨機存取(Random Access)競爭上行通道的資源，導致通訊網路的壅塞。群組傳呼(Group Paging)機制可藉由集中式的存取控制來分散這些同時存取的設備。本篇論文針對群組傳呼中多個群組執行隨機存取的運作流程進行分析，進而發展出分析模型。基於此分析模型，本論文設計了一個群組傳呼的運作機制，可使用較少的時間完成所有設備的傳呼並同時滿足設備期望的成功機率。此外，本論文也針對傳統 LTE 傳呼機制與其它群組傳呼的方法設計了模擬實驗，比較不同方法的效能。

關鍵字

物聯網 ； 隨機存取 ； 群組傳呼

並列摘要

The increasing Machine-Type Communications (MTC) devices will make the network congestion because enormous devices simultaneously perform the random access to obtain the uplink resources. The group paging mechanism may solve this issue by centralized control to disperse the devices. This paper develops an analytic model to study the operation of multi-group random access procedure. Based on the analytic model, we design an approach to implement the group paging mechanism that satisfies the success probability of random access and consumes the less completion time to finish the whole procedure. Furthermore, we compare the performance of the paging and group paging mechanism in our simulation.

並列關鍵字

Machine-Type Communications ； random access ； group paging

參考文獻

[1] Jain, P. ; Hedman, P. ; Zisimopoulos, H. Machine type communications in 3GPP

systems. IEEE JOURNALS & MAGAZINES, Nov, 2012.

and System Aspects; Service requirements for Machine-Type Communications

Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA); Medium

(2011-12), 2011