Efficient algorithm for placing a given number of base stations to cover a convex region

Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhabani P. Sinha
2006 Journal of Parallel and Distributed Computing  
In the context of mobile communication, an efficient algorithm for the base-station placement problem is developed in this paper. The objective is to place a given number of base-stations in a given convex region, and to assign range to each of them such that every point in the region is covered by at least one base-station, and the maximum range assigned is minimized. It is basically covering a region by a given number of equal radius circles where the objective is to minimize the radius. We
more » ... velop an efficient algorithm for this problem using Voronoi diagram which works for covering a convex region of arbitrary shape. Existing results for this problem are available when the region is a square [K.J. Nurmela, P.R.J. Ostergard, Covering a square with up to 30 equal circles, Research Report HUT-TCS-A62
doi:10.1016/j.jpdc.2006.05.004 fatcat:5d4njporwjfexabwopmm3wzf2a