Broadcast coded slotted ALOHA: A finite frame length analysis
Artikel i vetenskaplig tidskrift, 2017

We propose an uncoordinated medium access con- trol (MAC) protocol, called all-to-all broadcast coded slotted ALOHA (B-CSA) for reliable all-to-all broadcast with strict latency constraints. In B-CSA, each user acts as both transmitter and receiver in a half-duplex mode. The half-duplex mode gives rise to a double unequal error protection (DUEP) phenomenon: the more a user repeats its packet, the higher the probability that this packet is decoded by other users, but the lower the probability for this user to decode packets from others. We analyze the performance of B-CSA over the packet erasure channel for a finite frame length. In particular, we provide a general analysis of stopping sets for B-CSA and derive an analytical approximation of the performance in the error floor (EF) region, which captures the DUEP feature of B-CSA. Simulation results reveal that the proposed approximation predicts very well the performance of B-CSA in the EF region. Finally, we consider the application of B- CSA to vehicular communications and compare its performance with that of carrier sense multiple access (CSMA), the current MAC protocol in vehicular networks. The results show that B- CSA is able to support a much larger number of users than CSMA with the same reliability.

finite length analysis

packet loss rate

interference cancelation

error floor

random access

All-to-all broadcast

coded slotted ALOHA


Mikhail Ivanov

Chalmers, Signaler och system, Kommunikation, Antenner och Optiska Nätverk

Fredrik Brännström

Chalmers, Signaler och system, Kommunikation, Antenner och Optiska Nätverk

Alexandre Graell i Amat

Chalmers, Signaler och system, Kommunikation, Antenner och Optiska Nätverk

Petar Popovski

Aalborg Universitet

IEEE Transactions on Communications

0090-6778 (ISSN) 15580857 (eISSN)

Vol. 65 2 651-662 7736044


Europeiska kommissionen (EU) (EC/FP7/258418), 2011-05-01 -- 2016-04-30.

Analys och Design av MIMO-BICM

Vetenskapsrådet (VR) (2011-5950), 2012-01-01 -- 2015-12-31.

Komprimerad avkänning med hjälp av kodningsteori

Vetenskapsrådet (VR) (2011-5961), 2012-01-01 -- 2015-12-31.


Informations- och kommunikationsteknik







Mer information

Senast uppdaterat