Making ALOHA Intelligent Taking Advantage of Working Memory Capacity

Abstract

ALOHA with priority acknowledgments (ACK) is transformed into a collision-free channel access method by increasing the amount of working memory capacity with which communicating nodes remember each node that has requested to join the channel successfully. This results in ALOHA-NUI, for neighborhood understood index. The throughput of ALOHA-NUI is compared with the throughput of TDMA with a fixed transmission schedule, ALOHA with priority ACK's, and CSMA with priority ACK's analytically and by simulation. ALOHA-NUI is shown to attain the high throughput of collision-free transmission scheduling methods that usually require clock synchronization while maintaining most of the simplicity of ALOHA with priority ACK's.