References
- CardeiM, DuD-Z. Improving wireless sensor network lifetime through power aware organization. ACM Wirel. Networks. 2005;11:333–340.
- CardeiM, WuJ, LuM. Improving network lifetime using sensors with adjustable sensing ranges. Int. J. Sens. Networks. 2006;1:41–49.
- ErzinAI, AstrakovSN. Min-density stripe covering and applications in sensor networks. LNCS. 2011;6784:152–162.
- WuJ, YangS. Energy-efficient node scheduling models in sensor networks with adjustable ranges. Int. J. Found. Comput. Sci. 2005;16:3–17.
- ZalyubovskiyV, ErzinA, AstrakovS, ChooH. Energy-efficient area coverage by sensors with adjustable ranges. Sensors. 2009;9:2446–2469.
- NguyenND, ZalyubovskiyV, HaMT, LeTD, ChooH. Energy-efficient models for coverage problem in sensor networks with adjustable ranges. Adhoc. Sens. Networks. 2012;16:1–28.
- BöröczkyKJr. Finite packing and covering. Cambridge: Cambridge University Press; 2004.
- Fejes, Tóth L.1953. Lagerungen in der ebene auf der kugel undim raum. Berlin: Springer-Verlag.
- KershnerR. The number of circles covering a set. Am. J. Math. 1939;61:665–671.
- Fejes, Tóth G.Covering the plane with two kinds of circles. DCG. 1995. 13: 445–457.
- Zalyubovskiy, V., Aldyn-ool, T., Erzin, A., ChooH.Energy-Efficient Coverage-Guaranteed Node Scheduling Models in Sensor Networks with Random Deployed Sensors. 2nd International Conference on Internet; 2010 Dec 16–20; Kuala-Lumpur:Philippines.
- KimberlingC. Triangle centers and central triangles. Congr. Numer. 1998;129:1–295.
- Rogers, C. A.Packing and covering. Cambridge: Cambridge University Press; 1964.