Asymptotic Analysis of Contention Resolution ALOHA with Replica Concatenation

Akyildiz, Talha; Demirhan, Umut; Duman, Tolga M.

doi:10.1109/icc.2019.8761520

Cited by 4 publications

(3 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is of outermost importance in many M2M scenarios, where devices are powered via batteries that cannot (or may not) be replaced for their entire lifetime. Some recent solutions derived from the asynchronous ALOHA protocol have shown to be competitive in comparison with their slot-synchronous counterpart [25], [26], [27], [28]. These solutions also adopt the transmission of multiple copies of the packets and SIC at the receiver.…”

Section: Introductionmentioning

confidence: 99%

Protograph LDPC Code Design for Asynchronous Random Access

et al. 2019

View full text Add to dashboard Cite

This work addresses the physical layer channel code design for an uncoordinated, frame-and slot-asynchronous random access protocol. Starting from the observation that collisions between two users yield very specific interference patterns, we define a surrogate channel model and propose different protograph low-density parity-check code designs. The proposed codes are both tested in a setup where the physical layer is abstracted, as well as on a more realistic channel model, where finite-length physical layer simulations of the entire asynchronous random access scheme, including decoding are carried out. We find that the abstracted physical layer model overestimates the performance when short blocks are considered. Additionally, the optimized codes show gains in supported channel traffic -a measure of the number of terminals that can be concurrently accommodated on the channel -of around 17% at a packet loss rate of 10 −2 w.r.t. off-the-shelf codes.F. Clazzer and B. Matuz are with the Inst.

show abstract

Section: Introductionmentioning

confidence: 99%

Protograph LDPC Code Design for Asynchronous Random Access

et al. 2019

View full text Add to dashboard Cite

show abstract

“…We summarize the related works on ALOHA based RA schemes along with their main features in Table I. 1 Although there are numerous works for asynchronous diversity ALOHA schemes, to the best of our knowledge, there is no study providing an asymptotic analysis for advanced asynchronous RA schemes in the literature. With this motivation, we present the design and analysis of asynchronous advanced RA protocols with various considerations.…”

mentioning

confidence: 99%

“…The virtual frame concept is first presented in[25]. Neither in CRA[23] nor in the previous statement of IRA[1] VFs have been considered 4. Throughout the paper, we will refer to a user and a packet interchangeably.…”

mentioning

confidence: 99%

Energy Harvesting Irregular Repetition ALOHA With Replica Concatenation

Akyildiz

Demirhan

Duman

2021

IEEE Trans. Wireless Commun.

Self Cite

View full text Add to dashboard Cite

In this paper, we consider an asynchronous random access scheme called irregular repetition ALOHA (IRA) as a generalization of contention resolution ALOHA (CRA) with varying repetitions. We present an asymptotic performance analysis of CRA and IRA on the collision channel for regular and irregular repetition rates. We also propose an improvement by merging the clean parts of packet replicas in partial collisions, and extend our analysis to this scenario as well. Specific designs of repetition distributions based on the new analysis show that the optimized solutions of irregular repetition slotted ALOHA (IRSA) perform well in both IRA and the enhanced scheme, and they considerably outperform the regular repetition distributions. We also introduce energy harvesting (EH) to both schemes as a practical and sustainable adaptation, where users are able to harvest energy and store it in their finite-capacity batteries. We model the battery state by a discrete-time Markov chain and derive an optimal transmission policy to maximize the asymptotic performance of the system. We provide comprehensive numerical results for both practical and asymptotic scenarios to verify the validity of the proposed analyses, and illustrate the benefits of the proposed systems.

show abstract

Irregular Repetition ALOHA with Packet Length Diversity

Akyildiz

Duman

2019

2019 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

Asymptotic Analysis of Contention Resolution ALOHA with Replica Concatenation

Cited by 4 publications

References 17 publications

Protograph LDPC Code Design for Asynchronous Random Access

Protograph LDPC Code Design for Asynchronous Random Access

Energy Harvesting Irregular Repetition ALOHA With Replica Concatenation

Irregular Repetition ALOHA with Packet Length Diversity

Contact Info

Product

Resources

About