Approximate Analysis for M/G/1-Polling System with Adaptive Polling Mechanism

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.