Please use this identifier to cite or link to this item: https://hdl.handle.net/11147/14187
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAl-Qamaji, A.-
dc.contributor.authorAtakan, B.-
dc.date.accessioned2024-01-06T07:22:33Z-
dc.date.available2024-01-06T07:22:33Z-
dc.date.issued2022-
dc.identifier.issn0929-6212-
dc.identifier.urihttps://doi.org/10.1007/s11277-021-09316-z-
dc.identifier.urihttps://hdl.handle.net/11147/14187-
dc.description.abstractWireless sensor networks (WSNs) consist of compact deployed sensor nodes which collectively report their sensed readings about an event to the Base Station (BS). In WSNs, due to the dense deployment, sensor readings can be spatially correlated and it is nonessential to transmit all their readings to the BS. Therefore, for more energy efficient, it is vital to choose which sensor node should report their sensed readings to the BS. In this paper, the event distortion-based clustering (EDC) algorithm is proposed for the spatially correlated sensor nodes. Here, the sensor nodes are assumed to harvest energy from ambient electromagnetic radiation source. The EDC algorithm allows the energy-harvesting sensor nodes to select and eliminate nonessential nodes while maintain an acceptable level of distortion at the BS. To measure the reliability, a theoretical framework of the distortion function is first derived for both single-hop and two-hop communication scenarios. Then, based on the derived theoretical framework, the EDC algorithm is introduced. Through extensive simulations, the performance of the EDC algorithm is evaluated in terms of achievable distortion level, number of alive nodes and harvested energy levels. As a result, EDC algorithm can successfully exploit both the spatial correlation and energy harvesting to improve the energy efficiency while preserving an acceptable level of distortion. Furthermore, the performance comparisons reveal that the two-hop communication model outperforms the single-hop model in terms of the distortion and energy-efficiency. © 2021, The Author(s).en_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.relation.ispartofWireless Personal Communicationsen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectClusteringen_US
dc.subjectDistortionen_US
dc.subjectEnergy-efficienten_US
dc.subjectSpatial correlationen_US
dc.subjectWireless sensor networks (WSNs)en_US
dc.subjectElectromagnetic wavesen_US
dc.subjectEnergy efficiencyen_US
dc.subjectEnergy harvestingen_US
dc.subjectSensor nodesen_US
dc.subjectAmbientsen_US
dc.subjectBased clusteringen_US
dc.subjectClusteringsen_US
dc.subjectEnergyen_US
dc.subjectEnergy efficienten_US
dc.subjectSensor readingsen_US
dc.subjectSingle hopen_US
dc.subjectSpatial correlationsen_US
dc.subjectTheoretical frameworken_US
dc.subjectWireless sensor networken_US
dc.subjectClustering algorithmsen_US
dc.titleEvent Distortion-Based Clustering Algorithm for Energy Harvesting Wireless Sensor Networksen_US
dc.typeArticleen_US
dc.institutionauthor-
dc.departmentİzmir Institute of Technologyen_US
dc.identifier.volume123en_US
dc.identifier.issue4en_US
dc.identifier.startpage3823en_US
dc.identifier.endpage3843en_US
dc.identifier.scopus2-s2.0-85118620029en_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.identifier.doi10.1007/s11277-021-09316-z-
dc.authorscopusid57195214534-
dc.authorscopusid35617210000-
dc.identifier.wosqualityQ3-
dc.identifier.scopusqualityQ2-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.languageiso639-1en-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.openairetypeArticle-
crisitem.author.dept03.05. Department of Electrical and Electronics Engineering-
Appears in Collections:Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
Show simple item record



CORE Recommender

SCOPUSTM   
Citations

4
checked on Nov 15, 2024

Page view(s)

126
checked on Nov 18, 2024

Google ScholarTM

Check




Altmetric


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