Akram, Vahid Khalilpour2022-02-152022-02-1520201570-87051570-8713https://doi.org/10.1016/j.adhoc.2020.102092https://hdl.handle.net/20.500.14034/74Stable 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.eninfo:eu-repo/semantics/closedAccessWireless Multi-hop NetworksMinimum s-t CutFault ToleranceAsynchronous Distributed AlgorithmsCut EdgeSensor NetworksLifetimeArticle10.1016/j.adhoc.2020.102092101Q2WOS:0005279288000022-s2.0-85079907501Q1