Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1606.01941

Intra-Slot Interference Cancellation for Collision Resolution in Irregular Repetition Slotted ALOHA

G. Interdonato·S. Pfletschinger·F. Vazquez-Gallego·J. Alonso-Zarate·G. Araniti
View original source ↗Read source document ↗Export metadata ↓

Abstract

ALOHA-type protocols became a popular solution for distributed and uncoordinated multiple random access in wireless networks. However, such distributed operation of the Medium Access Control (MAC) layer leads to sub-optimal utilization of the shared channel. One of the reasons is the occurrence of collisions when more than one packet is transmitted at the same time. These packets cannot be decoded and retransmissions are necessary. However, it has been recently shown that it is possible to apply signal processing techniques with these collided packets so that useful information can be decoded. This was recently proposed in the Irregular Repetition Slotted ALOHA (IRSA), achieving a throughput $T \simeq 0.97$ for very large MAC frame lengths as long as the number of active users is smaller than the number of slots per frame. In this paper, we extend the operation of IRSA with i) an iterative physical layer decoding processing that exploits the capture effect and ii) a Successive Interference Cancellation (SIC) processing at the slot-level, named intra-slot SIC, to decode more than one colliding packet per slot. We evaluate the performance of the proposed scheme, referred to as Extended IRSA (E-IRSA), in terms of throughput and channel capacity. Computer-based simulation results show that E-IRSA protocol allows to reach the maximum theoretical achievable throughput even in scenarios where the number of active users is higher than the number of slots per frame. Results also show that E-IRSA protocol significantly improves the performance even for small MAC frame lengths used in practical scenarios.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

G. Interdonato, S. Pfletschinger, F. Vazquez-Gallego, J. Alonso-Zarate, G. Araniti. 2016-06-06. Intra-Slot Interference Cancellation for Collision Resolution in Irregular Repetition Slotted ALOHA. https://doi.org/10.1109/iccw.2015.7247486

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Bistatic Target Detection by Exploiting Both Deterministic Pilots and Unknown Random Data Payloads

Integrated sensing and communication (ISAC) plays a crucial role in 6G, to enable innovative applications such as drone surveillance, urban air mobility, and low-altitude logistics. However, the hybrid ISAC signal, which comprises deterministic pilot and random data payload components, poses challenges for target detection due to two reasons: 1) these two components cause coupled shifts in both the mean and variance of the received signal, and 2) the random data payloads are typically unknown to the sensing receiver in the bistatic setting. Unfortunately, these challenges could not be tackled by existing target detection algorithms. In this paper, a generalized likelihood ratio test (GLRT)-based detector is derived, by leveraging the known deterministic pilots and the statistical characteristics of the unknown random data payloads. Due to the analytical intractability of exact performance characterization, we perform an asymptotic analysis for the false alarm probability and detection probability of the proposed detector. The results highlight a critical trade-off: both deterministic and random components improve detection reliability, but the latter also brings statistical uncertainty that hinders detection performance. Simulations validate the theoretical findings and demonstrate the effectiveness of the proposed detector, which highlights the necessity of designing a dedicated detector to fully exploited the signaling resources assigned to random data payloads.

cs.IT↗
arXiv2026

On Unbiased Parameter Estimation and Signal Reconstruction

In this paper, we extend the theory of depth-unbiased source localization to unbiased parameter estimation and signal reconstruction for an arbitrary number of non-zero parameters. The topic touches on exact reconstructibility, most commonly studied in compressed sensing and multisource estimation across various imaging problems. The theoretical results derive upper bounds on the number of recoverable parameters in the noiseless case, and define a probability measure to assess the likelihood of recovering all non-zero parameters with correct magnitude order. The work provides a mathematical explanation of the open question regarding the noise robustness of standardized and unbiased methods. The paper also reveals a trade-off between the number of sensors and the signal-to-noise ratio. Numerical experiments demonstrate the theoretical findings.

cs.IT↗
arXiv2026

Minimum enclosing Bregman balls made easy

In this work, we revisit the problem of computing minimum enclosing Bregman balls (Bregman MEBs) of finite sets of parameters. First, we show that Bregman MEBs are equivalent to MEBs of corresponding weighted point sets with respect to the power distance. We then report an efficient Frank--Wolfe $(1+ε)$-approximation algorithm for computing power MEBs, for any $ε>0$. This power MEB approximation algorithm coincides with the Bregman MEB approximation algorithm of Nock and Nielsen (2005) when expressed in the dual gradient space. Finally, we show that the Bregman potential lifting transforms used to construct Bregman Voronoi diagrams can be reinterpreted as the classical paraboloid lifting transform applied to corresponding weighted point sets. In particular, Bregman MEB circumcenters lie on the farthest Bregman Voronoi diagrams or equivalently on the corresponding farthest power diagrams.

cs.IT↗