Pith. sign in

REVIEW

Optimal Resource Dedication in Grouped Random Access for Massive Machine-Type Communications

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1707.09811 v1 pith:3GFM6BRW submitted 2017-07-31 cs.NI

Optimal Resource Dedication in Grouped Random Access for Massive Machine-Type Communications

classification cs.NI
keywords accessrandomresourcegroupedapproachesbarringclasscommunications
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The high risk of random access collisions leads to huge challenge for the deployment massive Machine-Type Communications (mMTC), which cannot be sufficiently overcome by current solutions in LTE/LTE-A networks such as the extended access barring (EAB) scheme. The recently studied approaches of grouped random access have shown a great potential in simultaneously reducing the collision rate and the power consumption in mMTC applications, and exhibit a good compatibility with the concept of random access resource separation. In this work, we propose an optimized resource dedication strategy for grouped random access approaches, which inherits the advantage of resource separation to isolate device classes from each other, while providing an optional class preference with high flexibility and accuracy, which has been usually implemented with access class barring.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.