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. Due to transmitters mobility and random signal propagation, there are system states where not all transmitters can be supported, even under the optimal power control. Thus, some of them should be removed. It can be shown that finding the optimal removal set is an NP-Complete problem, and therefore gives rise to heuristic algorithms. In this paper we study and compare among three classes of transmitter removal algorithms, One-by-one removals, Multiple Removals and Power Control with Removals Combined. All removal algorithms are compared with respect to their outage probabilities and their time to convergence to a steady state. The Power Control with Removals Combined algorithm emerges as the best approach with respect to both criteria.
| Original language | English |
|---|---|
| Pages | 56-60 |
| Number of pages | 5 |
| State | Published - 1 Dec 1995 |
| Externally published | Yes |
| Event | Proceedings of the 1995 6th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC'95. Part 3 (of 3) - Toronto, Can Duration: 27 Sep 1995 → 29 Sep 1995 |
Conference
| Conference | Proceedings of the 1995 6th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC'95. Part 3 (of 3) |
|---|---|
| City | Toronto, Can |
| Period | 27/09/95 → 29/09/95 |
ASJC Scopus subject areas
- General Engineering