Back to Search
Start Over
Placing a Given Number of Base Stations to Cover a Convex Region.
- Source :
- Distributed Computing - IWDC 2005; 2005, p57-62, 6p
- Publication Year :
- 2005
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISBNs :
- 9783540309598
- Database :
- Supplemental Index
- Journal :
- Distributed Computing - IWDC 2005
- Publication Type :
- Book
- Accession number :
- 32903040
- Full Text :
- https://doi.org/10.1007/11603771_6