Une approche basee sur la programmation par contraintes pour affecter des cellules a des commutateurs dans les reseaux cellulaires pour mobiles

摘要

This paper discusses the problem of assigning cells to switches in mobile networks. It can be summed up as finding an optimal assignment of cells to switches in order to minimize a cost function composed of the cost of handoff between cells and the cost of cabling between cells and switches. We propose here an algorithm based on constraint programming for this problem. The choice of this method is motivated by its active use of constraints in the search for solutions, which in turn leads to the reduction of the search space and the difficulty of the problem. We introduce a new Constraint Optimization Problem model for assigning cells to switches, a definition of a lower bound on the cost of each cell and a development of search strategies, leading to an efficient way of finding the best solutions. Results showed that our algorithm leads to an optimum solution for medium size networks and can find good solutions for large size networks.