A major step in effectively managing radio resources in a cellular network is to design an appropriate scheme for assigning cells to a location area (LA), serviced by a switch, and allocate resources for individual switches. However, this assignment is already proven in the literature to be an NP-hard problem [Merchant A, Sengupta B. Assignment of cells to switches in PCS networks. IEEE/ACM Transactions on Networking 3(5) (1995) 521-6] that requires efficient heuristic search techniques for obtaining real-time solutions. This work presents a state-space search technique, which is a variant of best first search heuristic technique. The algorithm called the block depth first search (BDFS), allocates cells to switches during switch level resource planning. Under various simulated performance criteria, we compare the performance of the proposed technique with other similar procedures in the literature. Our results indicate that the BDFS outperforms the meta-heuristic procedures in terms of both efficiency and quality of solutions. Hence, we conclude that our proposed technique can be effectively used for switch level planning leading to an efficient management of scarce radio resource in cellular networks.
All Science Journal Classification (ASJC) codes
- Strategy and Management
- Management Science and Operations Research
- Information Systems and Management