A Genetic Algorithm Based Solution To the Minimum-Cost Bounded-Error Calibration Tree Problem
Loading...
Files
Date
2018
Authors
Akcan, Hüseyin
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier Science Bv
Open Access Color
Green Open Access
No
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
Abstract
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. (C) 2018 Elsevier B.V. All rights reserved.
Description
Keywords
Genetic algorithm, Wireless sensor networks, Energy efficiency, Calibration tree
Fields of Science
0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology
Citation
WoS Q
Q1
Scopus Q
Q1

OpenCitations Citation Count
6
Source
Applıed Soft Computıng
Volume
73
Issue
Start Page
83
End Page
95
PlumX Metrics
Citations
CrossRef : 2
Scopus : 6
Captures
Mendeley Readers : 8
SCOPUS™ Citations
6
checked on Feb 20, 2026
Web of Science™ Citations
6
checked on Feb 20, 2026
Page Views
2
checked on Feb 20, 2026
Google Scholar™

OpenAlex FWCI
1.48659554
Sustainable Development Goals
7
AFFORDABLE AND CLEAN ENERGY


