Gradual removals in cellular PCS with constrained power control and noise

  • Authors:
  • Michael Andersin;Zvi Rosberg;Jens Zander

  • Affiliations:
  • Radio Communication Systems, Department of Signals, Sensors and Systems, Royal Institute of Technology, S-100 44 Stockholm, Sweden;Haifa Research Laboratory, Science and Technology, IBM Israel, Matam, 31905 Haifa, Israel;Radio Communication Systems, Department of Signals, Sensors and Systems, Royal Institute of Technology, S-100 44 Stockholm, Sweden

  • Venue:
  • Wireless Networks
  • Year:
  • 1996

Quantified Score

Hi-index 0.06

Visualization

Abstract

In this paper we study the mobile removal problem in a cellular PCS network where transmitter powers are constrained and controlled by a Distributed Constrained Power Control (DCPC) algorithm. Receivers are subject to non-negligible noise, and the DCPC attempts to bring each receiver's CIR above a given target. To evaluate feasibility and computational complexity, we assume a paradigm where radio bandwidth is scarce and inter-base station connection is fast. We show that finding the optimal removal set is an NP-Complete problem, giving rise for heuristic algorithms. We study and compare among three classes of transmitter removal algorithms. Two classes consist of algorithms which are invoked only when reaching a stable power vector under DCPC. The third class consist of algorithms which combine transmitter removals with power control. These are One-by-one Removals, Multiple Removals, and Power Control with Removals Combined. In the class of power control with removals combined, we also consider a distributed algorithm which uses the same local information as DCPC does. All removal algorithms are compared with respect to their outage probabilities and their time to converge to a stable state. Comparisons are made in a hexagonal macro-cellular system, and in two metropolitan micro-cellular systems. The Power Control with Removals Combined algorithm emerges as practically the best approach with respect to both criteria.