V. Vishnevsky, A. Dudin, V. Klimenok, O. Semenova, S. Shpilev
{"title":"Approximate Analysis for M/G/1-Polling System with Adaptive Polling Mechanism","authors":"V. Vishnevsky, A. Dudin, V. Klimenok, O. Semenova, S. Shpilev","doi":"10.1109/ICCW.2009.5208095","DOIUrl":null,"url":null,"abstract":"We investigate a polling model for a radio-cell of the broadband wireless IEEE 802.11 DCF network. A radio-cell is assumed to work in the \"data collection\" regime. It is modelled by the polling system with N queues and a single server polling the queues in a cyclic adaptive order. Under adaptive scheme, the server (base station) skips (does not visit) the queues (subscriber stations) which were empty at their polling moments at the previous cycle that allows cutting expenses. In the paper, we present an iteration procedure to calculate the mean waiting time in queues and provide numerical examples to compare theoretical results and ones obtained from simulation.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Conference on Communications Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCW.2009.5208095","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
We investigate a polling model for a radio-cell of the broadband wireless IEEE 802.11 DCF network. A radio-cell is assumed to work in the "data collection" regime. It is modelled by the polling system with N queues and a single server polling the queues in a cyclic adaptive order. Under adaptive scheme, the server (base station) skips (does not visit) the queues (subscriber stations) which were empty at their polling moments at the previous cycle that allows cutting expenses. In the paper, we present an iteration procedure to calculate the mean waiting time in queues and provide numerical examples to compare theoretical results and ones obtained from simulation.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
