Abstract
In this paper, we address the problem of estimating the maximal value over a sensor network using wireless links between them. We introduce two heuristic algorithms and analyze their theoretical performance. More precisely, i) we prove that their convergence time is finite with probability one, ii) we derive an upper-bound on their mean convergence time, and iii) we exhibit a bound on their convergence time dispersion.
| Original language | English |
|---|---|
| Article number | 6259916 |
| Pages (from-to) | 6103-6107 |
| Number of pages | 5 |
| Journal | IEEE Transactions on Signal Processing |
| Volume | 60 |
| Issue number | 11 |
| DOIs | |
| Publication status | Published - 22 Oct 2012 |
Keywords
- Consensus
- distributed algorithms
- gossip
- wireless sensor networks
Fingerprint
Dive into the research topics of 'Analysis of max-consensus algorithms in wireless channels'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver