Browsing by Subject "Successive interference cancellation"

Now showing 1 - 4 of 4

Open Access
Advanced asynchronous random access protocols
(2020-08) Akyıldız, Talha
Fifth generation wireless systems and beyond require linking an enormous number of simple machine type devices leading to a new wave of interest in massive machine type communications (mMTC). Diﬀerent from the human-centric communication systems, mMTCs are composed of a large number of devices where each user node generates small data blocks sporadically in an unpredictable manner. In such scenarios, traditional multiple access schemes, e.g., time division multiple access or frequency division multiple access, are not suitable because resource allocation and scheduling based approaches cannot be conveniently adopted due to the required complexity and latency, motivating the use of uncoordinated random access (RA) protocols and making asynchronous ALOHA-like solutions ideal candidates for such applications. In this thesis, we consider the design and analysis of advanced asynchronous RA protocols for diﬀerent settings. We ﬁrst study contention resolution ALOHA (CRA) and irregular repetition ALOHA (IRA) protocols with regular and irregular repetition rates on the collision channel where collisions are resolved through successive interference cancellation. We also propose concatenation of packet replicas with some clean parts with IRA, named irregular repetition ALOHA with replica concatenation (IRARC). Secondly, we introduce energy harvesting (EH) into the framework with the motivation of self-sustainability, and study RA protocols with EH nodes. Finally, we propose a generalization of IRA with packet length diversity to improve the system performance further. We present asymptotic analyses of all the proposed RA protocols, and determine the optimal repetition distributions to maximize the system throughput. We also provide a comprehensive set of numerical results for both asymptotic and practical scenarios to further demonstrate the eﬀectiveness of the proposed approaches.
Open Access
Asymptotic analysis of contention resolution ALOHA with replica concatenation
(Institute of Electrical and Electronics Engineers Inc., 2019) Akyıldız, Talha; Demirhan, U.; Duman, Tolga M.
In this paper, we present an asymptotic performance analysis of contention resolution ALOHA (CRA) on the collision channel for both regular and irregular repetition rates. In addition, we consider an improvement to CRA by merging the clean parts of replicas in partial collisions and extend our analysis to this scenario. Specific designs of repetition distributions based on the new analysis show that the optimized solutions for irregular repetition slotted ALOHA (IRSA) perform well in both CRA and the enhanced scheme.
Open Access
Energy harvesting irregular repetition ALOHA with replica concatenation
(IEEE, 2021) Akyıldız, Talha; Demirhan, U.; Duman, Tolga M.
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.
Open Access
Irregular repetition slotted ALOHA with energy harvesting nodes
(IEEE, 2019-09) Demirhan, Umut; Duman, Tolga M.
We propose an irregular repetition slotted ALOHA (IRSA) based uncoordinated random access scheme for energy harvesting (EH) nodes. Specifically, we consider the case in which each user has a battery that is recharged with harvested energy from the environment in a probabilistic manner. We analyze this scheme starting with a unit-sized battery at the nodes and extend the analysis to the case of a finite-sized battery. For both scenarios, we derive the asymptotic throughput expressions and obtain the optimized probability distributions for the number of packet replicas of the users. We demonstrate that for the case of IRSA with EH nodes, these optimized distributions perform considerably better than the alternatives, including slotted ALOHA (SA), contention resolution diversity slotted ALOHA (CRDSA), and IRSA, which do not take into account the EH process for both asymptotic and finite frame length scenarios.