2012
DOI: 10.1109/tsp.2012.2192928
|View full text |Cite
|
Sign up to set email alerts
|

Diffusion Adaptation Over Networks Under Imperfect Information Exchange and Non-Stationary Data

Abstract: Adaptive networks rely on in-network and collaborative processing among distributed agents to deliver enhanced performance in estimation and inference tasks. Information is exchanged among the nodes, usually over noisy links. The combination weights that are used by the nodes to fuse information from their neighbors play a critical role in influencing the adaptation and tracking abilities of the network. This paper first investigates the mean-square performance of general adaptive diffusion algorithms in the p… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
153
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 167 publications
(153 citation statements)
references
References 53 publications
0
153
0
Order By: Relevance
“…In addition, the upper bound P u also depends on the value of α used to update the belief in (39). We observe that the larger the value of α, the smaller the values of the error probabilities.…”
Section: Theorem 3 Under Assumptions 3-5 and In The Far-field Regimementioning
confidence: 89%
See 3 more Smart Citations
“…In addition, the upper bound P u also depends on the value of α used to update the belief in (39). We observe that the larger the value of α, the smaller the values of the error probabilities.…”
Section: Theorem 3 Under Assumptions 3-5 and In The Far-field Regimementioning
confidence: 89%
“…It is clear that the success of the diffusion strategy and decision-making process depends on the reliability of the classification scheme in (33) and (39). In this section, we examine the probability of error for the classification scheme under some simplifying conditions to facilitate the analysis.…”
Section: Performance Of Classification Proceduresmentioning
confidence: 99%
See 2 more Smart Citations
“…Motivated by [14], we assume a time-varying w 0 of length 6 as follows: . The unknown link is assume to change at time 6000.…”
Section: B) In Non-stationary Environmentmentioning
confidence: 99%