Analysis of an identifier splitting algorithm combined with polling(ISAP) for contention resolution in a wireless access network

摘要

A contention resolution scheme for an uplink contention channel inna wireless access network is presented. The scheme consists of a treenalgorithm, namely the identifier splitting algorithm (ISA), combinednwith a polling scheme. Initially, ISA is used, but at a certain level ofnthe tree, the scheme switches to polling of the stations. This scheme isnfurther enhanced by skipping a few levels in the tree when starting thenalgorithm (both in a static and a dynamic way) and by allowing multipleninstants simultaneously. An analytical model of the system and itsnvariants leads to the evaluation of its performance, by means of thendelay density function and the throughput characteristics. This model isnused to investigate the influence of the packet arrival rate, theninstant at which the ISA scheme switches to polling, the starting levelnof the ISA scheme, and the use of multiple instances on the mean delay,nthe delay quantiles, and the throughput