Sciweavers

Share
JPDC
2006

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

8 years 7 months ago
Efficient algorithm for placing a given number of base stations to cover a convex region
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 develop 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, Laboratory for Theoretical Computer Science, Helsinky University of Technology, 2000] and an equilateral triangle [K.J. Nurmela, Conjecturally optimal coverings of an equilateral triang...
Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhaban
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2006
Where JPDC
Authors Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhabani P. Sinha
Comments (0)
books