Abstraction of random access procedure for bursty MTC traffic in 5G networks

  • Agiwal, Mamta; 
  • Qu, Miao; 
  • Jin, Hu
Citations

SCOPUS

3

초록

The evolution towards 5G network emphasizes on massive machine type communication (mMTC) as an important work direction. Massive connectivity in Machine-Type Communications (MTC) poses huge challenge for the efficient management of random access mechanism, originally designed and optimized for limited number of broadband connections in legacy networks. When large number of MTC devices, with bursty traffic characteristics, randomly attempt to access the network, the probability of collision preambles drastically increases. Thus, with increased scalability of MTC devices the performance of LTE/LTE-A random access mechanism degrades sharply. Our proposed analysis provides optimal access class barring to maximize the number of average access success preambles. We also evaluate the upper bound performance to estimate the average access delay. The proposed optimal random access procedure facilitates for abstractions in simulations to better serve efficient network design that supports scalability of new MTC devices. © 2018 IEEE.

키워드

Abstracting; Mobile telecommunication systems; Queueing networks; Scalability; Broadband connection; Bursty traffic; Efficient managements; Legacy networks; Machine type communications; Machinetype communication (MTC); Network design; Random access; 5G mobile communication systems
제목
Abstraction of random access procedure for bursty MTC traffic in 5G networks
저자
Agiwal, Mamta; Qu, Miao; Jin, Hu
DOI
10.1109/APCC.2018.8633570
발행일
2019-11
유형
Conference Paper
저널명
2018 24th Asia-Pacific Conference on Communications, APCC 2018
페이지
280 ~ 285