کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
10139433 1645964 2018 13 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A genetic algorithm based solution to the Minimum-Cost Bounded-Error Calibration Tree problem
ترجمه فارسی عنوان
یک راه حل مبتنی بر الگوریتم ژنتیک برای مشکل کمبود هزینه محدودیت خطا درخت درخت
کلمات کلیدی
الگوریتم ژنتیک، شبکه های حسگر بی سیم، بهره وری انرژی، درخت کالیبراسیون،
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نرم افزارهای علوم کامپیوتر
چکیده انگلیسی
Sensors in wireless sensor networks are required to be self-calibrated periodically during their prolonged deployment periods. In calibration planning, employing intelligent algorithms are essential to optimize both the efficiency and the accuracy of calibration. The Minimum-Cost Bounded-Error Calibration Tree (MBCT) problem is a spanning tree problem with two objectives, minimizing the spanning tree cost and bounding the maximum post-calibration skew. The decision version of the MBCT problem is proven to be NP-Complete. In this paper, the GAWES algorithm is presented as a novel genetic algorithm based solution to the optimization version of the MBCT problem. GAWES adopts extreme efficient solution generation within the genetic algorithm to improve the search quality. It is demonstrated through experimentation that GAWES is superior to the existing state of the art algorithm, both in energy efficiency and calibration accuracy.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Soft Computing - Volume 73, December 2018, Pages 83-95
نویسندگان
,