Traffic Control and Collision Resolution for Random Access in M2M Communication

Internet-of-Things (IoT), which aims to integrate machines, industrial process, and people together, has become one of the most critical technology for the next wave of industrial revolution. Among many related technical fields of IoT, machine-to-machine (M2M) communication is the most important paradigm to realize the seamless information exchange between different machine-type devices (MTDs) with minimal human interference and has experienced rapid development in the past few decades. However, features of M2M communication such as diverse applications, small data packets, and large connections, would cause quality-of-service (QoS) dissatisfaction, channel utilization deterioration and severe collisions to the random access procedure, which is adopted to establish initial connections between MTDs and the base station. To overcome these drawbacks, this thesis aims to design effective access traffic control and collision resolution methods for the massive M2M communication oriented random access procedure. Towards the feature of diverse applications, a multi-group analytical framework for massive random access of M2M communication in IoT is proposed. Specifically, we consider delay-sensitive MTDs and delay-tolerate MTDs coexist in the network, and those MTDs are divided into multiple groups according to their delay requirements. The throughput and the mean access delay of each group of MTDs are characterized based on queue theory. Then, the access traffic control method is formulated as an optimization problem to maximize the throughput of delay-tolerate MTDs under delay constraints of delay-sensitive MTDs. Simulations show that the proposed access traffic control method can achieve the maximum throughput of both the whole network and the delay-tolerate MTDs while satisfy the delay requirements of delay-sensitive MTDs. The channel utilization will decrease dramatically due to frequent signaling exchange, especially with the small data packets in M2M communication. To solve this drawback, two distributed access traffic control algorithms are proposed for homogeneous and heterogeneous scenarios, respectively. In particular, each MTD only needs to observe its own number of successful access requests and the total number of access request attempts within a certain estimation period, and the essential parameters to control the access traffic can be obtained from the observations. Simulations show that when the number of MTDs in the network does not change or varies slowly, the network throughput can be maximized if the estimation interval is chosen properly. Compared to existing centralized methods, the proposed method can achieve similar performance with much lower signaling overhead. In addition, to improve the random access efficiency in massive M2M communication where the number of MTDs is huge, a deep neural networks based double-contention random access (DCRA) mechanism is proposed. In particular, the base station first adopts a deep neural network to detect random access collisions by learning the features of the received signals. Based on the collision-detection results, a DCRA scheme is proposed, with which the base station can schedule one more contention process for devices experiencing collisions to resolve these collisions. To fully harness the collision-resolution capability of the proposed DCRA scheme, we further analyze its performance, and illustrate how to control the access traffic to optimize the network throughput. Simulation results show that with a high collision recognition accuracy, the proposed scheme can achieve significant throughput improvement. In the final part of this thesis, a hybrid channel access by admission and contention (HCAAC) scheme is designed to achieve the coexistence of real-time applications (RTA) and non-RTA in Wi-Fi networks while optimizing the delay performance of RTA. With this scheme, the base station can schedule the transmission of RTA packets and temporarily interrupt the transmission procedure of non-RTA packets to guarantee a quick channel access for RTA packets, the delay of non-RTA packets can also be improved without the contention from RTA packets. An optimization problem is formulated to illustrate how to control the access traffic to minimize the delay performance of RTA. Simulations show that with the proposed HCAAC scheme, the delay performance of RTA can achieve a dramatic improvement, while the performance of non-RTA does not deteriorate