Assignment of cells to switches in PCS networks
IEEE/ACM Transactions on Networking (TON)
Genetic Algorithm for Extended Cell Assignment Problem in Wireless ATM Network
ASIAN '00 Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science
PCS mobility support over fixed ATM networks
IEEE Communications Magazine
Efficiency of parallel metaheuristics for solving combinatorial problems
CompSysTech '07 Proceedings of the 2007 international conference on Computer systems and technologies
| Hi-index | 0.00 |
In this paper, we investigate the extended cell assignment problem which optimally assigns new adding and splitting cells in PCS (Personal Communication Service) to switches in a wireless ATM (Asynchronous Transfer Mode) network. Given cells in a PCS and switches on an ATM network (whose locations are fixed and known), we would like to do the assignment in an attempt to minimize a cost criterion. The cost has two components: one is the cost of handoffs that involve two switches, and the other is the cost of cabling. This problem is modeled as a complex integer programming problem, and finding an optimal solution to this problem is NP-hard. A simulated annealing algorithm are proposed to solve this problem. The simulated annealing algorithm, ESA (enhanced simulated annealing), generates constraint-satisfy configurations, and uses three configuration perturbation schemes to change current configuration to a new one. Experimental results indicate that ESA algorithm has good performances.