| Full text | |
| Author(s): |
Total Authors: 3
|
| Affiliation: | [1] Univ Estadual Campinas, Inst Comp, BR-13083852 Campinas - Brazil
[2] Univ Manitoba, Dept Elect & Comp Engn, Winnipeg, MB R3T 5V6 - Canada
Total Affiliations: 2
|
| Document type: | Journal article |
| Source: | IEEE WIRELESS COMMUNICATIONS LETTERS; v. 10, n. 9, p. 1852-1856, SEP 2021. |
| Web of Science Citations: | 0 |
| Abstract | |
Code-expanded Random Access (CeRA) is a promising technique for supporting massive machine-type communications in cellular IoT networks. However, its potentiality is limited by code ambiguity, which results from the inference of a larger number of codewords than those actually transmitted. In this letter, we propose a random access (RA) scheme to alleviate this problem by allowing devices to select the preambles to be transmitted considering a q-ary code with maximum average distance. Moreover, a CeRA decoding approach based on hypergraphs is proposed and an analytical model is derived. Numerical results show that the proposed scheme significantly increases the probability of successful channel access as well as resource utilization. (AU) | |
| FAPESP's process: | 19/22065-3 - Collecting information on sensor networks by using cellular networks |
| Grantee: | Carlos Alberto Astudillo Trujillo |
| Support Opportunities: | Scholarships in Brazil - Technical Training Program - Technical Training |
| FAPESP's process: | 15/24494-8 - Communications and processing of big data in cloud and fog computing |
| Grantee: | Nelson Luis Saldanha da Fonseca |
| Support Opportunities: | Research Projects - Thematic Grants |