Distributed Detection Over Adaptive Networks: Refined Asymptotics and the Role of Connectivity

被引:32
作者
Matta, Vincenzo [1 ]
Braca, Paolo [2 ]
Marano, Stefano [1 ]
Sayed, Ali H. [3 ]
机构
[1] Univ Salerno, Dept Informat & Elect Engn & Appl Math, I-84084 Fisciano, SA, Italy
[2] NATO STO Ctr Maritime Res & Expt, I-19126 La Spezia, Italy
[3] Univ Calif Los Angeles, Dept Elect Engn, Los Angeles, CA 90095 USA
来源
IEEE TRANSACTIONS ON SIGNAL AND INFORMATION PROCESSING OVER NETWORKS | 2016年 / 2卷 / 04期
基金
美国国家科学基金会;
关键词
Distributed detection; adaptive network; diffusion strategy; large deviations analysis; exact asymptotics; WIRELESS SENSOR NETWORKS; DECENTRALIZED DETECTION; GOSSIP ALGORITHMS; MULTIPLE SENSORS; CONSENSUS; DEVIATIONS; OPTIMIZATION; PERFORMANCE; STRATEGIES; SIGNAL;
D O I
10.1109/TSIPN.2016.2613682
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We consider distributed detection problems over adaptive networks, where dispersed agents learn continually from streaming data by means of local interactions. The requirement of adaptation allows the network of detectors to track drifts in the underlying hypothesis. The requirement of cooperation allows each agent to deliver a performance superior to what would be obtained if it were acting individually. The simultaneous requirements of adaptation and cooperation are achieved by employing diffusion algorithms with constant step-size mu. By conducting a refined asymptotic analysis based on the mathematical framework of exact asymptotics, we arrive at a revealing understanding of the universal behavior of distributed detection over adaptive networks: as functions of 1/mu, the error (log-) probability curves corresponding to different agents stay nearly-parallel to each other (as already discovered in [1] and [2]), however, these curves are ordered following a criterion reflecting the degree of connectivity of each agent. Depending on the combination weights, the more connected an agent is, the lower its error probability curve will be. The analysis provides explicit analytical formulas for the detection error probabilities and these expressions are also verified by means of extensive simulations. We further enlarge the reference setting from the case of doubly-stochastic combination matrices considered in [1] and [2] to the more general and demanding setting of right-stochastic combination matrices; this extension poses new and interesting questions in terms of the interplay between the network topology, the combination weights, and the inference performance. The potential of the proposed methods is illustrated by application of the results to canonical detection problems, to typical network topologies, for both doubly-stochastic and right-stochastic combination matrices. Interesting and somehow unexpected behaviors emerge, and the lesson learned is that connectivity matters.
引用
收藏
页码:442 / 460
页数:19
相关论文
共 47 条
[21]  
Den Hollander Frank, 2008, Large Deviations, V14
[22]   Gossip Algorithms for Distributed Signal Processing [J].
Dimakis, Alexandros G. ;
Kar, Soummya ;
Moura, Jose M. F. ;
Rabbat, Michael G. ;
Scaglione, Anna .
PROCEEDINGS OF THE IEEE, 2010, 98 (11) :1847-1864
[23]  
Feller William., 1971, An introduction to probability and its applications, Vii
[24]  
Horn R.A., 1986, Matrix Analysis
[25]   Distributed Detection Over Noisy Networks: Large Deviations Analysis [J].
Jakovetic, Dusan ;
Moura, Jose M. F. ;
Xavier, Joao .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2012, 60 (08) :4306-4320
[26]   Convergence Rate Analysis of Distributed Gossip (Linear Parameter) Estimation: Fundamental Limits and Tradeoffs [J].
Kar, Soummya ;
Moura, Jose M. F. .
IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 2011, 5 (04) :674-690
[27]  
Kassam S.A., 1987, Signal Detection in Non-Gaussian Noise, V1
[28]  
Liu K, 2004, 2004 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOL III, PROCEEDINGS, P873
[29]   QUANTIZATION FOR DECENTRALIZED HYPOTHESIS-TESTING UNDER COMMUNICATION CONSTRAINTS [J].
LONGO, M ;
LOOKABAUGH, TD ;
GRAY, RM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (02) :241-255
[30]   Diffusion least-mean squares over adaptive networks: Formulation and performance analysis [J].
Lopes, Cassio G. ;
Sayed, Ali H. .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2008, 56 (07) :3122-3136