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.
Weitere Kapitel dieses Buchs durch Wischen aufrufen
- Placing a Given Number of Base Stations to Cover a Convex Region
Gautam K. Das
Subhas C. Nandy
Bhabani P. Sinha
- Springer Berlin Heidelberg