An algorithm for maximising covered area

This paper presents an algorithm for positioning circles in a given region to maximise the covered area. Our algorithm has applications in wireless networks, such as positioning a given number of mobile stations in a given region, one goal of which is to cover the largest area possible. Although the evaluation of the function value, i.e., the total covered area, is difficult, we bypass this difficulty by calculating the gradient of the total covered area directly. As long as nodes continuously move in directions that guarantee increasing coverage, a configuration of node positions corresponding to a maximal covered area can eventually be identified.

[1]  N. J. A. Sloane,et al.  Sphere Packings, Lattices and Groups , 1987, Grundlehren der mathematischen Wissenschaften.

[2]  D. Boyd.  An Algorithm for Generating the Sphere Coordinates in a Three-Dimensional Osculatory Packing , 1973 .

[3]  E. Santiso,et al.  Dense packing of binary and polydisperse hard spheres , 2002 .

[4]  Henry A. Krieger,et al.  The Global Optimization of Incoherent-Phase Signals , 1971 .

[5]  Anuraag R. Kansal,et al.  Computer generation of dense polydisperse sphere packings , 2002 .

[6]  Jon Hamkins,et al.  Asymptotically dense spherical codes - Part h Wrapped spherical codes , 1997, IEEE Trans. Inf. Theory.

[7]  Gaurav S. Sukhatme,et al.  Constrained coverage for mobile sensor networks , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[8]  J. Appelbaum,et al.  The packing of circles on a hemisphere , 1999 .

[9]  Sanjay Jha,et al.  The holes problem in wireless sensor networks: a survey , 2005, MOCO.

[10]  Gary Edward Mueller,et al.  Numerical simulation of packed beds with monosized spheres in cylindrical containers , 1997 .

[11]  Xiang-Yang Li,et al.  Coverage in wireless ad-hoc sensor networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[12]  Patric R. J. Östergård,et al.  Dense packings of congruent circles in a circle , 1998, Discret. Math..

[13]  Monte Carlo study of the sphere packing problem , 2003 .

[14]  Thomas L. Saaty,et al.  Optimization and the Geometry of Numbers: Packing and Covering , 1975 .

[15]  Di Tian,et al.  A coverage-preserving node scheduling scheme for large wireless sensor networks , 2002, WSNA '02.

[16]  R. Kershner.  The Number of Circles Covering a Set , 1939 .

[17]  Leung Tsang,et al.  Monte Carlo Simulations of the Extinction Rate of Densely Packed Spheres with Clustered and Nonclustered Geometries , 1995 .

[18]  W. Hsiang.  Least Action Principle of Crystal Formation of Dense Packing Type and Kepler's Conjecture , 2002 .

[19]  J. L. Finney,et al.  Random packings and the structure of simple liquids. I. The geometry of random close packing , 1970, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[20]  Michael L. Honig.  Channel Shaping To Maximize Minimum Distance , 1991, Proceedings. 1991 IEEE International Symposium on Information Theory.

[21]  Masaaki Harada,et al.  On the covering radius of Z4-codes and their lattices , 1999, IEEE Trans. Inf. Theory.

[22]  Jon Hamkins,et al.  Asymptotically dense spherical codes - Part II: Laminated spherical codes , 1997, IEEE Trans. Inf. Theory.

[23]  Michael Goldberg.  On the Densest Packing of Equal Spheres in a Cube , 1971 .

[24]  Deborah Estrin,et al.  Adaptive beacon placement , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[25]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2003, WSNA '03.

[26]  Jon Hamkins,et al.  Gaussian source coding with spherical codes , 2002, IEEE Trans. Inf. Theory.

[27]  Radha Poovendran,et al.  Stochastic coverage in heterogeneous sensor networks , 2006, TOSN.

[28]  Katta G. Murty,et al.  Linear complementarity, linear and nonlinear programming , 1988 .

[29]  Mingyan Liu,et al.  Randomly Duty-cycled Wireless Sensor Networks: Dynamics of Coverage , 2006, IEEE Transactions on Wireless Communications.

[30]  John W. Woods,et al.  Maximum minimal distance partitioning of the Z2 lattice , 2003, IEEE Trans. Inf. Theory.