Please use this identifier to cite or link to this item: https://hdl.handle.net/11499/46045
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHaytaoglu, Elif-
dc.contributor.authorGüleç, Ömer-
dc.contributor.authorTosun, Mustafa-
dc.date.accessioned2023-01-09T21:08:26Z-
dc.date.available2023-01-09T21:08:26Z-
dc.date.issued2021-
dc.identifier.issn1300-7009-
dc.identifier.issn2147-5881-
dc.identifier.urihttps://doi.org/10.5505/pajes.2020.83030-
dc.identifier.urihttps://search.trdizin.gov.tr/yayin/detay/424261-
dc.identifier.urihttps://hdl.handle.net/11499/46045-
dc.description.abstractWireless sensor networks are utilized in many different areas such as health, agriculture, security, and entertainment. Since the nodes that constitute wireless sensor networks have limited energy resources, many studies have been carried out on use of their resources in an energy efficient manner. These studies generally focused on duty cycle techniques or constructing energy efficient communication backbones. In wireless sensor systems, the connected dominating sets are generally considered to be used as a backbone. In addition, the deployment of the nodes that harvest their own energy in wireless sensor networks has also been considered in recent studies. In this study, a new distributed algorithm is proposed to construct reusable connected dominating set for wireless networks that possess energy harvester nodes and ordinary nodes which could not harvest its energy. Whenever an energy depletion problem in a node or in more than one node occurs, after a specific interval, the proposed algorithm is re-employed on the alive nodes unless wireless sensor network is disconnected. The proposed algorithm was implemented on SensEH simulation environment based on Cooja which is one of the most commonly used tools in the wireless sensor network area. The new algorithm and the rival algorithm in the area are analyzed with respect to the lifetime of the systems together with the time and the energy consumptions required by the algorithms. According to the results, it is observed that the proposed algorithm can double the total lifetime compared to the rival algorithm.en_US
dc.language.isotren_US
dc.publisherPamukkale Univen_US
dc.relation.ispartofPamukkale University Journal Of Engineering Sciences-Pamukkale Universitesi Muhendislik Bilimleri Dergisien_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectWireless sensor networksen_US
dc.subjectConnected dominating seten_US
dc.subjectEnergy harvestingen_US
dc.subjectSystemen_US
dc.titleA new reconstructable distributed connected dominating set algorithm for extending the lifetime of wireless sensor networks including energy harvester nodesen_US
dc.typeArticleen_US
dc.identifier.volume27en_US
dc.identifier.issue2en_US
dc.identifier.startpage173en_US
dc.identifier.endpage186en_US
dc.authoridHaytaoglu, Elif/0000-0002-6341-9701-
dc.identifier.doi10.5505/pajes.2020.83030-
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.authorscopusid#N/A-
dc.authorwosidHaytaoglu, Elif/AAH-6826-2020-
dc.identifier.trdizinid424261en_US
dc.identifier.wosWOS:000637198500008en_US
item.grantfulltextopen-
item.fulltextWith Fulltext-
item.cerifentitytypePublications-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.languageiso639-1tr-
crisitem.author.dept10.10. Computer Engineering-
crisitem.author.dept08.01. Management Information Systems-
crisitem.author.dept10.10. Computer Engineering-
Appears in Collections:Mühendislik Fakültesi Koleksiyonu
TR Dizin İndeksli Yayınlar Koleksiyonu / TR Dizin Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection
Files in This Item:
File SizeFormat 
PAJES-83030-RESEARCH_ARTICLE-HAYTAOGLU.pdf1.49 MBAdobe PDFView/Open
Show simple item record



CORE Recommender

Page view(s)

96
checked on Aug 24, 2024

Download(s)

22
checked on Aug 24, 2024

Google ScholarTM

Check




Altmetric


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