在 5G 通訊網路中對於機器類型通訊的基於提示的隨機存取協議

隨著機器類型通信裝置的數量的增加，傳統長期演進說系統遇到了若干新挑戰。一個關鍵問題是有很多機器類型通訊裝置試圖進行隨機訪問程序，可能會造成大量的碰撞和長時間的延誤。在這項工作中，我們提出了一種新的隨機訪問機制，通過將LTE中基於競爭的前導碼分為兩個邏輯上不相交的部分，一個用於正在被尋呼用戶裝置，而另一個用於未被尋呼的用戶裝置。由於基地台知道被尋呼的裝置的ID，所以一種新穎的基於散列的（我們稱之為提示的）隨機接入，是可能的。主要思想是以非競爭的方式將前導碼預分配給被尋呼的裝置，並限制非尋呼的裝置在一個單獨的部分競爭。我們還建立一個數學模型來算出最佳比例的預先分配前導碼。最後進行了廣泛的模擬以驗證我們的結果。

關鍵字

通訊協議；物聯網； LTE ；機器類型通訊；無線網路

並列摘要

With the increasing popularity of machine-type communication (MTC) devices, several new challenges are encountered by the legacy long term evolution (LTE) system. One critical issue is that a massive number of MTC devices trying to conduct random access procedures may cause significant collisions and long delays. In this work, we present a new random access mechanism by splitting the contention-based preambles in LTE into two logically disjoint parts, one for the user equipment (UE) being paged and the other for the UEs not being paged. Since the IDs of paged UEs are known by the base station, a novel hash-based random access, which we call hint, is possible. The main idea is to pre-allocate preambles to paged UEs in a contention-free manner and confines non-paged UEs to contend in a separate region. We further build a mathematical model to find the optimal ratio of pre-allocated preambles. Extensive simulations are conducted to validate our results.