Gradual Removals in Cellular PCS with Constrained Power Control and Noise
1996 (English)In: Wireless networks, ISSN 1022-0038, E-ISSN 1572-8196, Vol. 2, no 1, 27-43 p.Article in journal (Refereed) Published
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.
Place, publisher, year, edition, pages
Kluwer Academic Publishers , 1996. Vol. 2, no 1, 27-43 p.
Computer and Information Science
Research subject SRA - ICT
IdentifiersURN: urn:nbn:se:kth:diva-28554DOI: 10.1007/BF01201460OAI: oai:DiVA.org:kth-28554DiVA: diva2:387981
QC 201101172011-01-162011-01-162011-01-17Bibliographically approved