Abstract
Distributed averaging over a large network Is a well studied problem that converges asymptotically; however, existing protocols does not provide a way for each node to distributively detect the occurrence of convergencE. In this paper a method is developed to distributively determine when the consensus has reached within a given error margin. In absence of such a method all nodes in the network keep running the required computation and communication even if the consensus value are within acceptable tolerance, which is not preferable as in large-scale distributed networks resources like power are limited. Furthermore, this extra communication can cause signal interference with other critical information. This distributed detection takes finite time and occurs at each node simultaneously.
| Original language | English (US) |
|---|---|
| Title of host publication | 45th Annual Allerton Conference on Communication, Control, and Computing 2007 |
| Publisher | University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering |
| Pages | 715-720 |
| Number of pages | 6 |
| Volume | 2 |
| ISBN (Electronic) | 9781605600864 |
| State | Published - Jan 1 2007 |
| Event | 45th Annual Allerton Conference on Communication, Control, and Computing 2007 - Monticello, United States Duration: Sep 26 2007 → Sep 28 2007 |
Other
| Other | 45th Annual Allerton Conference on Communication, Control, and Computing 2007 |
|---|---|
| Country/Territory | United States |
| City | Monticello |
| Period | 9/26/07 → 9/28/07 |