An Asynchronous Distributed Algorithm for Minimum s−t Cut Detection in Wireless Multi-hop Networks

Stable 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 link...

Full description

Bibliographic Details

Published in:	Ad hoc networks Vol. 101; p. 102092
Main Author:	Akram, Vahid Khalilpour
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 15.04.2020
Subjects:	Asynchronous Distributed Algorithms Cut Edge Fault Tolerance Minimum s-t Cut Wireless Multi-hop Networks Minimum s-t Cut Asynchronous Distributed Algorithms Cut Edge Wireless Multi-hop Networks Fault Tolerance
ISSN:	1570-8705, 1570-8713
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!