الگوریتم های سلسله مراتبی چند هدفه برای اتصال به شبکه حسگر بی سیم بازگرداندن در محیط های ناشناخته
|کد مقاله||سال انتشار||مقاله انگلیسی||ترجمه فارسی||تعداد کلمات|
|67609||2015||19 صفحه PDF||سفارش دهید||محاسبه نشده|
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : Ad Hoc Networks, Volume 33, October 2015, Pages 190–208
A Wireless Sensor Network can become partitioned due to node failure, requiring the deployment of additional relay nodes in order to restore network connectivity. This introduces an optimisation problem involving a tradeoff between the number of additional nodes that are required and the costs of moving through the sensor field for the purpose of node placement. This tradeoff is application-dependent, influenced for example by the relative urgency of network restoration. We propose a family of algorithms based on hierarchical objectives including complete algorithms and heuristics which integrate network design with path planning, recognising the impact of obstacles on mobility and communication. We conduct an empirical evaluation of the algorithms on random connectivity and mobility graphs, showing their relative performance in terms of node and path costs, and assessing their execution speeds. Finally, we examine how the relative importance of the two objectives influences the choice of algorithm. In summary, the algorithms which prioritise the node cost tend to find graphs with fewer nodes, while the algorithm which prioritise the cost of moving find slightly larger solutions but with cheaper mobility costs. The heuristic algorithms are close to the optimal algorithms in node cost, and higher in mobility costs. For fast moving agents, the node algorithms are preferred for total restoration time, and for slow agents, the path algorithms are preferred.