Detecting the Most Vital Articulation Points in Wireless Multi-Hop Networks

Basit Öğe Kaydı
dc.contributor.authorAkram, Vahid Khalilpour
dc.contributor.authorUgurlu, Onur
dc.date.accessioned2024-03-09T18:48:34Z
dc.date.available2024-03-09T18:48:34Z
dc.date.issued2023
dc.departmentİzmir Bakırçay Üniversitesien_US
dc.description.abstractAn articulation point is a node whose removal partitions the network into disconnected segments. The articulation points may affect the reliability and efficiency of wireless multi hop networks from different aspects. Although all articulation points destroy the connectivity of the network, their negative impact on the network is not equal. Removing some articulation points may disconnect a large subset of nodes or generate a large number of partitions, while removing some other articulation points may only disconnect a few nodes. In this paper, we present two novel problems for identifying the most vital articulation points that significantly impact the network. The first problem is finding the p most important articulation points that minimize the largest connected component in the remaining network. The second problem is finding the p most important articulation points whose removal maximizes the number of partitions in the network. We prove that both problems are NP-Hard and propose a distributed algorithm to identify the vital articulation points in both problems. The proposed algorithm establishes a distributed depth-first search tree to identify the articulation points, assigns a score to each articulation point, and selects the prominent articulation points based on their scores. We compare the proposed algorithm with a brute force-based exact algorithm. The simulation result shows that after removing the detected prominent articulation points by the proposed algorithm, the maximum difference between the largest partition size and the number of partitions with the optimal solutions are less than 27.6% and 28.2%, respectively, while the sent bytes of the proposed algorithm can be 89.9% lower.en_US
dc.description.sponsorshipScientific and Technological Research Council of Turkey (TUBITAK) [121F092]en_US
dc.description.sponsorshipThis work was supported by the Scientific and Technological Research Council of Turkey (TUBITAK) under Project 121F092en_US
dc.identifier.doi10.1109/TNET.2023.3308142
dc.identifier.endpage2402en_US
dc.identifier.issn1063-6692
dc.identifier.issn1558-2566
dc.identifier.issue5en_US
dc.identifier.scopus2-s2.0-85169708432en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage2389en_US
dc.identifier.urihttps://doi.org/10.1109/TNET.2023.3308142
dc.identifier.urihttps://hdl.handle.net/20.500.14034/1386
dc.identifier.volume31en_US
dc.identifier.wosWOS:001060601900001en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherIeee-Inst Electrical Electronics Engineers Incen_US
dc.relation.ispartofIeee-Acm Transactions on Networkingen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectDistributed Algorithms; Articulation Points; Connected Components; Critical Nodesen_US
dc.titleDetecting the Most Vital Articulation Points in Wireless Multi-Hop Networksen_US
dc.typeArticleen_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim Yok
İsim:
1386.pdf
Boyut:
2.28 MB
Biçim:
Adobe Portable Document Format
İndir

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu