Name
Abstract | ||
|---|---|---|
This paper presents a family of discrete-time distributed algorithms that enable nodes in an undirected, connected network to solve, in a fully decentralized fashion, a system of modular congruences whose residues and pairwise coprime moduli are locally known to the nodes. We show that each algorithm in the family is able to determine, in finite time, the congruence class of solutions whose existence and uniqueness is guaranteed by the Chinese remainder theorem. We also describe and analyze three specific algorithms from the family called Synchronous Updating (SU), Pairwise Equalizing (PE), and Groupwise Equalizing (GE), relating the convergence rate of SU to the network diameter and those of PE and GE to their asynchronous update patterns. Finally, we provide simulation results that illustrate their effectiveness. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.23919/ACC45564.2020.9147597 | 2020 AMERICAN CONTROL CONFERENCE (ACC) |
DocType | ISSN | Citations |
Conference | 0743-1619 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiang Li | 1 | 0 | 0.34 |
| Choon Yik Tang | 2 | 85 | 12.90 |