Self-adaptive TDMA protocols: a learning-automata-based approach

Due to its fixed assignment nature, the well-known TDMA protocol suffers from poor performance when the offered traffic is bursty. In this paper a learning-automata-based time division multiple access protocol, which is capable of operating efficiently under bursty traffic conditions, is introduced. According to the proposed protocol, the station which grants permission to transmit at each time slot is selected by means of learning automata. The choice probability of the selected station is updated by taking into account the network feedback information. The system which consists of the automata and the network is analyzed and it is proved that the choice probability of each station asymptotically tends to be proportional to the probability that this station is not idle. Thus, although there is no centralized control of the stations and the traffic characteristics are unknown and time-variable, each station tends to take a fraction of the bandwidth proportional to its needs. Furthermore, extensive simulation results are presented which indicate that the proposed protocol achieves a significantly higher performance that other well-known time division multiple access protocols when operating under bursty traffic conditions.