Sensor Network Deployment Using Circle Packings

  • Miu-Ling Lam
  • Yun-Hui Liu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5200)


This paper presents a novel algorithm for autonomous deployment of active sensor networks. It enhances the sensing coverage based on an initial placement of sensor nodes. The problem of placing a number of circular discs (which model sensing coverage) of different radii to cover a field is intuitively transformed to the circle packing problem. Due to the fact that a unique maximal packing exists for a given set of combinatorics (triangulations) and boundary conditions, we can always find the minimum sensing range required for every interior node to satisfy these conditions. Though an extension from tangency packing to overlap packing, the interstices among triples (which represent coverage holes) can be eliminated. Based on a number of numerical simulations, we have verified that the proposed algorithm always yields sensor deployments of wide coverage and minimizes sensing range required for every interior sensing node to satisfy the packing and boundary conditions.


Deployment mobile sensor robotics sensing coverage wireless sensor network 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Howard, A., Mataric, M.J., Sukhatme, G.S.: Mobile Sensor Network Deployment using Potential Fields: A Distributed, Scalable Solution to the Area Coverage Problem. In: Distributed Autonomous Robotic Systems, pp. 299–308. Springer, Heidelberg (2002)Google Scholar
  2. 2.
    Megiddo, N.: Linear-time Algorithms for Linear Programming in R3 and Related Problems. SIAM J. Comput. 12(4), 759–776 (1983)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Okabe, A., Boots, B., Sugihara, K., Chiu, S.-N.: Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. Wiley, Chichester (2000)CrossRefzbMATHGoogle Scholar
  4. 4.
    Shamos, M.I., Hoey, D.: Closest-Point Problems. In: Proc. 16th Annual IEEE Symposium on Foundations of Comput. Science, pp. 224–233. ACM, New York (1975)Google Scholar
  5. 5.
    Skyum, S.: A Simple Algorithm for Computing the Smallest Enclosing Circle. Information Processing Letters 37, 121–125 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Wang, G.-L., Cao, G., Porta, T.L.: Movement-Assisted Sensor Deployment. In: INFOCOM (March 2004)Google Scholar
  7. 7.
    Zou, Y., Chakrabarty, K.: Sensor Deployment and Target Localization based on Virtual Forces. In: INFOCOM (April 2003)Google Scholar
  8. 8.
    Lam, M.-L., Liu, Y.-H.: ISOGRID: an Efficient Algorithm for Coverage Enhancement in Mobile Sensor Networks. In: Proceedings of 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2006), pp. 1458–1463 (2006)Google Scholar
  9. 9.
    Stephenson, K.: Introduction to Circle Packing: The Theory of Discrete Analytic Functions. Cambridge University Press, New York (2005)zbMATHGoogle Scholar
  10. 10.
    Thurston, W.: The finite Riemann mapping theorem. In: An International Symposium at Purdue University in celebrations of de Branges’ proof of the Bieberbach conjecture (March 1985)Google Scholar
  11. 11.
    Rodin, B., Sullivan, D.: The convergence of circle packings to Riemann mapping. Journal of Differential Geometry 26, 349–360 (1987)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Miu-Ling Lam
    • 1
  • Yun-Hui Liu
    • 1
  1. 1.Department of Mechanical and Computer-Aided EngineeringThe Chinese University of Hong Kong, ShatinHong Kong

Personalised recommendations