Show simple item record

dc.contributor.authorDu, Qinghe
dc.contributor.authorLi, Wanyu
dc.contributor.authorLiu, Lingjia
dc.contributor.authorRen, Pinyi
dc.contributor.authorWang, Yichen
dc.contributor.authorSun, Li
dc.date.accessioned2016-06-03T14:17:08Z
dc.date.available2016-06-03T14:17:08Z
dc.date.issued2016-03-30
dc.identifier.citationDu, 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.en_US
dc.identifier.urihttp://hdl.handle.net/1808/20899
dc.description.abstractIn 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.en_US
dc.publisherMultidisciplinary Digital Publishing Instituteen_US
dc.rightsThis is an open access article distributed under the Creative Commons Attribution License (CC BY) which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.en_US
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/
dc.subjectM2M communicationsen_US
dc.subjectOverload controlen_US
dc.subjectPreamble partitionen_US
dc.subjectAccess success probabilityen_US
dc.subjectAverage access delayen_US
dc.titleDynamic RACH Partition for Massive Access of Differentiated M2M Servicesen_US
dc.typeArticleen_US
kusw.kuauthorLiu, Lingjia
kusw.kudepartmentElectrical Engineering and Computer Scienceen_US
dc.identifier.doi10.3390/s16040455en_US
kusw.oaversionScholarly/refereed, publisher versionen_US
kusw.oapolicyThis item meets KU Open Access policy criteria.en_US
dc.rights.accessrightsopenAccess


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

This is an open access article distributed under the Creative Commons Attribution License (CC BY) which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Except where otherwise noted, this item's license is described as: This is an open access article distributed under the Creative Commons Attribution License (CC BY) which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.