The Coverage of a Planar Region by Randomly Deployed Sensors
Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 10 (2010) no. 4, pp. 7-25 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The problem of energy-efficient monitoring of a planar region by sensors with adjustable sensing ranges can be reduced to the problem of constructing least density coverage of the area by disks of various (not known a priori) radii. Due to the complexity of the problem, only so-called regular covers that use disks of one, two or three radii are usually considered. In that case centers of disks are placed in nodes of a grid formed by regular polygons and in some interior points of the polygons. However, for many applications it is unrealistic to expect all sensors to be placed exactly in the prescribed positions. Assuming that the sensors are randomly deployed, we propose close to regular covers and explore relationship among achievable coverage quality, node density, and sensor network lifetime.
Keywords: sensor networks, coverage density, random distribution.
@article{VNGU_2010_10_4_a1,
     author = {T. A. Aldyn-ool and A. I. Erzin and V. V. Zalyubovskiy},
     title = {The {Coverage} of a {Planar} {Region} by {Randomly} {Deployed} {Sensors}},
     journal = {Sibirskij \v{z}urnal \v{c}istoj i prikladnoj matematiki},
     pages = {7--25},
     year = {2010},
     volume = {10},
     number = {4},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VNGU_2010_10_4_a1/}
}
TY  - JOUR
AU  - T. A. Aldyn-ool
AU  - A. I. Erzin
AU  - V. V. Zalyubovskiy
TI  - The Coverage of a Planar Region by Randomly Deployed Sensors
JO  - Sibirskij žurnal čistoj i prikladnoj matematiki
PY  - 2010
SP  - 7
EP  - 25
VL  - 10
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/VNGU_2010_10_4_a1/
LA  - ru
ID  - VNGU_2010_10_4_a1
ER  - 
%0 Journal Article
%A T. A. Aldyn-ool
%A A. I. Erzin
%A V. V. Zalyubovskiy
%T The Coverage of a Planar Region by Randomly Deployed Sensors
%J Sibirskij žurnal čistoj i prikladnoj matematiki
%D 2010
%P 7-25
%V 10
%N 4
%U http://geodesic.mathdoc.fr/item/VNGU_2010_10_4_a1/
%G ru
%F VNGU_2010_10_4_a1
T. A. Aldyn-ool; A. I. Erzin; V. V. Zalyubovskiy. The Coverage of a Planar Region by Randomly Deployed Sensors. Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 10 (2010) no. 4, pp. 7-25. http://geodesic.mathdoc.fr/item/VNGU_2010_10_4_a1/

[1] Anastasi J., Conti M., Di Francesco M., Passarella A., “Energy Conservation in Wireless Sensor Networks: A Survey”, Ad Hoc Networks, 7:3 (2009), 537–568 | DOI

[2] Cardei M., Du D. Z., “Improving Wireless Sensor Network Lifetime through Power Aware Organization”, ACM Wireless Networks, 11:3 (2005), 333–340 | DOI

[3] Astrakov S. N., Erzin A. I., Zalyubovskii V. V., “Sensornye seti i pokrytie ploskosti krugami”, Diskretnyi analiz i issledovanie operatsii, 16:3 (2009), 3–19 | MR

[4] Kershner R., “The Number of Circles Covering a Set”, American J. of Mathematics, 61:3 (1939), 665–671 | DOI | MR

[5] Tóth F. G., “Covering the Plane with Two Kinds of Circles”, Discrete Computational Geometry, 13:3 (1995), 445–457 | MR

[6] Wu J., Yang S., “Energy-Efficient Node Scheduling Models in Sensor Networks with Adjustable Ranges”, Int. J. of Foundations of Computer Science, 16:1 (2005), 3–17 | DOI | MR | Zbl

[7] Fan G., Wang R., Huang H., Sun L., Sha C., “Coverage-Guaranteed Sensor Node Deployment Strategies for Wireless Sensor Networks”, Sensors, 10:3 (2010), 2064–2087 | DOI

[8] Yen L.-H., Yu C. W., Cheng Y. M., “Expected $k$-Coverage in Wireless Sensor Networks”, Ad Hoc Networks, 5:4 (2006), 636–650 | DOI

[9] Zalyubovskiy V., Erzin A., Astrakov S., Choo H., “Energy-Efficient Area Coverage by Sensors with Adjustable Ranges”, Sensors, 9:4 (2009), 2446–2460 | DOI

[10] Dietrich I., Dressler F., “On the Lifetime of Wireless Sensor Networks”, ACM Trans. on Sensor Networks, 5:1 (2009), 1–39 | DOI | MR

[11] Cardei M., Thai M. T., Li Y., Wu W., “Energy-Efficient Target Coverage in Wireless Sensor Networks”, Proc. of the $24^\text{th}$ Conference of the IEEE Communications Society (INFOCOM), 2005, 1976–1984

[12] Erzin A. I., Zalyubovskii V. V., “Maksimizatsiya vremeni funktsionirovaniya besprovodnykh sensornykh setei”, Metody optimizatsii i ikh prilozheniya, Tr. XIV Baikalskoi mezhdunar. shkoly-seminara, v. 1, ISEM SO RAN, Irkutsk, 2008, 363–369

[13] Cardei M., Wu J., Ku M., “Improving Network Lifetime Using Sensors with Adjustable Sensing Ranges”, Int. J. of Sensor Networks, 1:1 (2006), 41–49 | DOI

[14] Robbins H. E., “On the Measure of a Random Set”, The Annals of Mathematical Statistics, 15:1 (1944), 70–74 | DOI | MR | Zbl