Please use this identifier to cite or link to this item: http://dlib.scu.ac.ir/handle/Hannan/532840
Title: Broadcast Coded Slotted ALOHA: A Finite Frame Length Analysis
Authors: Mikhail Ivanov;Fredrik Br&x00E4;nnstr&x00F6;m;Alexandre Graell i Amat;Petar Popovski
Year: 2017
Publisher: IEEE
Abstract: We propose an uncoordinated medium access control (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.
URI: http://dl.kums.ac.ir/handle/Hannan/532840
volume: 65
issue: 2
More Information: 651,
662
Appears in Collections:2017

Files in This Item:
File Description SizeFormat 
7736044.pdf1.71 MBAdobe PDFThumbnail
Preview File
Title: Broadcast Coded Slotted ALOHA: A Finite Frame Length Analysis
Authors: Mikhail Ivanov;Fredrik Br&x00E4;nnstr&x00F6;m;Alexandre Graell i Amat;Petar Popovski
Year: 2017
Publisher: IEEE
Abstract: We propose an uncoordinated medium access control (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.
URI: http://dl.kums.ac.ir/handle/Hannan/532840
volume: 65
issue: 2
More Information: 651,
662
Appears in Collections:2017

Files in This Item:
File Description SizeFormat 
7736044.pdf1.71 MBAdobe PDFThumbnail
Preview File
Title: Broadcast Coded Slotted ALOHA: A Finite Frame Length Analysis
Authors: Mikhail Ivanov;Fredrik Br&x00E4;nnstr&x00F6;m;Alexandre Graell i Amat;Petar Popovski
Year: 2017
Publisher: IEEE
Abstract: We propose an uncoordinated medium access control (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.
URI: http://dl.kums.ac.ir/handle/Hannan/532840
volume: 65
issue: 2
More Information: 651,
662
Appears in Collections:2017

Files in This Item:
File Description SizeFormat 
7736044.pdf1.71 MBAdobe PDFThumbnail
Preview File