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

Journal of Parallel and Distributed Computing

Volumn 66, Issue 11, 2006, Pages 1353-1358

  Das, Gautam K ^a   Das, Sandip ^a   Nandy, Subhas C ^a   Sinha, Bhabani P ^a  

^a INDIAN STATISTICAL INSTITUTE   (India)

Author keywords

Base station placement; Covering region; Voronoi diagram

Indexed keywords

BASE-STATION PLACEMENT; COVERING REGION; VORONOI DIAGRAM;

ALGORITHMS; COMPUTER NETWORKS; COMPUTER SCIENCE; MOBILE COMPUTING; PROBLEM SOLVING;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 33749517141     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2006.05.004     Document Type: Article

References (18)

1. Agarwal P.K., and Sharir M. Efficient algorithms for geometric optimization. ACM Comput. Surveys 30 4 (1998) 412-458
2. Akyildiz I.F., Su W., Sankarasubramaniam Y., and Cayirci E. A survey on sensor networks. IEEE Comm. Magazine 40 8 (2002) 102-113
3. de Berg M., Van Kreveld M., Overmars M., and Schwarzkopf O. Computational Geometry Algorithms and Applications (1997), Springer, Berlin
4. Booth L., Bruck J., Franceschetti M., and Meester R. Covering algorithms, continuum percolation and the geometry of wireless networks. Ann. Appl. Probab. 13 2 (2003) 722-741
5. A. Boukerche, X. Fei, R.B. Araujo, An energy aware coverage-preserving scheme for wireless sensor networks, in: Proceedings of the second ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks, 2005, pp. 205-213.
6. Fowler R.J., Paterson M.S., and Tanimoto S.L. Optimal packing and covering in the plane are NP-complete. Inform. Process. Lett. 12 (1981) 133-137
7. Heppes A., and Melissen J.B.M. Covering a rectangle with equal circles. Period. Math. Hungar. 34 (1997) 65-81
8. Hwang R.Z., Lee R.C.T., and Chang R.C. The slab dividing approach to solve the Euclidean p-center problem. Algorithmica 9 (1993) 1-22
9. 3 and related problems. SIAM J. Comput. 12 (1983) 759-776
10. A. Meguerdichian, F. Koushanfar, M. Potkonjak, M.B. Srivastava, Coverage problems in wireless ad-hoc sensor networks, in: Proceedings of IEEE INFOCOM, 2001, pp. 1380-1387.
11. Mehlhorn K., and Näher S. The LEDA Platform of Combinatorial and Geometric Computing (1999), Cambridge University Press, Cambridge
12. Melissen J.B.M., and Schuur P.C. Improved covering a rectangle with six and seven circles. Electron. J. Combin. 3 (1996) R32
13. Melissen J.B.M., and Schuur P.C. Covering a rectangle with six and seven circles. Discrete Appl. Math. 99 (2000) 149-156
14. Nurmela K.J. Conjecturally optimal coverings of an equilateral triangle with up to 36 equal circles. Exp. Math. 9 2 (2000)
15. 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.
16. Rademacher H., and Toeplitz O. The Enjoyment of Mathematics (1957), Princeton University Press, Princeton, NJ
17. Tarnai T., and Gasper Z. Covering a square by equal circles. Elementary Math. 50 (1995) 167-170
18. Verblunsky S. On the least number of unit circles which can cover a square. J. London Math. Soc. 24 (1949) 164-170