Please use this identifier to cite or link to this item: https://hdl.handle.net/11147/2606
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDağdeviren, Orhan-
dc.contributor.authorErciyeş, Kayhan-
dc.date.accessioned2016-12-12T13:01:38Z-
dc.date.available2016-12-12T13:01:38Z-
dc.date.issued2010-12-
dc.identifier.citationDağdeviren, O., and Erciyeş, K. (2010). Graph matching-based distributed clustering and backbone formation algorithms for sensor networks. Computer Journal, 53(10), 1553-1575. doi:10.1093/comjnl/bxq004en_US
dc.identifier.issn0010-4620-
dc.identifier.urihttp://doi.org/10.1093/comjnl/bxq004-
dc.identifier.urihttp://hdl.handle.net/11147/2606-
dc.description.abstractClustering is a widely used technique to manage the essential operations such as routing and data aggregation in wireless sensor networks (WSNs). We propose two new graph-theoretic distributed clustering algorithms for WSNs that use a weighted matching method for selecting strong links. To the best of our knowledge, our algorithms are the first attempts that use graph matching for clustering. The first algorithm is divided into rounds; extended weighted matching operation is executed by nodes in each round; thus the clusters are constructed synchronously. The second algorithm is the enhanced version of the first algorithm, which provides not only clustering but also backbone formation in an energy-efficient and asynchronous manner. We show the operation of the algorithms, analyze them, provide the simulation results in an ns2 environment. We compare our proposed algorithms with the other graph-theoretic clustering algorithms and show that our algorithms select strong communication links and create a controllable number of balanced clusters while providing low-energy consumptions. We also discuss possible applications that may use the structure provided by these algorithms and the extensions to the algorithms. © The Author 2009. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved.en_US
dc.language.isoenen_US
dc.publisherOxford University Pressen_US
dc.relation.ispartofComputer Journalen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectClustering algorithmsen_US
dc.subjectBackbone formationen_US
dc.subjectGraph matchingsen_US
dc.subjectSensor networksen_US
dc.subjectWeighted matchingen_US
dc.titleGraph matching-based distributed clustering and backbone formation algorithms for sensor networksen_US
dc.typeArticleen_US
dc.authoridTR15997en_US
dc.institutionauthorDağdeviren, Orhan-
dc.departmentIzmir Institute of Technology. Computer Engineeringen_US
dc.identifier.volume53en_US
dc.identifier.issue10en_US
dc.identifier.startpage1553en_US
dc.identifier.endpage1575en_US
dc.identifier.wosWOS:000284954700002en_US
dc.identifier.scopus2-s2.0-78649858718en_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.identifier.doi10.1093/comjnl/bxq004-
dc.relation.doi10.1093/comjnl/bxq004en_US
dc.coverage.doi10.1093/comjnl/bxq004en_US
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.languageiso639-1en-
item.fulltextWith Fulltext-
item.grantfulltextopen-
item.cerifentitytypePublications-
crisitem.author.dept03.04. Department of Computer Engineering-
Appears in Collections:Computer Engineering / Bilgisayar Mühendisliği
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
Sürdürülebilir Yeşil Kampüs Koleksiyonu / Sustainable Green Campus Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection
Files in This Item:
File Description SizeFormat 
2606.pdfMakale1.38 MBAdobe PDFThumbnail
View/Open
Show simple item record

CORE Recommender

SCOPUSTM   
Citations

15
checked on Dec 11, 2021

WEB OF SCIENCETM
Citations

12
checked on Jan 15, 2022

Page view(s)

32
checked on Jan 17, 2022

Download(s)

88
checked on Jan 17, 2022

Google ScholarTM

Check

Altmetric


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