Polling Multiple Access Protocol Based on the Waiting Time and Channel State
Zhao Dong-feng · Beijing Youdian Xueyuan xuebao · 2008
Dynamic limited polling multiple access protocol based on waiting time of packets and channel state is proposed.This protocol adaptively controls the polling process according to the instantaneous waiting time of packets and the channel state for each node,and serves the one with the longest packet waiting time and good channel state first in each polling cycle.By means of imbedded Markov chain theory and vacation queue model,the model and its performance analysis of that protocol are given assuming that channel is modeled as a two-state Markov chain.By comparing with the basic polling system,it is shown that the proposed system can reduce the mean waiting time of packets and increase system throughput.