{"title":"On the use of stochastic estimator learning automata for dynamic channel allocation in broadcast networks","authors":"G. Papadimitriou, A. Pomportsis","doi":"10.1109/CEC.2000.870283","DOIUrl":null,"url":null,"abstract":"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 new 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 stochastic estimator learning automata. The system which consists of the automata and the network is analyzed and it is proved that the probability of selecting an idle station asymptotically tends to be minimized. Therefore, the number of idle slots is drastically reduced and consequently, the network throughput is improved. Furthermore, due the use of a stochastic estimator, the automata are capable of being rapidly adapted to the sharp changes of the dynamic bursty traffic environment. Extensive simulation results are presented which indicate that the proposed protocol achieves a significantly higher performance than other well-known time division multiple access protocols when operating under bursty traffic conditions.","PeriodicalId":218136,"journal":{"name":"Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512)","volume":"15 12","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2000.870283","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10
Abstract
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 new 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 stochastic estimator learning automata. The system which consists of the automata and the network is analyzed and it is proved that the probability of selecting an idle station asymptotically tends to be minimized. Therefore, the number of idle slots is drastically reduced and consequently, the network throughput is improved. Furthermore, due the use of a stochastic estimator, the automata are capable of being rapidly adapted to the sharp changes of the dynamic bursty traffic environment. Extensive simulation results are presented which indicate that the proposed protocol achieves a significantly higher performance than other well-known time division multiple access protocols when operating under bursty traffic conditions.