Please use this identifier to cite or link to this item:
https://hdl.handle.net/11499/10708
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Tosun, M. | - |
dc.contributor.author | Haytaoğlu, Elif | - |
dc.contributor.author | Gulec, O. | - |
dc.date.accessioned | 2019-08-16T13:32:32Z | |
dc.date.available | 2019-08-16T13:32:32Z | |
dc.date.issued | 2018 | - |
dc.identifier.isbn | 9781538615010 | - |
dc.identifier.uri | https://hdl.handle.net/11499/10708 | - |
dc.identifier.uri | https://doi.org/10.1109/SIU.2018.8404579 | - |
dc.description.abstract | The connected dominating sets are used as a backbone for unicast and multicast to decrease overall communication traffic and increase the lifetime of wireless sensor networks. When this communication backbone is formed, it is generally desired that the sensors having high energy levels are located on the backbone. However, in this case, the shortest path between two nodes in the bacbone can be much more costly than it is in the original graph. In this work, a new algorithm is proposed for constructing connected dominating sets according to the shortest paths costs and the weight of the nodes. © 2018 IEEE. | en_US |
dc.language.iso | tr | en_US |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Connected dominating sets | en_US |
dc.subject | Dominating sets | en_US |
dc.subject | Routing cost | en_US |
dc.subject | Weighted connected dominating sets | en_US |
dc.subject | Wireless sensor networks | en_US |
dc.subject | Ad hoc networks | en_US |
dc.subject | Graph theory | en_US |
dc.subject | Routing algorithms | en_US |
dc.subject | Sensor nodes | en_US |
dc.subject | Connected Dominating Set | en_US |
dc.subject | Connected dominating set algorithms | en_US |
dc.subject | Routing costs | en_US |
dc.subject | Shortest path | en_US |
dc.subject | Unicast | en_US |
dc.subject | Signal processing | en_US |
dc.title | A minimal weight and routing cost connected dominating set algorithm for wireles sensor networks | en_US |
dc.title.alternative | Telsiz duyarga agları için minimal agırlık ve yönlendirme maliyetli baglı baskın küme algoritması | en_US |
dc.type | Conference Object | en_US |
dc.identifier.startpage | 1 | |
dc.identifier.startpage | 1 | en_US |
dc.identifier.endpage | 4 | en_US |
dc.identifier.doi | 10.1109/SIU.2018.8404579 | - |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.identifier.scopus | 2-s2.0-85050825465 | en_US |
dc.identifier.wos | WOS:000511448500432 | en_US |
dc.owner | Pamukkale University | - |
item.cerifentitytype | Publications | - |
item.languageiso639-1 | tr | - |
item.openairetype | Conference Object | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
crisitem.author.dept | 10.10. Computer Engineering | - |
crisitem.author.dept | 10.10. Computer Engineering | - |
crisitem.author.dept | 08.01. Management Information Systems | - |
Appears in Collections: | Mühendislik Fakültesi Koleksiyonu Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
CORE Recommender
SCOPUSTM
Citations
4
checked on Nov 23, 2024
WEB OF SCIENCETM
Citations
1
checked on Nov 22, 2024
Page view(s)
44
checked on Aug 24, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.