Services Ranking Based Random Access Scheme for Machine-Type Communication
There is a considerable pressure for random access networks to access numerous devices with limited preambles, while the different delay requirements of diverse applications exacerbate this situation. In this paper, we propose a service ranking scheme to ensure that delays of different applications are within a reasonable range. We classify applications by latency requirements and dynamically partition preambles for serving these applications. In particular, distribute queue is used to coordinate delay-critical applications. Delay-tolerant applications are partially prohibited when congestion occurs. The average success delay is minimized under the preambles constraint. Simulation and numerical results show that the proposed scheme can effectively reduce the average success delay by 30% while guaranteeing the success ratio of delay-critical applications.
KeywordsMachine-type communications Random access Massive access requests Service ranked Distributed queuing
This work was supported in part by the Scientific Research Foundation of the Ministry of Education of China-China Mobile under Grant MCM20150102; in part Ministry of Education of China-China Mobile under Grant MCM20150102; in part Ministry of Education of China-China Mobile under Grant MCM20150102; in part and universities in Chongqing, China under Grant CXTDX201601006.
- 1.Huawei.: Technical specification group radio access network; study on RAN improvements for machine-type communications. 3GPP, Technical Report, 37.868 (2011)Google Scholar
- 2.Larmo, A., et al.: The LTE link-layer design. In: LTE Part II: 3GPP Release 8 (2009)Google Scholar
- 3.Pourmoghadas, A., Poonacha, P.G., Khoenihay, N.: Performance analysis of split preamble RAN overload control method for massive access of M2M devices in LTE networks. In: IEEE International Conference on Internet of Things (2017)Google Scholar
- 4.Astudillo, C.A., Andrade, T.P.C.D., Fonseca, N.L.S.D.: Allocation of control resources with preamble priority awareness for human and machine type communications in LTE-advanced networks. In: IEEE International Conference on Communications (2017)Google Scholar
- 5.Pourmoghadas, A., Poonacha, P.G.: Performance analysis of a machine-to-machine friendly MAC algorithm in LTE-advanced. In: International Conference on Advances in Computing, Communications and Informatics (2014)Google Scholar
- 6.Han, S., Jang, et al.: An early preamble collision detection scheme based on tagged preambles for cellular M2M random access. In: IEEE Transactions on Vehicular Technology (2017)Google Scholar
- 7.Kim, T., et al.: An enhanced access reservation protocol with a partial preamble transmission mechanism in NB-IoT systems. In: IEEE Communications Letters (2017)Google Scholar
- 8.Laya, A.: Goodbye, aloha!. In: IEEE Access (2016)Google Scholar
- 9.Changbae, Y.: Distributed queuing with preamble grouping for massive IoT devices in LTE random access. In: International Conference on Information and Communication Technology Convergence (2016)Google Scholar
- 10.Laya, A., Alonso, L., Alonso-Zarate, J.: Efficient contention resolution in highly dense LTE networks for machine type communications. In: IEEE Global Communications Conference (2015)Google Scholar
- 11.Alonso-Zarate, T.R.: Performance Models for LTE-Advanced Random Access. Arizona State University (2014)Google Scholar