An asynchronous distributed algorithm for minimum s - t cut detection in wireless multi-hop networks

Basit Öğe Kaydı
dc.authorscopusid55750051600
dc.authorwosidAkram, Vahid Khalilpour/ABB-3581-2020
dc.contributor.authorAkram, Vahid Khalilpour
dc.date.accessioned2022-02-15T16:57:17Z
dc.date.available2022-02-15T16:57:17Z
dc.date.issued2020
dc.departmentBakırçay Üniversitesien_US
dc.description.abstractStable communication is a vital and challenging requirement in wireless multi-hop networks because nodes failure may disconnect other active nodes. Minimum s-t cuts can help to measure the reliability of a network regarding the nodes or links failure. A minimum s-t cut is the smallest subset of links that their failure disconnects all communication paths between nodes s and t. Minimum s-t cuts can also reveal the bottlenecks, bridges, and clusters in the network. This paper proposes an asynchronous distributed algorithm for finding minimum s-t cuts in wireless multi-hop networks. The proposed algorithm iteratively finds link-disjoint paths from s to t and changes the direction of the selected edges to ignore them in the next iteration. After finding all paths, the undiscovered nodes in the last search determine the minimum s-t cut. The comprehensive simulation results on different networks with up to 500 nodes show that the proposed algorithm finds minimum s-t cuts in reasonable time with up to 64% and 39% lower energy consumption than the existing central and distributed algorithms, respectively. (C) 2020 Elsevier B.V. All rights reserved.en_US
dc.identifier.doi10.1016/j.adhoc.2020.102092
dc.identifier.issn1570-8705
dc.identifier.issn1570-8713
dc.identifier.scopus2-s2.0-85079907501en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.urihttps://doi.org/10.1016/j.adhoc.2020.102092
dc.identifier.urihttps://hdl.handle.net/20.500.14034/74
dc.identifier.volume101en_US
dc.identifier.wosWOS:000527928800002en_US
dc.identifier.wosqualityQ2en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.institutionauthorAkram, Vahid Khalilpour
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.relation.journalAd Hoc Networksen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectWireless Multi-hop Networksen_US
dc.subjectMinimum s-t Cuten_US
dc.subjectFault Toleranceen_US
dc.subjectAsynchronous Distributed Algorithmsen_US
dc.subjectCut Edgeen_US
dc.subjectSensor Networksen_US
dc.subjectLifetimeen_US
dc.titleAn asynchronous distributed algorithm for minimum s - t cut detection in wireless multi-hop networksen_US
dc.typeArticleen_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim
İsim:
Vahid Khalilpour Akram.pdf
Boyut:
1.92 MB
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
Scopus İndeksli Yayınlar Koleksiyonu