Follow
Vyacheslav Zalyubovskiy
Vyacheslav Zalyubovskiy
Sobolev Institute of Mathematics
Verified email at math.nsc.ru
Title
Cited by
Cited by
Year
Energy-efficient area coverage by sensors with two adjustable ranges
V Zalyubovskiy, A Erzin, S Astrakov, H Choo
2009 7th International Symposium on Modeling and Optimization in Mobile, Ad …, 2009
962009
A distributed delay-efficient data aggregation scheduling for duty-cycled WSNs
B Kang, PKH Nguyen, V Zalyubovskiy, H Choo
IEEE Sensors Journal 17 (11), 3422-3437, 2017
532017
Delay-minimized energy-efficient data aggregation in wireless sensor networks
HN Le, V Zalyubovskiy, H Choo
2012 International Conference on Cyber-Enabled Distributed Computing and …, 2012
292012
Level-based approach for minimum-transmission broadcast in duty-cycled wireless sensor networks
T Le Duc, DT Le, VV Zalyubovskiy, DS Kim, H Choo
Pervasive and Mobile Computing 27, 116-132, 2016
282016
Delay-efficient data aggregation scheduling in duty-cycled wireless sensor networks
NPK Ha, V Zalyubovskiy, H Choo
Proceedings of the 2012 ACM research in applied computation symposium, 203-208, 2012
252012
Collision-tolerant broadcast scheduling in duty-cycled wireless sensor networks
DT Le, T Le Duc, VV Zalyubovskiy, DS Kim, H Choo
Journal of Parallel and Distributed Computing 100, 42-56, 2017
242017
LABS: Latency aware broadcast scheduling in uncoordinated duty-cycled wireless sensor networks
DT Le, T Le Duc, VV Zalyubovskiy, DS Kim, H Choo
Journal of Parallel and Distributed Computing 74 (11), 3141-3152, 2014
242014
Network slice admission model: Tradeoff between monetization and rejections
R Challa, VV Zalyubovskiy, SM Raza, H Choo, A De
IEEE Systems Journal 14 (1), 657-660, 2019
222019
Energy-efficient Models for Coverage Problem in Sensor Networks with Adjustable Ranges.
ND Nguyen, VV Zalyubovskiy, MT Ha, TD Le, H Choo
Ad Hoc Sens. Wirel. Networks 16 (1-3), 1-28, 2012
212012
Efficient time latency of data aggregation based on neighboring dominators in WSNs
TD Nguyen, V Zalyubovskiy, H Choo
2011 IEEE Global Telecommunications Conference-GLOBECOM 2011, 1-6, 2011
212011
Sensor networks and covering of plane by discs
SN Astrakov, AI Erzin, VV Zalyubovskiy
Diskretnyi Analiz i Issledovanie Operatsii 16 (3), 3-19, 2009
192009
Towards broadcast redundancy minimization in duty‐cycled wireless sensor networks
TL Duc, DT Le, VV Zalyubovskiy, DS Kim, H Choo
International Journal of Communication Systems 30 (6), e3108, 2017
152017
The coverage of a planar region by randomly deployed sensors
TA Aldyn-ool, AI Erzin, VV Zalyubovskiy
Siberian Journal of Pure and Applied Mathematics 10 (4), 7-25, 2010
142010
LNDIR: A lightweight non-increasing delivery-latency interval-based routing for duty-cycled sensor networks
MK Shahzad, DT Nguyen, V Zalyubovskiy, H Choo
International Journal of Distributed Sensor Networks 14 (4), 1550147718767605, 2018
112018
A provably tight delay-driven concurrently congestion mitigating global routing algorithm
R Samanta, AI Erzin, S Raha, YV Shamardin, II Takhonov, ...
Applied Mathematics and Computation 255, 92-104, 2015
112015
Trend-adaptive multi-scale PCA for data fault detection in IoT networks
TB Dang, MH Tran, DT Le, VV Zalyubovskiy, H Ahn, H Choo
2018 International conference on information networking (ICOIN), 744-749, 2018
102018
Delay-sensitive flooding based on expected path quality in low duty-cycled wireless sensor networks
DT Nguyen, J Choe, TL Duc, DT Le, VV Zalyubovskiy, H Choo
International Journal of Distributed Sensor Networks 12 (8), 1550147716664254, 2016
92016
Maximizing lifetime for a sensor network
AI Erzin, VV Zalyubovskiy, H Choo
Proceedings of the 2nd international conference on Ubiquitous information …, 2008
92008
Break-and-join tree construction for latency-aware data aggregation in wireless sensor networks
TD Nguyen, V Zalyubovskiy, DT Le, H Choo
Wireless Networks 26 (7), 5255-5269, 2020
82020
Convergecast with unbounded number of channels
R Plotnikov, A Erzin, V Zalyubovskiy
arXiv preprint arXiv:1707.05457, 2017
62017
The system can't perform the operation now. Try again later.
Articles 1–20