Problem of assignment cells to switches in a cellular mobile network via Beam search method

Authors:
Cassilda Maria Ribeiro;Aníbal Tavares Azevedo;Rodolfo Florence Teixeira
Affiliations:
Faculdade de Engenharia de Guaratinguetá, DMA, São Paulo State University, Guaratinguetá, SP, Brazil;Faculdade de Engenharia de Guaratinguetá, DMA, São Paulo State University, Guaratinguetá, SP, Brazil;Faculdade de Engenharia de Bauru, DEP, São Paulo State University, Bauru, SP, Brazil
Venue:
WSEAS TRANSACTIONS on COMMUNICATIONS
Year:
2010

Citing 11
Cited 0

Assignment of cells to switches in PCS networks

IEEE/ACM Transactions on Networking (TON)
Introduction to Numerical Methods for Parallel Computers

Introduction to Numerical Methods for Parallel Computers
A Simple Heuristic for Assignment of Cells to Switches in a PCS Network

Wireless Personal Communications: An International Journal
Artificial Intelligence: A Modern Approach

Artificial Intelligence: A Modern Approach
The harpy speech recognition system.

The harpy speech recognition system.
Constraint-directed search: a case study of job-shop scheduling

Constraint-directed search: a case study of job-shop scheduling
A heuristics based approach for cellular mobile network planning

Proceedings of the 2006 international conference on Wireless communications and mobile computing
Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time

Computers and Industrial Engineering
Assigning cells to switches in cellular mobile networks using taboosearch

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Assigning cells to switches in cellular networks by incorporating a pricing mechanism into Simulated annealing

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Assigning cells to switches in cellular mobile networks: a comparative study

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of assigning cells to switches in a cellular mobile network is an NP-hard optimization problem. So, real size mobile networks could not be solved by using exact methods. The alternative is the use of the heuristic methods, because they allow us to find a good quality solution in a quite satisfactory computational time. This paper proposes a Beam Search method to solve the problem of assignment cell in cellular mobile networks. Some modifications in this algorithm are also presented, which allows its parallel application. Computational results obtained from several tests confirm the effectiveness of this approach to provide good solutions for medium- and large-sized cellular mobile network.