Distributed power control and removal algorithms for multimedia CDMA wireless networks

Abstract

We study in this paper both distributed power control and removal algorithms for multimedia CDMA wireless networks. In our study, users can have different data rates as well as different quality of service (QoS) requirements. We derive a necessary and sufficient condition for the fully distributed power control (FDPC) algorithm to find a feasible power set. We also prove that, if the maximal power level is used at the start, then the distributed constrained power control (DCPC) algorithm is equivalent to the FDPC algorithm. For the connection removal algorithm, we prove that the non-reinitialized removal algorithm finds a feasible power set faster and employs smaller power levels than the reinitialized one does. Performances of some connection removal criteria are also studied. Our simulation results reveal that the smallest normalized CIR (SNC) and largest CIR requirement (LCR) criteria result in smaller outage probability than the smallest CIR (SC) criterion in a multimedia environment.