A hybrid greedy-simulated annealing algorithm for the optimal location of controllers in wireless networks
Sancho Salcedo‐Sanz, A. Portilla-Figueras, Silvia Jiménez-Fernández, Juan Antonio Martinez-Rojas · 2006
Abstract:- This paper presents preliminary work on 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. We have implemented and tested a greedy-simulated annealing algorithm to solve the problem, comparing its results with that of a lower bound for the problem. Key-Words:- wireless networks, controllers location, heuristics, simulated annealing.