{"paper":{"title":"Compressive random access with multiple resource blocks and fast retrial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jinho Choi","submitted_at":"2019-02-26T21:31:42Z","abstract_excerpt":"In this paper, we propose a compressive random access (CRA) scheme using multiple resource blocks (RBs) to support massive connections for machine type communications (MTC). The proposed CRA scheme is scalable. As a result, if the number of devices increases, more RBs can be added to support them. Thanks to multiple RBs, we can employ fast retrial between RBs for re-transmissions of collided packets, which can result in short access delay. For stable CRA with fast retrial, we derive conditions (with a rate control scheme), and analyze the steady state performance to find the throughput and del"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10235","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}