A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Efficient algorithm for placing a given number of base stations to cover a convex region
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
doi:10.1016/j.jpdc.2006.05.004
fatcat:5d4njporwjfexabwopmm3wzf2a