ADA-PC: An asynchronous distributed algorithm for minimizing pairwise connectivity in wireless multi-hop networks

Basit Öğe Kaydı
dc.contributor.authorUgurlu, Onur
dc.date.accessioned2024-03-09T18:48:19Z
dc.date.available2024-03-09T18:48:19Z
dc.date.issued2023
dc.departmentİzmir Bakırçay Üniversitesien_US
dc.description.abstractReliability analysis is of great significance to designing and maintaining wireless multi-hop networks (WMhNs). In WMhNs, several reasons can cause a node to be inoperable, such as hardware failure, software errors, and battery drain. Failure of some critical nodes may partition networks into disconnected segments. The presence of such critical nodes may also reduce the network lifetime since they consume more energy for packet forwarding. Therefore, it is crucial to identify the critical nodes of the networks and strengthen them by adding more nodes surrounding those or creating alternate pathways connecting other nodes to ensure connectivity maintenance in WMhNs. One of the most common approaches in direction is detecting the cut nodes of the networks. However, although finding cut nodes provide helpful information, it may be insufficient for precise reliability analysis since finding cut nodes only does not consider the remaining network. Critical Node Problem (CNP) aims to detect the most important nodes of the network whose removal minimizes the pairwise connectivity (the total number of node pairs connected by at least one path). In other words, the CNP tries to identify a set of nodes whose absence partitions the network into several disconnected segments of similar size. Detecting critical nodes for pairwise connectivity reveals the weak points and bottlenecks of the networks and may help to increase the fault tolerance and lifetime of WMhNs. This paper proposes an Asynchronous Distributed Algorithm for minimizing Pairwise Connectivity (ADA-PC) in WMhNs. To the best of our knowledge, this is the first distributed algorithm for the targeted problem in the network literature. The proposed algorithm uses a distributed Breadth-First Search (BFS) tree which limits bit complexity to O(n.m.log2n) and space complexity to O(d), where d is the network's diameter. The experimental study on both testbed experiment and simulation reveals that the proposed algorithm is capable of finding the most critical nodes with up to 60% lower sent bytes than the existing central algorithms.en_US
dc.description.sponsorshipTUBITAK (Scientific and Tech-nical Research Council of Turkey) [121F092]en_US
dc.description.sponsorshipAcknowledgments This research was supported by the TUBITAK (Scientific and Tech-nical Research Council of Turkey) [Project number 121F092] . The author would like to thank the anonymous reviewers for their valuable suggestions to improve the quality of the paper.en_US
dc.identifier.doi10.1016/j.comnet.2023.109703
dc.identifier.issn1389-1286
dc.identifier.issn1872-7069
dc.identifier.scopus2-s2.0-85150299113en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.urihttps://doi.org/10.1016/j.comnet.2023.109703
dc.identifier.urihttps://hdl.handle.net/20.500.14034/1294
dc.identifier.volume227en_US
dc.identifier.wosWOS:000956477400001en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.relation.ispartofComputer Networksen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectMulti-Hop Networks; Reliability Analysis; Distributed Algorithms; Pairwise Connectivity; Critical Nodesen_US
dc.titleADA-PC: An asynchronous distributed algorithm for minimizing pairwise connectivity in wireless multi-hop networksen_US
dc.typeArticleen_US

Dosyalar

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

Koleksiyon

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