Abstract
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.
This work is supported in part by Hong Kong RGC under grant 414505. It is also affiliated with the Microsoft-CUHK Joint Laboratory for Human-centric Computing and Interface Technologies.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Megiddo, N.: Linear-time Algorithms for Linear Programming in R3 and Related Problems. SIAM J. Comput. 12(4), 759–776 (1983)
Okabe, A., Boots, B., Sugihara, K., Chiu, S.-N.: Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. Wiley, Chichester (2000)
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)
Skyum, S.: A Simple Algorithm for Computing the Smallest Enclosing Circle. Information Processing Letters 37, 121–125 (1991)
Wang, G.-L., Cao, G., Porta, T.L.: Movement-Assisted Sensor Deployment. In: INFOCOM (March 2004)
Zou, Y., Chakrabarty, K.: Sensor Deployment and Target Localization based on Virtual Forces. In: INFOCOM (April 2003)
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)
Stephenson, K.: Introduction to Circle Packing: The Theory of Discrete Analytic Functions. Cambridge University Press, New York (2005)
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)
Rodin, B., Sullivan, D.: The convergence of circle packings to Riemann mapping. Journal of Differential Geometry 26, 349–360 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lam, ML., Liu, YH. (2008). Sensor Network Deployment Using Circle Packings. In: Vazão, T., Freire, M.M., Chong, I. (eds) Information Networking. Towards Ubiquitous Networking and Services. ICOIN 2007. Lecture Notes in Computer Science, vol 5200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89524-4_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-89524-4_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89523-7
Online ISBN: 978-3-540-89524-4
eBook Packages: Computer ScienceComputer Science (R0)