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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Ad hoc networks Jg. 101; S. 102092
1. Verfasser:	Akram, Vahid Khalilpour
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 15.04.2020
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!