Future machine-to-machine (M2M) communications need to support a massive number of devices communicating with each other with little or no human intervention. Random access techniques were originally proposed to enable M2M multiple access, but suffer from severe congestion and access delay in an M2M system with a large number of devices. In this paper, we propose a novel multiple access scheme for M2M communications based on the capacity-approaching analog fountain code to efficiently minimize the access delay and satisfy the delay requirement for each device. This is achieved by allowing M2M devices to transmit at the same time on the same channel in an optimal probabilistic manner based on their individual delay requirements. Simulation results show that the proposed scheme achieves a near optimal rate performance and at the same time guarantees the delay requirements of the devices. We further propose a simple random access strategy and characterize the required overhead. Simulation results show that the proposed approach significantly outperforms the existing random access schemes currently used in long term evolution advanced (LTE-A) standard in terms of the access delay.
Additionally, different MTC devices have diverse service requirements and traffic patterns in M2M communications. Generally, we can divide the traffic types into four different categories. The first type is the alarm traffic, which is completely random and its probability is very low; however, it has a very strict delay requirement. The second traffic type can be modeled by a random Poisson distribution with the parameters depending on the application @cite_22 . The regular traffic, such as smart metering applications, is the third traffic type, and the last type is the streaming, like video surveillance applications. Current proposals for enabling M2M communications, did not consider the priorities among devices and different quality of service (QoS) requirements. These approaches are mostly inefficient for M2M communications as they are generally designed for a fixed payload size and thus, cannot support M2M applications with different service requirements.
@cite_22
2151771412 2114220728 2110767187 1966552195
Machine-to-machine (M2M) communications have many applications, such as in smart grid, health monitoring alerting, and intelligent transportation. Due to unique characteristics that are different from the traditional human-to-human communications, numerous design challenges have to be tackled in M2M. A critical issue is that of dealing with the massive access of machine-type communication (MTC) devices while guaranteeing the desired quality of service (QoS). In this paper, we group MTC devices into clusters based on their QoS requirement. By utilizing the time-controlled M2M feature, we formulate the problem of massive access with QoS guarantee as a queuing problem. We derive an overflow probability estimation model by applying a large deviation principle and then propose an online-measurement-based adaptive massive access management for deciding the amount of resources allocated for each cluster. The proposed method bases the decision on the observed traffic workload with no prior knowledge of its statistics. We conduct the simulations in multicluster scenarios with distinct maximum tolerable delay and corresponding acceptable probability in a long-term evolution system. The simulation results show the adaptability of the proposed massive access management regime to the variations in the traffic workload; thus, it is capable of accommodating dynamic propagation conditions and unknown traffic characteristics, particularly in burst-by-burst communications. Increased attention has been drawn to machine type communication (MTC) lately, which represents important extension for user functionality in today's technologies, as well as an important potential for marketing expansion. GERAN studies over MTC has mainly focused on applications requiring low throughput and wide coverage such as smart meter, which could cause some impacts over normal data users if operating in a synchronous manner. This paper proposes a new methodology for studying the impact on signaling channels when mixture of synchronous and asynchronous traffic is present in the network. This is based on statistical analysis, considering signaling accessing attempts as driven by a Poisson process. In this approach successive random access attempts by the mobile stations are considered as well as the response on the network side. First implementation is held for GSM GPRS network, although generalization of the method for other technologies is possible. The simulated results show potential problems to be solved when a large number of synchronized users is present. Additionally, an analysis on the effects of the different levels of synchronization and the addition of extra signaling channels is included. Results also point out possible development paths that could be taken when designing new features to make networks more robust to synchronized traffic. Machine-to-machine communication, a promising technology for the smart city concept, enables ubiquitous connectivity between one or more autonomous devices without or with minimal human interaction. M2M communication is the key technology to support data transfer among sensors and actuators to facilitate various smart city applications (e.g., smart metering, surveillance and security, infrastructure management, city automation, and eHealth). To support massive numbers of machine type communication (MTC) devices, one of the challenging issues is to provide an efficient way for multiple access in the network and to minimize network overload. In this article, we review the M2M communication techniques in Long Term Evolution- Advanced cellular networks and outline the major research issues. Also, we review the different random access overload control mechanisms to avoid congestion caused by random channel access of MTC devices. To this end, we propose a reinforcement learning-based eNB selection algorithm that allows the MTC devices to choose the eNBs (or base stations) to transmit packets in a self-organizing fashion. Supporting massive device transmission is challenging in machine-to-machine (M2M) communications. Particularly, in event-driven M2M communications, a large number of devices become activated within a short period of time, which in turn causes high radio congestions and severe access delay. To address this issue, we propose a Fast Adaptive S-ALOHA (FASA) scheme for random access control of M2M communication systems with bursty traffic. Instead of the observation in a single slot, the statistics of consecutive idle and collision slots are used in FASA to accelerate the tracking process of network status that is critical for optimizing S-ALOHA systems. With a design based on drift analysis, the estimate of the number of the active devices under FASA converges fast to the true value. Furthermore, by examining the T-slot drifts, we prove that the proposed FASA scheme is stable as long as the average arrival rate is smaller than e-1, in the sense that the Markov chain derived from the scheme is geometrically ergodic. Simulation results demonstrate that under highly bursty traffic, the proposed FASA scheme outperforms traditional additive schemes such as PB-ALOHA and achieves near-optimal performance in reducing access delays. Moreover, compared to multiplicative schemes, FASA shows its robustness under heavy traffic load in addition to better delay performance.