We investigate a polling model of a radio-cell of the broadband wireless IEEE 802.11 network.
A radio-cell is assumed to work in the ‘‘data collection’’ regime. It is modeled by a 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 iterative procedure
for calculating the first and second moments of the waiting time in queues and provide numerical examples
to compare theoretical results and ones obtained from simulation.