Max-Consensus with Deterministic Convergence in Directed Graphs with Unreliable Communication Links
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910048225067008 |
|---|---|
| author | Rikos, Apostolos I. Hu, Jiaqi Charalambous, Themistoklis Johannson, Karl Henrik |
| author_facet | Rikos, Apostolos I. Hu, Jiaqi Charalambous, Themistoklis Johannson, Karl Henrik |
| contents | We present DMaC, a novel distributed, finite-time algorithm that guarantees max-consensus in directed networks with unreliable communication links experiencing packet drops. Unlike existing methods, DMaC ensures all nodes compute the exact maximum state under arbitrary packet loss patterns. It incorporates a fully distributed termination mechanism, enabling nodes to autonomously determine whether convergence has occurred. Our algorithm leverages narrowband error-free feedback channels to acknowledge successful (single-bit) transmissions with minimal communication overhead. We analyze our algorithm's operation, and we provide a convergence proof establishing explicit bounds on the required time steps. We validate its correctness in a wireless sensor network for environmental monitoring, and finally, we compare against existing approaches highlighting our algorithm's operational advantages. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_18719 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Max-Consensus with Deterministic Convergence in Directed Graphs with Unreliable Communication Links Rikos, Apostolos I. Hu, Jiaqi Charalambous, Themistoklis Johannson, Karl Henrik Systems and Control We present DMaC, a novel distributed, finite-time algorithm that guarantees max-consensus in directed networks with unreliable communication links experiencing packet drops. Unlike existing methods, DMaC ensures all nodes compute the exact maximum state under arbitrary packet loss patterns. It incorporates a fully distributed termination mechanism, enabling nodes to autonomously determine whether convergence has occurred. Our algorithm leverages narrowband error-free feedback channels to acknowledge successful (single-bit) transmissions with minimal communication overhead. We analyze our algorithm's operation, and we provide a convergence proof establishing explicit bounds on the required time steps. We validate its correctness in a wireless sensor network for environmental monitoring, and finally, we compare against existing approaches highlighting our algorithm's operational advantages. |
| title | Max-Consensus with Deterministic Convergence in Directed Graphs with Unreliable Communication Links |
| topic | Systems and Control |
| url | https://arxiv.org/abs/2402.18719 |