Abstract
The capacity of a power controlled wireless network can be changing due to user's mobility, fading or shadowing effects. As a result, the quality of service (QOS) of users accepted by call admission control may not be guaranteed in a wireless network. In this paper, we propose a two-phase distributed scheduling algorithm to identify a subset of wireless users whose QOS is guaranteed. In the first phase, each link transmits with a probing power and each user determines whether it can be a member of the basic feasible set or not in a distributed manner. In the second phase, we develop a generalized call admission control algorithm that attempts to merge as many as possible the rest links into the basic feasible set. We consider a variation that attempts to enlarge the set of feasible links. For starvation prevention, we discuss conflict resolution in the power domain and in the time domain. Through simulation we evaluate the performance of the proposed scheme in terms of average execution time, average packet delay and maximum of the cycle time. © 2006 IEEE.