Probabilistic Handshake in All-to-all Broadcast Coded Slotted ALOHA
Mikhail Ivanov, Petar Popovski, Fredrik Brannstrom, Alexandre Graell i, Amat, Cedomir Stefanovic

TL;DR
This paper introduces a probabilistic handshake mechanism for all-to-all broadcast in coded slotted ALOHA networks, enabling users to reliably confirm successful message reception.
Contribution
It presents a novel handshake algorithm for half-duplex networks and provides analytical bounds that match simulation results.
Findings
Handshake algorithm achieves high reliability in simulations.
Analytical bounds closely match simulation performance.
Method effectively enables users to confirm message reception.
Abstract
We propose a probabilistic handshake mechanism for all-to-all broadcast coded slotted ALOHA. We consider a fully connected network where each user acts as both transmitter and receiver in a half-duplex mode. Users attempt to exchange messages with each other and to establish one-to-one handshakes, in the sense that each user decides whether its packet was successfully received by the other users: After performing decoding, each user estimates in which slots the resolved users transmitted their packets and, based on that, decides if these users successfully received its packet. The simulation results show that the proposed handshake algorithm allows the users to reliably perform the handshake. The paper also provides some analytical bounds on the performance of the proposed algorithm which are in good agreement with the simulation results.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · IoT Networks and Protocols · Wireless Communication Networks Research
