دانلود مقاله ISI انگلیسی شماره 146980
ترجمه فارسی عنوان مقاله

پوشش تقاضا: یک الگوریتم کنترل حرکت ساده برای شبکه های سنسور روباتیک مستقل

عنوان انگلیسی
Coverage on demand: A simple motion control algorithm for autonomous robotic sensor networks
کد مقاله سال انتشار تعداد صفحات مقاله انگلیسی
146980 2018 24 صفحه PDF
منبع

Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)

Journal : Computer Networks, Volume 135, 22 April 2018, Pages 190-200

ترجمه کلمات کلیدی
شبکه های حسگر روباتیک، کنترل حرکت، الگوریتم مستقل، پوشش در تقاضا،
کلمات کلیدی انگلیسی
Robotic sensor networks; Motion control; Autonomous algorithm; Coverage on demand;
پیش نمایش مقاله
پیش نمایش مقاله  پوشش تقاضا: یک الگوریتم کنترل حرکت ساده برای شبکه های سنسور روباتیک مستقل

چکیده انگلیسی

Autonomous robotic sensor networks are composed by robotic sensors that can move, sense and communicate with each other in a cooperative way, and therefore are more powerful than static sensor networks. In robotic sensor networks, an important problem is motion control: how each sensor can autonomously move to the desirable location for better network coverage over targets. In this paper, we study a new motion control problem that has the following critical requirements: (i) All targets in the area of interest should be covered by sensors; (ii) The number of sensors that cover one target depends on the target's importance, i.e., more important targets should be covered by more sensors; (iii) The robotic sensors are kept connected, i.e., each sensor has at least one route to any other sensor in the network; (iv) Proper distance between every two neighboring sensors is maintained to avoid coverage overlap and possible collision. As a solution to this problem, we propose a simple motion control algorithm that operates in a pure autonomous manner. The proposed algorithm models the coverage demand into virtual force field, and hence each sensor can simply obey the effect of force field onto it to move. We demonstrate by extensive simulations that the proposed algorithm is very effective and is applicable to large-scale networks.