Parallel identification of central nodes in wireless multi-hop networks

Basit Öğe Kaydı
dc.authorscopusid14521079300
dc.authorscopusid55612037400
dc.authorscopusid55750051600
dc.authorscopusid55335002500
dc.contributor.authorEliiyi, Deniz Türsel
dc.contributor.authorArslan, Hilal
dc.contributor.authorAkram, Vahid Khalilpour
dc.contributor.authorUğurlu, Onur
dc.date.accessioned2022-02-15T16:57:38Z
dc.date.available2022-02-15T16:57:38Z
dc.date.issued2020
dc.departmentBakırçay Üniversitesien_US
dc.description28th Signal Processing and Communications Applications Conference (SIU) -- OCT 05-07, 2020 -- ELECTR NETWORKen_US
dc.description.abstractA wireless multi-hop network is a collection of nodes that communicate by message passing over multiple links. Sending a message to a remote node can consume some energy from all intermediary nodes. In a network, the nodes with minimum distance to all other nodes are called Jordan central nodes. Selecting the central nodes as sink or base station can considerably reduce the overall energy consumption and increase the network life time. This paper proposes a new parallel algorithm to find all central nodes of a network by finding BFS trees of a subset of nodes. The roots of the trees with smallest height are selected as Jordan central nodes. After finding each tree the algorithm eliminates some nodes from the search space. Available processors construct the BFS tree for different nodes in parallel and eliminate a group of unvisited nodes after creating each tree. The implementation results of the algorithm using different number of processors on topologies with up to 250 nodes showed that the proposed algorithm can find all central nodes by examining less than 20% of nodes in less than 0.034 seconds.en_US
dc.description.sponsorshipIstanbul Medipol Univen_US
dc.identifier.isbn978-1-7281-7206-4
dc.identifier.issn2165-0608
dc.identifier.scopus2-s2.0-85100303957en_US
dc.identifier.scopusqualityN/Aen_US
dc.identifier.urihttps://hdl.handle.net/20.500.14034/230
dc.identifier.urihttps://doi.org/10.1109/SIU49456.2020.9302248
dc.identifier.wosWOS:000653136100222en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isotren_US
dc.publisherIEEEen_US
dc.relation.journal2020 28Th Signal Processing And Communications Applications Conference (Siu)en_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectWireless Multi-hop Networken_US
dc.subjectNetwork Centralityen_US
dc.subjectBreadth First Searchen_US
dc.subjectParallel Computingen_US
dc.titleParallel identification of central nodes in wireless multi-hop networksen_US
dc.typeConference Objecten_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim Yok
İsim:
Parallel_Identification_of_Central_Nodes_in_Wireless_Multi-hop_Networks.pdf
Boyut:
898.95 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Tam Metin / Full Text
İndir

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Bilgisayar Mühendisliği Bölümü Koleksiyonu
Endüstri Mühendisliği Bölümü Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu
Temel Bilimler Bölümü Bölümü Koleksiyonu