Date Added: Feb 2011
In a traffic load model the authors consider an optimization problem for cellular telephone networks that addresses the cell site selection with the aim to maximize the number of supplied demand nodes and minimize the number of stations that have to be built. Finding optimum regions or locations for a cellular radio network design is considered as a mathematical optimization problem and is hard to approximate. In this paper, they propose an efficient algorithm for the same problem using voronoi diagram. The objective is to place a given number of base-stations in a given region and to assign range to each of them such that every point in the region is covered by at least one base-station.