The Research On Radio Resource Scheduling For M2M Communications In Cellular Networks

The Internet of things(IoT) is a promoter of the third industry wave of information technology. Interest in Machine-to-Machine (M2M), as the core part of IoT, has grown recently for a wide range of applications for which it is benificial. M2M communications, being different from Human-to-Human (H2H) communi-cations, is a new type of communication mode. In M2M communications, each machine is almost under the condition of no human’s intervention to accomplish the communication process. The M2M communication applications have been widely applied in many industry fields (e.g., smart grids, transportation, eHealth, in-dustrial, monitoring). In this thesis, radio resource scheduling scheme for M2M communications in cellular network is investigated.Firstly, radio resource allocation and scheduling scheme for periodic M2M communications is investi-gated. We propose four kinds of radio resource allocation and scheduling schemes for periodic M2M com-munications. The main idea of the scheme is "one access" (OA) and "period using" (PU), which is similar to the semi-persistent scheduling in LTE systems. Specifically, OA means that M2M users only need to ac-complish one random access (RA) process. After RA process, the base station(BS) will not interact with the M2M users which have already accomplished the OA process and directly allocate the same time-frequency resource with the last period to M2M uses for data transmissions. That is the PU. The OA in four kinds of the radio resource allocation and scheduling scheme is the same, but the difference is in PU. In OA, in order to further analyze the performance of these solutions, we also discuss random access process with fallback. mechanism and compare these schemes. Simulation results show, compared with ALOHA algorithm, OAPR algorithm greatly increase access success rate and reduce the average delay, can effectively solve the problem of RAN wireless access overload, especially over time, the performance is more obvious.Subsequently, in PU, we focus on resource scheduling for M2M communication and propose four kinds of resource scheduling algorithms for periodic M2M communications(PSO, PSCM, MCT, OMS). These al-gorithms are based on channel resource reuse condition. Channel resources mutiplexing condition is that in a channel resources, the number of M2M user branching channel is greater than the greatest common divisor of the M2M period. Then, we analysis the capacity and resources planning aspects of these the resource scheduling schemes. In addition, the simulation compare with the PSO, PSCM and MCT. Simulation results show that the PSO algorithm performance is more poor than the other two, but the advantage is simple. PSCM resource scheduling algorithm and MCT resource scheduling algorithm can effectively reduce the number of M2M communication channel resources occupied by M2M users and the time-frequency resources waste rate, but more complex.Finally, in terms of access control, the number of channel resources occupied by M2M users may be greater than the total number of channel resources allocated for M2M communication. Then, the system will not be able to accept all of the M2M users. Therefore, we propose a kind of traffic shaping schemes for each wireless resource allocation and scheduling schemes. The main idea for traffic shaping is to adjust M2M user period which makes all M2M users accepted by base station(BS). Then the traffic shaping algorithm are discussed and simulated. Simulation results show that after traffic shaping, the number of channel resources occupied by M2M users is less than the total number of channel resources allocated for M2M communication. all M2M users are accepted by BS.