Pith. sign in

REVIEW

Grouping-Based Random Access Collision Control for Massive Machine-Type Communication

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 1704.07857 v2 pith:7G5B5NDL submitted 2017-04-25 cs.NI

Grouping-Based Random Access Collision Control for Massive Machine-Type Communication

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

Massive Machine-Type Communication (mMTC) is expected to be strongly supported by future 5G wireless networks. Its deployment, however, is seriously challenged by the high risk of random access (RA) collision. A popular concept is to reduce RA collisions by clustering mMTC devices into groups, and to connect group members with device-to-device (D2D) links. However, analytical models of this method and discussions about the reliability of D2D links are still absent. In this paper, existing grouping-based solutions are reviewed, an analytical model of grouped RA collision is proposed. Based on the analytical model, the impact of D2D reliability on the collision rate is also investigated. Afterwards, an efficient grouped RA procedure is designed to extend the state-of-the-art with an efficient local group update mechanism against D2D link exceptions.

discussion (0)

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