We study the problem of finding the least dense regular covering of a plane by disks of different radii. We introduce k-level regular coverings that generalize some known models. We obtain a bound for the density of multi-level coverings and construct a three-level covering of density ≈ 1.083. Bibliography: 14 titles. Illustrations: 11 figures.
Similar content being viewed by others
References
S. N. Astrakov, V. V. Zalyubovskiy, and A. I. Erzin, “Sensor networks and covering of plane by disks” [in Russian], Diskretn. Anal. Issled. Oper. 16, No. 3, 3–19 (2009).
R. Kershner, “The number of circles covering a set,” Amer. J. Math. 61, No. 3, 665–671 (1939).
J. Wu, S. Yang, “Energy-efficient node scheduling models in sensor networks with adjustible ranges,” Int. J. of Foundation of Computer Science 16, No. 1. 3–17 (2005).
M. Cardei, J. Wu, M. Lu, “Improving netwotk lifetime using sensors with adjustible sensing ranges,” Int. J. of Sensor Networks 1, No. 1–2. 41–49 (2006).
J. Wu, F. Dai, “Virtual backbone construction in manets using adjustable transmission ranges,” IEEE Trans. on Mobile Computing 5, No. 9. 1188–1200 (2006).
V. Zalyubovskiy, A. Erzin, S. Astrakov, and H. Choo, “Energy-efficient area coverage by sensors with adjustable ranges,” Sensors 9, 2446–2460 (2009).
N. D. Nguen, V. Zalyubovsky, M. Ha Th., T. D. Le, and H. Choo, “Energy-efficient models for coverage problem in sensor networks with adjustable ranges,” Ad Hoc Sensor Wireless Networks 16, 1–28 (2012).
A. Erzin, S. Astrakov, Min- density stripe covering and applications in sensor networks, Lect. Notes Comp. Sci. 6784, 152–162 (2011).
S. Astrakov and A. Erzin, “Building effective coverage models for monitoring of extended objects” [in Russian], Vych. Tekh. 17, No. 1, 26–34 (2012).
A. Erzin, R. Plotnikov, and Yu. Shamardin “Some polynomially solvable cases and approximation algorithms for optimal communication tree construction problem” [in Russian], Diskretn. Anal. Issled. Oper. 20, No. 1. 12–27 (2013); English transl.: J. Appl. Industr. Math. 7, No. 2, 142–152 (2013).
A. Erzin and R. Plotnikov, Wireless sensor network’s lifetime maximization problem in case of given set of covers, Lect. Notes Comp. Sci. 6786, 44–57 (2011).
A. Erzin and R. Plotnikov, “On maximization of sensor network’s lifetime subject to the limited resources” [in Russian], Diskretn. Anal. Issled. Oper. 18, No. 6. 17–32 (2011).
T. A. Aldyn-ool, A. I. Erzin, V. V. Zalyubovskiy, “The coverage of a planar region by randomly deployed sensors” [in Russian], Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform. 10, No. 4, 7–25 (2010).
F. G. Toth, “Covering the plane with two kinds of circles,” Discrete Comput. Geom. 13, No. 3, 445–457 (1995).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Vestnik Novosibirskogo Gosudarstvennogo Universiteta: Seriya Matematika, Mekhanika, Informatika 14, No. 1, 2014, pp. 112-128.
Rights and permissions
About this article
Cite this article
Takhonov, I.I. Multi-Level Regular Coverings of the Plane by Disks. J Math Sci 211, 886–901 (2015). https://doi.org/10.1007/s10958-015-2642-8
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-015-2642-8