Skip to main content

Call Admission Control Satisfying Delay Constraint for Machine-to-Machine Communications in LTE-Advanced

  • Conference paper
Computer Applications for Communication, Networking, and Digital Contents (FGCN 2012)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 350))

Abstract

Complex and large systems such as smart grid and intelligent transportation systems consist of a large number of sensors, actuators and controllers. Hence machine–to–machine (M2M) communications between them are essential for full automatic control of the systems. The M2M communications is typical in the sense that it involves an enormous number of machine–type–communication (MTC) devices and data traffic patterns as well as QoS requirements vary widely depending on applications. LTE–Advanced of 3GPP is preparing a list of supportive functions for the M2M communications. To this end, a massive admission control scheme for the M2M communications was proposed. However, it poorly handles the call admission requests when the transmission interval of a device is relatively longer than its delay constraint, resulting in higher call blocking probability. This paper proposes a method that is free from such limitation and furthermore can reduce the computational overhead required for determining the call admission as long as the transmission interval and the delay meet certain conditions. The improvement in the call blocking probability and the proofs that the proposed method can satisfy the delay constraint were provided along with the simulation results.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gellings, C.: The Smart Grid: Enabling Energy Efficiency and Demand Response. CRC Press

    Google Scholar 

  2. Chowdhury, M., Sadek, A.: Fundamentals of Intelligent Transportation Ssytems Planning. Artech House

    Google Scholar 

  3. http://www.3gpp.org

  4. 3GPP TS 22.368 V11.1.0: Service Requirements for Machine Type Communications (March 2011)

    Google Scholar 

  5. 3GPP TS 23.888 V1.1.1: System Improvements for Machine Type Communications (April 2011)

    Google Scholar 

  6. Lien, S., Chen, K.: Massive Access Management for QoS Guarantees in 3GPP Machine–to–Machine Communications. IEEE Comm. Letters 15(3) (March 2011)

    Google Scholar 

  7. Lien, S., Chen, K., Lin, Y.: Toward Ubiquitous Massive Accesses in 3GPP Machine to Machine Communications. IEEE Comm. Mag. (April 2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jun, K. (2012). Call Admission Control Satisfying Delay Constraint for Machine-to-Machine Communications in LTE-Advanced. In: Kim, Th., Ko, Ds., Vasilakos, T., Stoica, A., Abawajy, J. (eds) Computer Applications for Communication, Networking, and Digital Contents. FGCN 2012. Communications in Computer and Information Science, vol 350. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35594-3_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35594-3_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35593-6

  • Online ISBN: 978-3-642-35594-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics