{"title":"具有竞争窗口的IEEE 802.11 DCF的最优性能研究","authors":"Chien-Erh Weng, Chun-Yin Chen, Chiung-Hsing Chen, Chien-Hunh Chen","doi":"10.1109/BWCCA.2011.81","DOIUrl":null,"url":null,"abstract":"The IEEE 802.11 protocol has achieved worldwide acceptance with WLANs with minimum management and maintenance costs. In order to maximize the throughput, stations had to spend many times to find out the best contention window. In this paper, we modified the Wang¡¦s model and took account of the freezing of the back off counter when channel is busy. In the modified model, it is easily to obtain the optimal contention window for a given network scale. The selection of optimal contention window is just based on the network scales. Simulation results showed that the throughput is the same as Wang¡¦s. But, the optimal contention window is less than Wang¡¦s.","PeriodicalId":391671,"journal":{"name":"2011 International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Optimal Performance Study of IEEE 802.11 DCF with Contention Window\",\"authors\":\"Chien-Erh Weng, Chun-Yin Chen, Chiung-Hsing Chen, Chien-Hunh Chen\",\"doi\":\"10.1109/BWCCA.2011.81\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The IEEE 802.11 protocol has achieved worldwide acceptance with WLANs with minimum management and maintenance costs. In order to maximize the throughput, stations had to spend many times to find out the best contention window. In this paper, we modified the Wang¡¦s model and took account of the freezing of the back off counter when channel is busy. In the modified model, it is easily to obtain the optimal contention window for a given network scale. The selection of optimal contention window is just based on the network scales. Simulation results showed that the throughput is the same as Wang¡¦s. But, the optimal contention window is less than Wang¡¦s.\",\"PeriodicalId\":391671,\"journal\":{\"name\":\"2011 International Conference on Broadband and Wireless Computing, Communication and Applications\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Broadband and Wireless Computing, Communication and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BWCCA.2011.81\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Broadband and Wireless Computing, Communication and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BWCCA.2011.81","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimal Performance Study of IEEE 802.11 DCF with Contention Window
The IEEE 802.11 protocol has achieved worldwide acceptance with WLANs with minimum management and maintenance costs. In order to maximize the throughput, stations had to spend many times to find out the best contention window. In this paper, we modified the Wang¡¦s model and took account of the freezing of the back off counter when channel is busy. In the modified model, it is easily to obtain the optimal contention window for a given network scale. The selection of optimal contention window is just based on the network scales. Simulation results showed that the throughput is the same as Wang¡¦s. But, the optimal contention window is less than Wang¡¦s.