Work

Adaptive Policy Tree Algorithm to Approach Collision-Free Transmissions in Slotted ALOHA

Year: 2020
Type: conference-paper
Abstract: A new adaptive transmission protocol is introduced to improve the performance of slotted ALOHA. Nodes use known periodic schedules as base policies with which they collaboratively learn how to transmit periodically in different time slots so that packet collisions are minimized. The Adaptive Policy Tree (APT) algorithm is introduced for this purpose, which results in APT-ALOHA. APT-ALOHA does not require the presence of a central repeater and uses explicit acknowledgements to confirm the reception of packets. It is shown that nodes using APT-ALOHA quickly converge to transmission schedules that are virtually collision-free, and that the throughput of APT-ALOHA resembles that of TDMA, where slots are pre-allocated to nodes. In particular, APT-ALOHA attains a successful utilization of time slots- over 70% on saturation mode.
Language: English
Open Access status: green
OpenAlex ID: W3102518971
FWCI: 0.629
Cites: 14
Cited by: 3
Related to: 10