Exploiting the Capture Effect to Enhance RACH Performance in Cellular-Based M2M Communications

Cellular-based machine-to-machine (M2M) communication is expected to facilitate services for the Internet of Things (IoT). However, because cellular networks are designed for human users, they have some limitations. Random access channel (RACH) congestion caused by massive access from M2M devices is one of the biggest factors hindering cellular-based M2M services because the RACH congestion causes random access (RA) throughput degradation and connection failures to the devices. In this paper, we show the possibility exploiting the capture effects, which have been known to have a positive impact on the wireless network system, on RA procedure for improving the RA performance of M2M devices. For this purpose, we analyze an RA procedure using a capture model. Through this analysis, we examine the effects of capture on RA performance and propose an Msg3 power-ramping (Msg3 PR) scheme to increase the capture probability (thereby increasing the RA success probability) even when severe RACH congestion problem occurs. The proposed analysis models are validated using simulations. The results show that the proposed scheme, with proper parameters, further improves the RA throughput and reduces the connection failure probability, by slightly increasing the energy consumption. Finally, we demonstrate the effects of coexistence with other RA-related schemes through simulation results

Architectures and Key Technical Challenges for 5G Systems Incorporating Satellites

Satellite Communication systems are a promising solution to extend and complement terrestrial networks in unserved or under-served areas. This aspect is reflected by recent commercial and standardisation endeavours. In particular, 3GPP recently initiated a Study Item for New Radio-based, i.e., 5G, Non-Terrestrial Networks aimed at deploying satellite systems either as a stand-alone solution or as an integration to terrestrial networks in mobile broadband and machine-type communication scenarios. However, typical satellite channel impairments, as large path losses, delays, and Doppler shifts, pose severe challenges to the realisation of a satellite-based NR network. In this paper, based on the architecture options currently being discussed in the standardisation fora, we discuss and assess the impact of the satellite channel characteristics on the physical and Medium Access Control layers, both in terms of transmitted waveforms and procedures for enhanced Mobile BroadBand (eMBB) and NarrowBand-Internet of Things (NB-IoT) applications. The proposed analysis shows that the main technical challenges are related to the PHY/MAC procedures, in particular Random Access (RA), Timing Advance (TA), and Hybrid Automatic Repeat reQuest (HARQ) and, depending on the considered service and architecture, different solutions are proposed.Comment: Submitted to Transactions on Vehicular Technologies, April 201

On the Reliability of LTE Random Access: Performance Bounds for Machine-to-Machine Burst Resolution Time

Random Access Channel (RACH) has been identified as one of the major bottlenecks for accommodating massive number of machine-to-machine (M2M) users in LTE networks, especially for the case of burst arrival of connection requests. As a consequence, the burst resolution problem has sparked a large number of works in the area, analyzing and optimizing the average performance of RACH. However, the understanding of what are the probabilistic performance limits of RACH is still missing. To address this limitation, in the paper, we investigate the reliability of RACH with access class barring (ACB). We model RACH as a queuing system, and apply stochastic network calculus to derive probabilistic performance bounds for burst resolution time, i.e., the worst case time it takes to connect a burst of M2M devices to the base station. We illustrate the accuracy of the proposed methodology and its potential applications in performance assessment and system dimensioning.Comment: Presented at IEEE International Conference on Communications (ICC), 201

Goodbye, ALOHA!

©2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.The vision of the Internet of Things (IoT) to interconnect and Internet-connect everyday people, objects, and machines poses new challenges in the design of wireless communication networks. The design of medium access control (MAC) protocols has been traditionally an intense area of research due to their high impact on the overall performance of wireless communications. The majority of research activities in this field deal with different variations of protocols somehow based on ALOHA, either with or without listen before talk, i.e., carrier sensing multiple access. These protocols operate well under low traffic loads and low number of simultaneous devices. However, they suffer from congestion as the traffic load and the number of devices increase. For this reason, unless revisited, the MAC layer can become a bottleneck for the success of the IoT. In this paper, we provide an overview of the existing MAC solutions for the IoT, describing current limitations and envisioned challenges for the near future. Motivated by those, we identify a family of simple algorithms based on distributed queueing (DQ), which can operate for an infinite number of devices generating any traffic load and pattern. A description of the DQ mechanism is provided and most relevant existing studies of DQ applied in different scenarios are described in this paper. In addition, we provide a novel performance evaluation of DQ when applied for the IoT. Finally, a description of the very first demo of DQ for its use in the IoT is also included in this paper.Peer ReviewedPostprint (author's final draft

Performance of LTE network for VoIP users

With the arrival of LTE standard, it is expected that the mobile voice services paradigm will shift from the circuit switched to fully packet switched mode supporting the VoIP services. VoIP services took quite a bit of time before they were accepted as the main stream telephony service in the fixed networks. To provide VoIP services over the LTE networks with appropriate QoS, it is necessary to analyse the performance of such services and optimise the network parameters. This paper analyses the performance of VoIP services on the LTE network using the FD and the SMP packet scheduling techniques. This work identifies and analyses the features of above LTE packet scheduling techniques to enhance the QoS of VoIP services. An OPNET-based simulation model is used to analyse the performance of VoIP services on the LTE network by incorporating G.711 and G.723 speech coders. The work also studied the performance of VoIP services in variable transmission channel conditions

Design and analysis of LTE and wi-fi schemes for communications of massive machine devices

Existing communication technologies are designed with speciÿc use cases in mind, however, ex-tending these use cases usually throw up interesting challenges. For example, extending the use of existing cellular networks to emerging applications such as Internet of Things (IoT) devices throws up the challenge of handling massive number of devices. In this thesis, we are motivated to investigate existing schemes used in LTE and Wi-Fi for supporting massive machine devices and improve on observed performance gaps by designing new ones that outperform the former. This thesis investigates the existing random access protocol in LTE and proposes three schemes to combat massive device access challenge. The ÿrst is a root index reuse and allocation scheme which uses link budget calculations in extracting a safe distance for preamble reuse under vari-able cell size and also proposes an index allocation algorithm. Secondly, a dynamic subframe optimization scheme that combats the challenge from an optimisation solution perspective. Thirdly, the use of small cells for random access. Simulation and numerical analysis shows performance improvements against existing schemes in terms of throughput, access delay and probability of collision. In some cases, over 20% increase in performance was observed. The proposed schemes provide quicker and more guaranteed opportunities for machine devices to communicate. Also, in Wi-Fi networks, adaptation of the transmission rates to the dynamic channel condi-tions is a major challenge. Two algorithms were proposed to combat this. The ÿrst makes use of contextual information to determine the network state and respond appropriately whilst the second samples candidate transmission modes and uses the e˛ective throughput to make a deci-sion. The proposed algorithms were compared to several existing rate adaptation algorithms by simulations and under various system and channel conÿgurations. They show signiÿcant per-formance improvements, in terms of throughput, thus, conÿrming their suitability for dynamic channel conditions