2015
DOI: 10.1109/twc.2015.2460254
|View full text |Cite
|
Sign up to set email alerts
|

Probabilistic Rateless Multiple Access for Machine-to-Machine Communication

Abstract: Future machine to machine (M2M) communications need to support a massive number of devices communicating with each other with little or no human intervention. Random access techniques were originally proposed to enable M2M multiple access, but suffer from severe congestion and access delay in an M2M system with a large number of devices. In this paper, we propose a novel multiple access scheme for M2M communications based on the capacity-approaching analog fountain code to efficiently minimize the access delay… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
36
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
4
4

Relationship

3
5

Authors

Journals

citations
Cited by 57 publications
(36 citation statements)
references
References 33 publications
(62 reference statements)
0
36
0
Order By: Relevance
“…As the average number of transmissions is related to the energy expenditure, we say that the ACK-All scheme is more energy efficient in this case. Nevertheless, we can see that the average number of transmissions for both RMA schemes is quite comparable to the number of transmissions allowed in cellular access networks over the RACH [6] which further supports RMA as a good candidate for future M2M communication networks.…”
Section: Special Case Of R =mentioning
confidence: 52%
See 1 more Smart Citation
“…As the average number of transmissions is related to the energy expenditure, we say that the ACK-All scheme is more energy efficient in this case. Nevertheless, we can see that the average number of transmissions for both RMA schemes is quite comparable to the number of transmissions allowed in cellular access networks over the RACH [6] which further supports RMA as a good candidate for future M2M communication networks.…”
Section: Special Case Of R =mentioning
confidence: 52%
“…An extension of this work can be found in [5] where this assumption is dropped and a generalized access management scheme was proposed with an adaptive resource allocation scheme based on the incoming traffic. In [6], devices with the same QoS requirement are scheduled to transmit over the same resources simultaneously. Using well-designed codes, the superposed codewords can be reliably decoded at the base station (BS) allowing for a more efficient use of resources and reduction in the number of retransmissions at the RACH.…”
Section: A Related Workmentioning
confidence: 99%
“…17) Non-Aloha-based random access: The limited number of RA preambles is the main bottleneck of slotted-Alohabased RA for massive MTC in LTE networks. Recently, the authors in [15] proposed a RA model based on the capacityapproaching Analog Fountain Code (AFC). AFC-based RA combines multiple access with resource allocation.…”
Section: Non-3gpp Random Access Solutionsmentioning
confidence: 99%
“…In this article, we provide a review of these proposals to solve the congestion problem during random access in terms of five aforementioned performance metrics. Some of the proposals are also discussed in [5]- [15]. Nonetheless, most of the solutions are based on the collision avoidance technique, which simply restrict the arrival rate of access attempts.…”
Section: Introductionmentioning
confidence: 99%
“…These include, sporadic transmission of small data bursts (only few kbs), massive number of devices, and low power consumption to extend battery life. Moreover, M2M devices and applications have diverse quality-of-service (QoS) requirements and traffic patterns [9]. For these reasons, leading standardization bodies, such as 3GPP, have commenced work on satisfying these and other constraints while not sacrificing current cellular system usage for human-based applications [10].…”
Section: Introductionmentioning
confidence: 99%