Related papers: Tree-Algorithms with Multi-Packet Reception and Su…
In this paper, we analyze binary-tree algorithms in a setup in which the receiver can perform multi-packet reception (MPR) of up to and including K packets simultaneously. The analysis addresses both traffic-independent performance as well…
In this article, we calculate the mean throughput, number of collisions, successes, and idle slots for random tree algorithms with successive interference cancellation. Except for the case of the throughput for the binary tree, all the…
In this paper, we outline the approach for the derivation of the length of the collision resolution interval for d-ary tree algorithms (TA) with gated access and successive interference cancellation (SIC), conditioned on the number of the…
In this study we explore the performance gain that can be achieved at the network level by employing successive interference cancelation (SIC) instead of treating interference as noise for random access wireless mesh networks with…
This paper presents a novel approach to multiple access control called coded splitting tree protocol. The approach builds on the known tree splitting protocols, code structure and successive interference cancellation (SIC). Several…
In this paper, we propose Advanced Tree-algorithm with Interference Cancellation (ATIC), a variant of binary tree-algorithm with successive interference cancellation (SICTA) introduced by Yu and Giannakis. ATIC assumes that Interference…
In next generation Internet-of-Things, the overhead introduced by grant-based multiple access protocols may engulf the access network as a consequence of the unprecedented number of connected devices. Grant-free access protocols are…
This paper proposes an adaptive transmission algorithm for slotted random access systems supporting the successive interference cancellation (SIC) at the access point (AP). When multiple users transmit packets simultaneously in a slot,…
Limitation of the cost of coordination and contention among a large number of nodes calls for grant-free approaches, exploiting physical layer techniques to solve collisions. Successive Interference Cancellation (SIC) is becoming a key…
In this paper, we propose a new optimization-based access strategy of multipacket reception (MPR) channel for multiple secondary users (SUs) accessing the primary user (PU) spectrum opportunistically. We devise an analytical model that…
This paper provides a unified framework to study the performance of successive interference cancellation (SIC) in wireless networks with arbitrary fading distribution and power-law path loss. An analytical characterization of the…
This is a sequel of our previous work [8] on characterization of maximum sum rate of slotted Aloha networks. By extending the analysis to incorporate the capacity-achieving receiver structure, Successive Interference Cancellation (SIC),…
Multi-packet reception (MPR) has been recognized as a powerful capacity-enhancement technique for random-access wireless local area networks (WLANs). As is common with all random access protocols, the wireless channel is often…
At present, operators address the explosive growth of mobile data demand by densification of the cellular network so as to reduce the transmitter-receiver distance and to achieve higher spectral efficiency. Due to such network densification…
In this paper, we analyze a shared access network with a fixed primary node and randomly distributed secondary nodes whose distribution follows a Poisson point process (PPP). The secondaries use a random access protocol allowing them to…
Consider a time slotted communication channel shared by $K$ active users and a single receiver. It is assumed that the receiver has the ability of the multiple-packet reception (MPR) to correctly receive at most $\gamma$ ($1 \leq \gamma <…
There is a paucity of random access protocols designed for alleviating collisions in visible light communication (VLC) systems, where carrier sensing is hard to be achieved due to the directionality of light. To resolve the problem of…
We present a framework for random access that is based on three elements: physical-layer network coding (PLNC), signature codes and tree splitting. In presence of a collision, physical-layer network coding enables the receiver to decode,…
In this paper, a general tree algorithm processing a random flow of arrivals is analyzed. Capetanakis--Tsybakov--Mikhailov's protocol in the context of communication networks with random access is an example of such an algorithm. In…
Network coding is famous for significantly improving the throughput of networks. The successful decoding of the network coded data relies on some side information of the original data. In that framework, independent data flows are usually…