Study on Ternary-tree Algorithms of Packet Conflict Resolution for Random Access Channels
Dong Zhao · 2000
This paper presents a new ternary tree algorithm of packet conflict resolution to analyze random access channels. The mean times of packet conflict resolution are explicitly obtained. The analytic formulae of the throughputs for dynamic and static algorithms are provided.