Skip to main content

Fast Group Paging Algorithm for Large-Scale MTC Systems

  • Conference paper
  • First Online:
Communications and Networking (ChinaCom 2017)

Abstract

Group paging (GP) is an effective way to solve the serious congestion problem. Congestion problem usually is caused by lots of machine-type communication (MTC) devices communicating at the same time. A certain number of MTC devices in each time slot is been activated, and the number of MTC devices can achieve the maximum of resource utilization. First of all, the total number of MTC devices in each time slot should be calculated according to the different new arrivals in each time slot. By making the resources utilization maximum, the optimal number of total MTC devices can be obtained, from which the optimal number of arriving MTC devices in each time slot will be get. To estimate the total number of MTC devices for traffic scattering GP, a Fast Group Paging Algorithm (FGPA) is proposed, which aims to improve the performance of GP under the condition of massive MTC devices. FGPA is an iterative algorithm that converges fast and has low arithmetic complexity. The corresponding simulation results demonstrate that the proposed FGPA requires less number of iterations under the condition of the same estimation results of total number of MTC devices compared with the existing iterative algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ali, A., Hamouda, W.: Cell search evaluation: a step towards the next generation LTE-MTC systems. In: 2016 IEEE Wireless Communications and Networking Conference (WCNC), pp. 1–6. IEEE (2016)

    Google Scholar 

  2. Ali, M.S., Hossain, E., Kim, D.I.: LTE/LTE-a random access for massive machine-type communications in smart cities. arXiv preprint arXiv:1608.03042 (2016)

  3. Chang, C.W., Lin, Y.H., Ren, Y., et al.: Congestion control for machine-type communications in LTE-a networks. In: 2016 IEEE Global Communications Conference (GLOBECOM), pp. 1–6. IEEE (2016)

    Google Scholar 

  4. Cheng, M.Y., Lin, G.Y., Wei, H.Y., et al.: Overload control for machine-type-communications in LTE-advanced system. IEEE Commun. Mag. 50(6), 38–45 (2012). 34(5), pp. 1086–1102

    Article  Google Scholar 

  5. Chang, C.T., Yang, S.R.: Modeling LTE group paging mechanism for machine-type communications. In: 2015 International Wireless Communications and Mobile Computing Conference (IWCMC), pp. 1295–1300. IEEE (2015)

    Google Scholar 

  6. Arouk, O., Ksentini, A., Taleb, T.: Group paging optimization for machine-type-communications. In: 2015 IEEE International Conference on Communications (ICC), pp. 6500–6505. IEEE (2015)

    Google Scholar 

  7. 3GPP R2–104870. Pull Based RAN overload control, August 2010

    Google Scholar 

  8. Hasan, M., Hossain, E., Niyato, D.: Random access for machine-to-machine communication in LTE-advanced networks: issues and approaches. IEEE Commun. Mag. 51(6), 86–93 (2013)

    Article  Google Scholar 

  9. Arouk, O., Ksentini, A., Taleb, T.: Group paging-based energy saving for massive MTC accesses in LTE and beyond networks. IEEE J. Sel. Areas Commun. 34, 1086–1102 (2016)

    Article  Google Scholar 

  10. Wei, C.H., Cheng, R.G., Tsao, S.L.: Performance analysis of group paging for machine-type communications in LTE networks. IEEE Trans. Veh. Technol. 62(7), 3371–3382 (2013)

    Article  Google Scholar 

Download references

Acknowledgment

This work was supported by the State Major Science and Technique Project (MJ-2014-S-37), National Natural Science Foundation of China (61201134) and 111 Project (B08038).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiaohui Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Huang, S., Li, X., Zhou, B., Zhao, Y., Yuan, R. (2018). Fast Group Paging Algorithm for Large-Scale MTC Systems. In: Li, B., Shu, L., Zeng, D. (eds) Communications and Networking. ChinaCom 2017. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 237. Springer, Cham. https://doi.org/10.1007/978-3-319-78139-6_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-78139-6_36

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-78138-9

  • Online ISBN: 978-3-319-78139-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics