Next Article in Journal
Single-Photon Avalanche Diode with Enhanced NIR-Sensitivity for Automotive LIDAR Systems
Next Article in Special Issue
Evaluation of Smartphone Inertial Sensor Performance for Cross-Platform Mobile Applications
Previous Article in Journal
Optical Riblet Sensor: Beam Parameter Requirements for the Probing Laser Source
Previous Article in Special Issue
Geometry-Based Distributed Spatial Skyline Queries in Wireless Sensor Networks
Article Menu

Export Article

Open AccessArticle
Sensors 2016, 16(4), 455; doi:10.3390/s16040455

Dynamic RACH Partition for Massive Access of Differentiated M2M Services

1
Department of Information and Communications Engineering, School of Electronic and Information Engineering, Xi’an Jiaotong University, Xi’an 710049, China
2
Shaanxi Smart Networks and Ubiquitous Access Research Center, Xi’an 710049, China
3
Department of Electrical Engineering and Computer Science, the University of Kansas, Lawrence, KS 66045, USA
*
Author to whom correspondence should be addressed.
Academic Editors: Yunchuan Sun, Antonio Jara and Shengling Wang
Received: 31 December 2015 / Revised: 8 March 2016 / Accepted: 17 March 2016 / Published: 30 March 2016
(This article belongs to the Special Issue Identification, Information & Knowledge in the Internet of Things)
View Full-Text   |   Download PDF [550 KB, uploaded 30 March 2016]   |  

Abstract

In machine-to-machine (M2M) networks, a key challenge is to overcome the overload problem caused by random access requests from massive machine-type communication (MTC) devices. When differentiated services coexist, such as delay-sensitive and delay-tolerant services, the problem becomes more complicated and challenging. This is because delay-sensitive services often use more aggressive policies, and thus, delay-tolerant services get much fewer chances to access the network. To conquer the problem, we propose an efficient mechanism for massive access control over differentiated M2M services, including delay-sensitive and delay-tolerant services. Specifically, based on the traffic loads of the two types of services, the proposed scheme dynamically partitions and allocates the random access channel (RACH) resource to each type of services. The RACH partition strategy is thoroughly optimized to increase the access performances of M2M networks. Analyses and simulation demonstrate the effectiveness of our design. The proposed scheme can outperform the baseline access class barring (ACB) scheme, which ignores service types in access control, in terms of access success probability and the average access delay. View Full-Text
Keywords: M2M communications; overload control; preamble partition; access success probability; average access delay M2M communications; overload control; preamble partition; access success probability; average access delay
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Du, Q.; Li, W.; Liu, L.; Ren, P.; Wang, Y.; Sun, L. Dynamic RACH Partition for Massive Access of Differentiated M2M Services. Sensors 2016, 16, 455.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top