Location of controllers in wireless communication networks using a hybrid simulated annealing algorithm

摘要

This paper presents an algorithm for the location of controllers in wireless communication networks using hybrid heuristics. We propose a model in which N base stations out of the total M of the network must be selected as controllers. The primary design objective is that the distance between all base stations and the N controllers is minimized. There is also a constraint of capacity, which prevents a controller to manage an unlimited number of base stations. Following this model, the location of controllers in wireless networks is equivalent to a capacitated p-center problem, a well known NP-hard optimization problem. In this paper we propose a greedy-simulated annealing algorithm to solve the problem, and we compare its results with that of a lower bound for the problem.