Dynamic Tree-Splitting Algorithm for Massive Random Access of M2M Communications in IoT Networks

2021 ◽  
pp. 1-12
Author(s):  
Huda Althumali ◽  
Mohamed Othman ◽  
Nor Kamariah Noordin ◽  
Zurina Mohd Hanapi
2014 ◽  
Vol 18 (6) ◽  
pp. 961-964 ◽  
Author(s):  
Han Seung Jang ◽  
Su Min Kim ◽  
Kab Seok Ko ◽  
Jiyoung Cha ◽  
Dan Keun Sung

Author(s):  
Stavroula Vassaki ◽  
George Pitsiladis ◽  
Stavros E. Sagkriotis ◽  
Athanasios D. Panagopoulos

Machine type communications (or Machine-to-Machine / M2M) communications have emerged as an important paradigm in wireless communication networks. The current M2M standardization activities are presented and their implementation in 4G/LTE networks is described in detail. The chapter is divided in three parts that are related to the evolution of the Future M2M communication Networks. The first part focuses on existing random access management schemes for M2M communications that are presented in the literature. The second part is devoted on spectrum sharing methods and on M2M clustering and it presents the spatial distribution of heterogeneous networks and its impact on their connectivity. Finally, the last part refers to energy efficiency issues of the future M2M communication systems and their implementation using distributed power control and MAC/scheduling algorithms.


2020 ◽  
Vol 69 (10) ◽  
pp. 11828-11840
Author(s):  
Changwei Zhang ◽  
Xinghua Sun ◽  
Jun Zhang ◽  
Xianbin Wang ◽  
Shi Jin ◽  
...  

2021 ◽  
pp. 1-20
Author(s):  
Huda Althumali ◽  
Mohamed Othman ◽  
Nor Kamariah Noordin ◽  
Zurina Mohd Hanapi

Machine-to-machine (M2M) communications on Long-term evolution (LTE) networks form a substantial part for the Internet-of-things (IoT). The random access procedure is the first step for M2M devices to access network resources. Many researchers have attempted to improve the efficiency of the random access procedure. This work revisits the performance of the hybrid random access protocols which combine congestion control techniques with collision resolution techniques. In particular, we investigate two hybrid protocols. The first one combines the pre-backoff (PBO) with tree random access (TRA), and the second one combines dynamic access barring (DAB) with TRA. The probability analysis is presented for both protocols. The performance is evaluated based on the access success rate, the mean throughput, the mean delay, the collision rate and the mean retransmissions. The simulation results show that the hybrid protocols achieve the highest success rate and throughput with moderate delay and low collision rates with a lower mean number of retransmissions compared to three benchmarks that apply either a congestion control or a collision resolution. The opportunities of future developments of hybrid protocols are listed at the end of this paper to highlight the issues that could be investigated to improve the performance of hybrid random access protocols.


2017 ◽  
Vol 65 (7) ◽  
pp. 2889-2903 ◽  
Author(s):  
Rana Abbas ◽  
Mahyar Shirvanimoghaddam ◽  
Yonghui Li ◽  
Branka Vucetic

Sign in / Sign up

Export Citation Format

Share Document