Placing a given number of base stations to cover a convex region

Authors:
Gautam K. Das;Sandip Das;Subhas C. Nandy;Bhabani P. Sinha
Affiliations:
Indian Statistical Institute, Kolkata, India;Indian Statistical Institute, Kolkata, India;Indian Statistical Institute, Kolkata, India;Indian Statistical Institute, Kolkata, India
Venue:
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Year:
2005

Citing 3
Cited 0

Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
LEDA: a platform for combinatorial and geometric computing

LEDA: a platform for combinatorial and geometric computing
Covering a rectangle with six and seven circles

Proceedings of the 5th Twente workshop on on Graphs and combinatorial optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

An important problem of mobile communication is placing 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. The algorithm proposed in this paper uses Voronoi diagram, and it works for covering a convex region of arbitrary shape. Experimental results justify the efficiency of our algorithm and the quality of the solution produced.