An modeling and algorithm for the expansion in PCS radio network

In the initial stage of PCS, large cells are provided for low density area and the high density areas are covered by the minimum cells. As the number of PCS subscribers becomes larger, it requires enormous demands for additional radio network capacity, which must evolve from extended cells to microcells in a given area. In this paper, we formulate the problem of finding an optimal expansion strategy of PCS radio network, mainly cells, over a planning horizon and develop a heuristic algorithm for the problem. The heuristic algorithm developed here uses a backward approach from the final time of the planning horizon and can be efficiently implemented for splitting the cells