Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.14365/1076
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAkcan, Hüseyin-
dc.date.accessioned2023-06-16T12:58:56Z-
dc.date.available2023-06-16T12:58:56Z-
dc.date.issued2013-
dc.identifier.issn1568-4946-
dc.identifier.issn1872-9681-
dc.identifier.urihttps://doi.org/10.1016/j.asoc.2013.01.013-
dc.identifier.urihttps://hdl.handle.net/20.500.14365/1076-
dc.description.abstractTechnological advances in nanotechnology enabled the use of microelectromechanical systems (MEMS) in various application areas. With the integration of various sensor devices into MEMS, autonomously calibrating these sensors become a major research problem. When performing calibration on real-world embedded sensor network deployments, random errors due to internal and external factors alter the calibration parameters and eventually effect the calibration quality in a negative way. Therefore, during autonomous calibration, calibration paths which has low cost and low error values are preferable. To tackle the calibration problem on embedded wireless sensor networks, we present an energy efficient and minimum error calibration model, and also prove that due to random errors the problem turns into an NP-complete problem. To the best of our knowledge this is the first time a formal proof is presented on the complexity of an iterative calibration based problem when random errors are present in the measurements. We also conducted heuristic tests using genetic algorithm to solve the optimization version of the problem, on various graphs. The NP-completeness result also reveals that more research is needed to examine the complexity of calibration in a more general framework in real-world sensor network deployments. (C) 2013 Elsevier B. V. All rights reserved.en_US
dc.language.isoenen_US
dc.publisherElsevier Science Bven_US
dc.relation.ispartofApplıed Soft Computıngen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectNP-completenessen_US
dc.subjectHeuristic algorithmsen_US
dc.subjectEmbedded sensor networksen_US
dc.titleOn the complexity of energy efficient pairwise calibration in embedded sensorsen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.asoc.2013.01.013-
dc.identifier.scopus2-s2.0-84873661977en_US
dc.departmentİzmir Ekonomi Üniversitesien_US
dc.authorscopusid15060111200-
dc.identifier.volume13en_US
dc.identifier.issue4en_US
dc.identifier.startpage1766en_US
dc.identifier.endpage1773en_US
dc.identifier.wosWOS:000316767100019en_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.identifier.scopusqualityQ1-
dc.identifier.wosqualityQ1-
item.grantfulltextopen-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.openairetypeArticle-
item.fulltextWith Fulltext-
item.languageiso639-1en-
crisitem.author.dept05.04. Software Engineering-
Appears in Collections:Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection
Files in This Item:
File SizeFormat 
85.pdf853.05 kBAdobe PDFView/Open
Show simple item record



CORE Recommender

SCOPUSTM   
Citations

8
checked on Sep 25, 2024

WEB OF SCIENCETM
Citations

8
checked on Sep 25, 2024

Page view(s)

66
checked on Sep 30, 2024

Download(s)

22
checked on Sep 30, 2024

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.