Gossip Algorithms for Distributed Signal Processing

Gossip algorithms are attractive for in-network processing in sensor networks because they do not require any specialized routing, there is no bottleneck or single point of failure, and they are robust to unreliable wireless network conditions. Recently, there has been a surge of activity in the com...

Full description

Saved in:
Bibliographic Details
Published inProceedings of the IEEE Vol. 98; no. 11; pp. 1847 - 1864
Main Authors Dimakis, Alexandros G., Kar, Soummya, Moura, José M. F., Rabbat, Michael G., Scaglione, Anna
Format Journal Article
LanguageEnglish
Published New York IEEE 01.11.2010
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text
ISSN0018-9219
1558-2256
DOI10.1109/JPROC.2010.2052531

Cover

Abstract Gossip algorithms are attractive for in-network processing in sensor networks because they do not require any specialized routing, there is no bottleneck or single point of failure, and they are robust to unreliable wireless network conditions. Recently, there has been a surge of activity in the computer science, control, signal processing, and information theory communities, developing faster and more robust gossip algorithms and deriving theoretical performance guarantees. This paper presents an overview of recent work in the area. We describe convergence rate results, which are related to the number of transmitted messages and thus the amount of energy consumed in the network for gossiping. We discuss issues related to gossiping over wireless links, including the effects of quantization and noise, and we illustrate the use of gossip algorithms for canonical signal processing tasks including distributed estimation, source localization, and compression.
AbstractList Gossip algorithms are attractive for in-network processing in sensor networks because they do not require any specialized routing, there is no bottleneck or single point of failure, and they are robust to unreliable wireless network conditions. Recently, there has been a surge of activity in the computer science, control, signal processing, and information theory communities, developing faster and more robust gossip algorithms and deriving theoretical performance guarantees. This paper presents an overview of recent work in the area. We describe convergence rate results, which are related to the number of transmitted messages and thus the amount of energy consumed in the network for gossiping. We discuss issues related to gossiping over wireless links, including the effects of quantization and noise, and we illustrate the use of gossip algorithms for canonical signal processing tasks including distributed estimation, source localization, and compression.
Author Dimakis, Alexandros G.
Kar, Soummya
Scaglione, Anna
Moura, José M. F.
Rabbat, Michael G.
Author_xml – sequence: 1
  givenname: Alexandros G.
  surname: Dimakis
  fullname: Dimakis, Alexandros G.
  email: dimakis@usc.edu
  organization: Department of Electrical and Computer Engineering, University of Southern California, Los Angeles, CA, USA
– sequence: 2
  givenname: Soummya
  surname: Kar
  fullname: Kar, Soummya
  email: soummyak@andrew.cmu.edu
  organization: Princeton University, Princeton, USA
– sequence: 3
  givenname: José M. F.
  surname: Moura
  fullname: Moura, José M. F.
  email: moura@ece.cmu.edu
  organization: Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA, USA
– sequence: 4
  givenname: Michael G.
  surname: Rabbat
  fullname: Rabbat, Michael G.
  email: michael.rabbat@mcgill.ca
  organization: Department of Electrical and Computer Engineering, McGill University , Montréal, Canada
– sequence: 5
  givenname: Anna
  surname: Scaglione
  fullname: Scaglione, Anna
  email: ascaglione@ucdavis.edu
  organization: Department of Electrical and Computer Engineering, University of California at Davis, Davis, CA, USA
BookMark eNp9kD9PwzAQxS1UJNrCF4AlEgNTiu2zE2esChRQpVb8maPEsYurNC62M_DtcSli6MB0Oun37t57IzTobKcQuiR4Qggubp9XL8vZhOK4U8wpB3KChoRzkVLKswEaYkxEWlBSnKGR9xuMMfAMhgjm1nuzS6bt2joTPrY-0dYld8YHZ-o-qCZ5NeuuapOVs1JFtlufo1NdtV5d_M4xen-4f5s9povl_Gk2XaQSCggpUE11IYosY5XWUHOtKWTQ5Iw00aJWdVZIDHkumcwbJYiGHHMhcc2AkorDGN0c7u6c_eyVD-XWeKnatuqU7X0pgJCMECoieX1EbmzvomtfEgyYMEZZESl6oKSLoZ3S5c6ZbeW-IlTuayx_aiz3NZa_NUaROBJJE6pgbBdcZdr_pVcHqVFK_f3inPEYFL4B4gCAMA
CODEN IEEPAD
CitedBy_id crossref_primary_10_1155_2015_706083
crossref_primary_10_1109_TAC_2020_2989266
crossref_primary_10_1109_LSP_2016_2587327
crossref_primary_10_1109_TSMC_2022_3212429
crossref_primary_10_1109_TSP_2016_2617827
crossref_primary_10_1109_TIT_2022_3211078
crossref_primary_10_1016_j_artint_2024_104094
crossref_primary_10_1109_TSP_2019_2910485
crossref_primary_10_1109_TSIPN_2022_3188450
crossref_primary_10_1121_10_0004795
crossref_primary_10_1109_TSP_2018_2875883
crossref_primary_10_1016_j_automatica_2019_03_004
crossref_primary_10_1109_TIT_2011_2177753
crossref_primary_10_1109_TCOMM_2013_012913_110717
crossref_primary_10_1109_TII_2012_2187911
crossref_primary_10_1155_2014_189619
crossref_primary_10_1155_2015_494687
crossref_primary_10_1109_ACCESS_2018_2872719
crossref_primary_10_1080_00207179_2017_1387288
crossref_primary_10_1109_TSP_2015_2394300
crossref_primary_10_1109_JSTSP_2014_2364545
crossref_primary_10_1002_acs_2569
crossref_primary_10_1109_LSP_2022_3210870
crossref_primary_10_1109_TSP_2015_2416671
crossref_primary_10_1016_j_comcom_2014_07_013
crossref_primary_10_1186_s13634_018_0589_x
crossref_primary_10_1109_TIT_2019_2947494
crossref_primary_10_1109_TMC_2019_2954126
crossref_primary_10_1109_MSP_2011_940399
crossref_primary_10_1109_OJSP_2020_3036276
crossref_primary_10_1109_TSP_2012_2192928
crossref_primary_10_1109_TSP_2018_2875898
crossref_primary_10_1109_TSP_2012_2198470
crossref_primary_10_1016_j_automatica_2024_111522
crossref_primary_10_1016_j_neucom_2013_01_013
crossref_primary_10_1109_TSIPN_2016_2613682
crossref_primary_10_1109_JOE_2022_3149340
crossref_primary_10_1109_TSIPN_2017_2695121
crossref_primary_10_1109_TSP_2024_3394659
crossref_primary_10_1109_TSIPN_2018_2806841
crossref_primary_10_1109_TSP_2013_2239992
crossref_primary_10_1109_LSP_2018_2889267
crossref_primary_10_1109_TIT_2021_3121752
crossref_primary_10_1109_JSTSP_2011_2114635
crossref_primary_10_1109_TSIPN_2016_2614898
crossref_primary_10_1371_journal_pone_0112612
crossref_primary_10_3182_20110828_6_IT_1002_00576
crossref_primary_10_1109_TSP_2012_2230167
crossref_primary_10_1109_TAC_2021_3130877
crossref_primary_10_1109_OJSP_2022_3141965
crossref_primary_10_1109_TSP_2017_2666771
crossref_primary_10_1109_OJSP_2022_3141968
crossref_primary_10_1109_OJSP_2023_3344052
crossref_primary_10_1109_LSP_2020_2988421
crossref_primary_10_1109_TSP_2018_2872003
crossref_primary_10_1109_MSP_2012_2235193
crossref_primary_10_1109_TIT_2018_2837050
crossref_primary_10_1109_TAC_2016_2599274
crossref_primary_10_3390_s20216153
crossref_primary_10_1016_j_dsp_2024_104920
crossref_primary_10_1109_TSP_2016_2601282
crossref_primary_10_1109_TSIPN_2019_2942192
crossref_primary_10_1109_JPROC_2018_2846568
crossref_primary_10_1109_TSP_2014_2367468
crossref_primary_10_1016_j_inffus_2015_11_008
crossref_primary_10_1109_TSP_2013_2248003
crossref_primary_10_1109_TIT_2014_2331272
crossref_primary_10_1109_TIT_2016_2514502
crossref_primary_10_1109_TIT_2015_2427352
crossref_primary_10_1002_asjc_1586
crossref_primary_10_1109_TIT_2019_2945033
crossref_primary_10_1109_ACCESS_2020_2965210
crossref_primary_10_1109_TIT_2013_2252233
crossref_primary_10_1109_TIT_2017_2710059
crossref_primary_10_1007_s40747_016_0028_2
crossref_primary_10_1137_120875843
crossref_primary_10_1109_TSIPN_2015_2511920
crossref_primary_10_1109_TIT_2015_2427360
crossref_primary_10_1109_TSP_2011_2157147
crossref_primary_10_1109_JSTSP_2011_2124440
crossref_primary_10_1145_2530000
crossref_primary_10_1137_22M1488922
crossref_primary_10_1109_JSTSP_2018_2849219
crossref_primary_10_1109_MSP_2020_3014442
crossref_primary_10_1109_TCYB_2016_2626801
crossref_primary_10_1093_imamat_hxac029
crossref_primary_10_1109_TSP_2015_2423256
crossref_primary_10_1109_TSIPN_2018_2846183
crossref_primary_10_1109_JSTSP_2013_2246512
crossref_primary_10_1109_LSP_2014_2313177
crossref_primary_10_1109_JSEN_2013_2281208
crossref_primary_10_1109_TSP_2014_2319777
crossref_primary_10_1016_j_comnet_2022_109144
crossref_primary_10_1109_MSP_2011_943495
crossref_primary_10_1109_TSIPN_2023_3299512
crossref_primary_10_1109_LSP_2018_2878064
crossref_primary_10_1109_LCOMM_2011_092911_110830
crossref_primary_10_1007_s10589_020_00220_z
crossref_primary_10_1016_j_ins_2012_02_008
crossref_primary_10_1109_JSTSP_2013_2246763
crossref_primary_10_1155_2014_836584
crossref_primary_10_1177_1550147719896742
crossref_primary_10_1109_TSP_2015_2415759
crossref_primary_10_3390_e24050580
crossref_primary_10_1109_ACCESS_2021_3109288
crossref_primary_10_1109_TSP_2015_2415755
crossref_primary_10_1016_j_automatica_2018_10_009
crossref_primary_10_1109_TSP_2015_2500887
crossref_primary_10_1016_j_sigpro_2013_09_005
crossref_primary_10_1109_TSP_2012_2196697
crossref_primary_10_1109_TAC_2018_2884998
crossref_primary_10_1109_TSP_2012_2222398
crossref_primary_10_1137_110848396
crossref_primary_10_1109_TAC_2021_3111853
crossref_primary_10_1109_ACCESS_2019_2960494
crossref_primary_10_1109_TSP_2013_2291221
crossref_primary_10_1109_LCSYS_2024_3487796
crossref_primary_10_1109_TSP_2012_2215603
crossref_primary_10_1109_TSP_2012_2215604
crossref_primary_10_1109_LCOMM_2016_2637889
crossref_primary_10_1016_j_automatica_2017_05_004
crossref_primary_10_1109_TAC_2023_3241237
crossref_primary_10_1109_TSG_2015_2409053
crossref_primary_10_1109_TVT_2014_2354295
crossref_primary_10_1371_journal_pone_0209212
crossref_primary_10_1049_iet_spr_2015_0033
crossref_primary_10_1109_TSP_2023_3287333
crossref_primary_10_1137_19M1258864
crossref_primary_10_1109_TAC_2017_2685559
crossref_primary_10_1109_TAC_2024_3383795
crossref_primary_10_1109_TSP_2012_2204985
crossref_primary_10_1007_s00034_024_02769_0
crossref_primary_10_1137_18M1168297
crossref_primary_10_1587_transcom_2016EBP3122
crossref_primary_10_1287_mnsc_2021_4042
crossref_primary_10_1109_TIT_2018_2806961
crossref_primary_10_1109_TSIPN_2016_2570679
crossref_primary_10_1109_TSP_2019_2901355
crossref_primary_10_1109_TAC_2019_2912489
crossref_primary_10_1016_j_automatica_2017_06_031
crossref_primary_10_1007_s40565_018_0466_5
crossref_primary_10_1109_TSP_2017_2695451
crossref_primary_10_14778_3554821_3554832
crossref_primary_10_1016_j_ins_2021_03_036
crossref_primary_10_1109_TAES_2016_150733
crossref_primary_10_1109_TNSM_2016_2597125
crossref_primary_10_1049_iet_spr_2019_0547
crossref_primary_10_1109_TSP_2013_2245123
crossref_primary_10_1109_TAC_2016_2564339
crossref_primary_10_1109_JSTSP_2013_2245630
crossref_primary_10_1007_s10473_022_0616_8
crossref_primary_10_1016_j_automatica_2011_02_003
crossref_primary_10_1016_j_future_2017_02_033
crossref_primary_10_1155_2013_547124
crossref_primary_10_1016_j_sigpro_2020_107732
crossref_primary_10_1109_TWC_2012_122212_121032
crossref_primary_10_1109_TSP_2022_3222734
crossref_primary_10_3390_s20051302
crossref_primary_10_1109_TSP_2017_2771731
crossref_primary_10_1109_TCYB_2018_2815697
crossref_primary_10_1109_TNET_2015_2484345
crossref_primary_10_1109_JSTSP_2011_2157658
crossref_primary_10_1016_j_ifacsc_2018_07_002
crossref_primary_10_1109_ACCESS_2024_3402564
crossref_primary_10_1109_TNNLS_2015_2469100
crossref_primary_10_1109_JPROC_2020_3021381
crossref_primary_10_1109_TSP_2019_2908909
crossref_primary_10_3390_network3020013
crossref_primary_10_1109_TSP_2023_3277211
crossref_primary_10_1109_TII_2020_2975899
crossref_primary_10_1109_TSP_2018_2830304
crossref_primary_10_1137_130945090
crossref_primary_10_1109_TSIPN_2024_3361373
crossref_primary_10_1016_j_automatica_2012_06_027
crossref_primary_10_1109_TSIPN_2016_2623095
crossref_primary_10_1007_s10207_013_0221_x
crossref_primary_10_1109_TIE_2016_2588463
crossref_primary_10_1109_TSP_2019_2946017
crossref_primary_10_1109_TAC_2013_2259992
crossref_primary_10_1109_TSP_2015_2416687
crossref_primary_10_1109_TSP_2017_2781640
crossref_primary_10_1109_TSP_2012_2197205
crossref_primary_10_3390_s18040968
crossref_primary_10_1109_TSP_2023_3275272
crossref_primary_10_1109_LSP_2016_2518173
crossref_primary_10_1016_j_sigpro_2018_02_033
crossref_primary_10_1109_TSG_2016_2577684
crossref_primary_10_1145_3137573
crossref_primary_10_1109_TIT_2020_3047353
crossref_primary_10_1016_j_nahs_2017_06_008
crossref_primary_10_1109_TCYB_2017_2669041
crossref_primary_10_1109_TSP_2014_2385046
crossref_primary_10_1109_TSP_2012_2223692
crossref_primary_10_1063_1_5141493
crossref_primary_10_1109_TSP_2020_2970336
crossref_primary_10_1109_TCSI_2013_2278351
crossref_primary_10_1109_TSIPN_2018_2797800
crossref_primary_10_1109_TSIPN_2019_2936357
crossref_primary_10_1109_ACCESS_2017_2723051
crossref_primary_10_1016_j_procs_2013_05_182
crossref_primary_10_1109_JPROC_2020_3013432
crossref_primary_10_1155_2016_8695102
crossref_primary_10_1109_TSP_2016_2613062
crossref_primary_10_1109_TCSII_2023_3333325
crossref_primary_10_3182_20110828_6_IT_1002_02943
crossref_primary_10_1109_LCOMM_2013_120713_131595
crossref_primary_10_1155_2018_4283087
crossref_primary_10_1109_TAC_2018_2867341
crossref_primary_10_1109_TCOMM_2016_2623719
crossref_primary_10_1145_3447380
crossref_primary_10_1016_j_dsp_2018_03_006
crossref_primary_10_1016_j_ifacol_2023_10_1103
crossref_primary_10_1109_TWC_2014_2316817
crossref_primary_10_1137_16M1093227
crossref_primary_10_1109_TSIPN_2016_2618318
crossref_primary_10_1109_TAC_2017_2771140
crossref_primary_10_1109_TIT_2015_2389221
crossref_primary_10_3390_s19061381
crossref_primary_10_1016_j_apacoust_2024_110139
crossref_primary_10_1109_TSIPN_2018_2866322
crossref_primary_10_1109_JSAC_2013_130608
crossref_primary_10_1109_TSP_2021_3125602
crossref_primary_10_1016_j_ins_2013_07_012
crossref_primary_10_1109_TIT_2010_2060050
crossref_primary_10_1109_TSIPN_2018_2866320
crossref_primary_10_1109_JSTSP_2017_2726978
crossref_primary_10_1186_s13634_016_0313_7
crossref_primary_10_1137_21M1394680
crossref_primary_10_1109_TAC_2018_2878476
crossref_primary_10_1109_TAC_2016_2612819
crossref_primary_10_1098_rsta_2011_0247
crossref_primary_10_1109_TNET_2014_2350013
crossref_primary_10_1137_14096668X
crossref_primary_10_1016_j_dsp_2017_09_004
crossref_primary_10_1109_TII_2012_2219061
crossref_primary_10_1016_j_sigpro_2023_109259
crossref_primary_10_1109_TSP_2013_2289888
crossref_primary_10_1109_MCOM_2014_6815894
crossref_primary_10_1109_LSP_2017_2693819
crossref_primary_10_1109_ACCESS_2020_2981794
crossref_primary_10_1109_TSP_2013_2288673
crossref_primary_10_1109_TCYB_2014_2326549
crossref_primary_10_1016_j_sigpro_2024_109570
crossref_primary_10_1109_ACCESS_2020_3023692
crossref_primary_10_1109_TIFS_2024_3516564
crossref_primary_10_1109_TSP_2015_2493979
crossref_primary_10_1109_JSEN_2020_3003623
crossref_primary_10_1109_MSP_2012_2232356
crossref_primary_10_1109_OJSP_2020_2989031
crossref_primary_10_1109_TSP_2013_2265221
crossref_primary_10_1109_OJSP_2020_2989038
crossref_primary_10_1109_TSMCB_2012_2207718
crossref_primary_10_1109_TSIPN_2024_3464350
crossref_primary_10_1049_iet_cta_2012_0732
crossref_primary_10_1109_OJSP_2022_3189315
crossref_primary_10_1016_j_automatica_2013_04_035
crossref_primary_10_1109_TSIPN_2018_2890231
crossref_primary_10_1109_JSTSP_2017_2676468
crossref_primary_10_1109_MSP_2012_2234508
crossref_primary_10_1109_OJSP_2024_3377098
crossref_primary_10_1109_TAC_2024_3454386
crossref_primary_10_1109_JIOT_2023_3280843
crossref_primary_10_1109_TITS_2015_2502601
crossref_primary_10_1016_j_sigpro_2018_08_007
crossref_primary_10_1016_j_dsp_2018_02_008
crossref_primary_10_1109_JSYST_2019_2900027
crossref_primary_10_1016_j_sigpro_2012_07_028
crossref_primary_10_1109_LSP_2023_3240647
crossref_primary_10_1109_TIT_2016_2580665
crossref_primary_10_1016_j_sigpro_2020_107561
crossref_primary_10_1109_TAES_2014_130328
crossref_primary_10_1109_TCNS_2016_2633788
crossref_primary_10_1109_TIT_2017_2686435
crossref_primary_10_1007_s11277_017_4451_5
crossref_primary_10_1109_TSP_2013_2241057
crossref_primary_10_1049_iet_com_2019_0497
crossref_primary_10_1109_LCSYS_2021_3086388
crossref_primary_10_1109_JPROC_2014_2306253
crossref_primary_10_1109_ACCESS_2018_2864205
crossref_primary_10_1109_TAC_2017_2714645
crossref_primary_10_1007_s11276_019_02031_5
crossref_primary_10_1109_JPROC_2018_2817461
crossref_primary_10_1109_TSP_2013_2272921
crossref_primary_10_1109_TSP_2015_2412918
crossref_primary_10_1109_TCYB_2021_3087521
crossref_primary_10_1109_ACCESS_2023_3317298
crossref_primary_10_1109_TAC_2014_2329611
crossref_primary_10_1109_TAC_2020_2989764
crossref_primary_10_1109_TSP_2023_3239806
crossref_primary_10_1137_19M125248X
crossref_primary_10_1109_TSIPN_2018_2881718
crossref_primary_10_1016_j_jnca_2015_05_014
crossref_primary_10_1109_TNSE_2020_3025621
crossref_primary_10_1109_TSP_2015_2494865
crossref_primary_10_1109_JPROC_2020_3007395
crossref_primary_10_1109_TCNS_2016_2594493
crossref_primary_10_1109_TSP_2013_2264056
crossref_primary_10_1109_TSP_2017_2725226
crossref_primary_10_1109_TSIPN_2016_2620440
crossref_primary_10_1109_TCOMM_2013_072913_120815
crossref_primary_10_1109_TSIPN_2024_3375597
crossref_primary_10_1109_OJCSYS_2023_3277760
crossref_primary_10_1109_TNET_2019_2952082
crossref_primary_10_1109_OJCS_2024_3397345
crossref_primary_10_1109_TSP_2017_2759098
crossref_primary_10_1109_TRO_2014_2315713
crossref_primary_10_1109_TSP_2013_2256904
crossref_primary_10_1109_TSP_2015_2424205
crossref_primary_10_1109_TAC_2019_2906495
crossref_primary_10_1016_j_sigpro_2017_10_017
crossref_primary_10_1016_j_neucom_2021_12_105
crossref_primary_10_1109_JIOT_2015_2451220
crossref_primary_10_1016_j_sigpro_2021_108347
crossref_primary_10_1016_j_sigpro_2017_10_012
crossref_primary_10_1109_LWC_2020_3025526
crossref_primary_10_1109_TSP_2017_2757903
crossref_primary_10_3390_s17112575
crossref_primary_10_1016_j_ipl_2014_11_009
crossref_primary_10_1016_j_tcs_2019_08_029
crossref_primary_10_1016_j_procs_2017_06_113
crossref_primary_10_1109_TSP_2015_2478737
crossref_primary_10_1109_TSIPN_2016_2614902
crossref_primary_10_1109_TAC_2020_2981035
crossref_primary_10_1109_TASLP_2020_2973795
crossref_primary_10_1109_TAC_2018_2849616
crossref_primary_10_1109_TSP_2014_2350965
crossref_primary_10_3390_s21175747
crossref_primary_10_1002_eng2_12741
crossref_primary_10_1109_TWC_2016_2607703
crossref_primary_10_1109_TSP_2015_2411223
crossref_primary_10_1109_TSIPN_2017_2672403
crossref_primary_10_3390_e22060635
crossref_primary_10_3390_e17020818
crossref_primary_10_1109_TAC_2019_2933607
crossref_primary_10_1038_s41598_022_25974_w
crossref_primary_10_1109_TSMC_2024_3516936
crossref_primary_10_1016_j_automatica_2013_01_001
crossref_primary_10_1109_TPDS_2015_2458311
crossref_primary_10_1109_TCYB_2018_2804940
crossref_primary_10_1109_LSP_2020_3045832
crossref_primary_10_1109_TSMC_2019_2946287
crossref_primary_10_3390_s18113678
crossref_primary_10_1109_LSP_2025_3526092
crossref_primary_10_1109_MSP_2020_2968813
crossref_primary_10_1155_2013_805635
crossref_primary_10_1109_JSTSP_2017_2676982
crossref_primary_10_1109_TIT_2018_2839192
crossref_primary_10_1109_MSP_2012_2231991
crossref_primary_10_1109_TAES_2018_2803578
crossref_primary_10_1155_2013_613246
crossref_primary_10_1109_JSEN_2015_2497464
crossref_primary_10_1109_TSP_2025_3531292
crossref_primary_10_1109_TAC_2015_2446711
crossref_primary_10_1007_s10846_020_01294_x
crossref_primary_10_1109_TSMC_2017_2734886
crossref_primary_10_1109_TSP_2013_2261296
crossref_primary_10_1109_JSAC_2015_2430519
crossref_primary_10_1109_TSP_2020_2975346
crossref_primary_10_3390_app112412003
crossref_primary_10_1109_TSP_2015_2434327
crossref_primary_10_1049_iet_cta_2014_0333
crossref_primary_10_1109_TSIPN_2015_2471846
crossref_primary_10_1016_j_automatica_2019_108603
crossref_primary_10_1109_TSIPN_2015_2447832
crossref_primary_10_1109_MAES_2016_140128
crossref_primary_10_1109_TIT_2021_3113285
crossref_primary_10_1109_TAC_2020_2994024
crossref_primary_10_1109_TSP_2015_2401533
crossref_primary_10_1109_TAC_2016_2530939
crossref_primary_10_1109_TIT_2017_2725267
crossref_primary_10_1109_JSTSP_2011_2123078
crossref_primary_10_1109_TAC_2023_3330405
crossref_primary_10_1155_2014_170748
crossref_primary_10_1109_TSIPN_2022_3161077
crossref_primary_10_1109_TSP_2014_2304432
crossref_primary_10_1109_TSP_2023_3347918
crossref_primary_10_1109_TAC_2018_2836861
crossref_primary_10_1109_MSP_2012_2219652
crossref_primary_10_1109_TSP_2016_2560142
crossref_primary_10_1109_TIP_2014_2316373
crossref_primary_10_1109_TSIPN_2017_2705483
crossref_primary_10_1109_TSIPN_2018_2824239
crossref_primary_10_1109_TSP_2013_2276440
crossref_primary_10_3182_20130703_3_FR_4038_00099
crossref_primary_10_1016_j_arcontrol_2018_03_005
crossref_primary_10_1109_TSP_2013_2296271
crossref_primary_10_1109_JSTSP_2011_2127446
crossref_primary_10_1016_j_jfranklin_2019_01_050
crossref_primary_10_1109_TSG_2016_2614904
crossref_primary_10_1109_TNET_2016_2611379
crossref_primary_10_1109_TAP_2020_2972401
crossref_primary_10_1109_JSTSP_2011_2118742
crossref_primary_10_1109_TSP_2012_2217338
crossref_primary_10_1109_TSG_2012_2217761
crossref_primary_10_1016_j_neunet_2015_09_008
crossref_primary_10_1016_j_sigpro_2014_09_031
crossref_primary_10_1109_TIT_2022_3202733
Cites_doi 10.1109/ICASSP.2009.4960419
10.1109/TIT.2008.924648
10.1109/ISSNIP.2008.4762050
10.1109/TAC.2004.834433
10.1109/TSP.2008.917383
10.1109/TSP.2010.2043127
10.1155/S1110865703212075
10.1145/1031495.1031518
10.1137/S0036144503423264
10.1109/TSP.2008.927480
10.1109/JPROC.2003.814921
10.1109/JPROC.2003.814926
10.1109/ACC.2007.4282571
10.1109/TSP.2006.880227
10.1109/ALLERTON.2008.4797581
10.1006/jcss.1996.0075
10.1145/181014.181361
10.1109/TSP.2009.2014812
10.1109/TIT.2010.2081030
10.1109/TAC.2010.2041686
10.1109/MCS.2007.338264
10.1109/T-WC.2009.071146
10.1109/SFCS.1998.743520
10.1016/0743-7315(89)90021-X
10.1109/TIT.1973.1055037
10.1109/79.733495
10.1109/ICASSP.2005.1416489
10.1109/TIT.2006.883539
10.1109/SFCS.2000.892324
10.1145/1127777.1127791
10.1109/TAC.2003.812781
10.1109/ACC.2009.5160485
10.1109/INFCOM.2009.5062132
10.1145/167088.167250
10.1109/CDC.2003.1272421
10.1109/TAC.1986.1104412
10.1109/ACC.2009.5160568
10.1109/ICASSP.2009.4960420
10.1109/ICASSP.2008.4518212
10.1109/CDC.2006.377646
10.1007/BFb0023849
10.1109/TSP.2010.2046635
10.1109/TIT.2002.1003821
10.1016/j.automatica.2007.01.002
10.1109/ICASSP.2008.4518353
10.1109/ICASSP.2009.4960422
10.1109/MSP.2005.1458287
10.1109/MSP.2007.914732
10.1109/TSP.2007.906734
10.1109/TIT.2006.874516
10.1007/11776178_16
10.1109/TSP.2008.2006147
10.1109/79.985684
10.1145/1236360.1236413
10.1109/SFCS.2003.1238221
10.1109/ACSSC.2009.5469908
10.1145/984622.984626
10.1109/CDC.2005.1583486
10.1016/0022-0000(85)90041-8
10.1109/TSP.2004.838930
10.1109/TSP.2008.919636
10.1109/SSP.2007.4301337
10.1109/ICDSC.2008.4635701
10.1109/CDC.2007.4434812
10.1109/TSP.2008.2007111
10.1109/JPROC.2003.814918
10.1109/ALLERTON.2008.4797616
10.1017/S0962492900002816
10.1002/0471200611
10.1109/SPAWC.2005.1506308
10.1109/LCOMM.2009.090460
10.1109/TSP.2006.879312
10.1145/1127777.1127789
10.1109/JSAC.2008.080505
10.1109/TSP.2008.927071
10.1109/CDC.2004.1429652
10.1109/SAHCN.2006.288500
10.1109/TSP.2009.2036046
10.1145/301250.301315
10.1109/TSP.2008.920143
10.1109/TAC.2006.878783
10.1023/A:1024591915518
10.1016/j.automatica.2007.07.009
10.1109/TSP.2009.2016247
10.1109/TAC.2009.2037460
10.1109/MSP.2006.1657816
10.1109/CDC.2004.1430343
10.1109/9.948466
10.1109/JSAC.2008.080506
10.1109/TIT.2005.858979
10.1109/TIT.2007.904785
10.1145/332833.332838
10.1109/JPROC.2006.887293
10.1109/TSP.2008.923536
10.1109/TIT.1976.1055508
10.1109/JPROC.2003.814923
10.1109/TAC.2004.834113
10.1109/CDC.2008.4739490
10.1109/TIT.2006.871582
10.1109/TIT.2006.885507
10.1109/18.50368
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Nov 2010
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Nov 2010
DBID 97E
RIA
RIE
AAYXX
CITATION
7SP
8FD
L7M
F28
FR3
DOI 10.1109/JPROC.2010.2052531
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Electronics & Communications Abstracts
Technology Research Database
Advanced Technologies Database with Aerospace
ANTE: Abstracts in New Technology & Engineering
Engineering Research Database
DatabaseTitle CrossRef
Technology Research Database
Advanced Technologies Database with Aerospace
Electronics & Communications Abstracts
Engineering Research Database
ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList Engineering Research Database

Technology Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISSN 1558-2256
EndPage 1864
ExternalDocumentID 2724069021
10_1109_JPROC_2010_2052531
5545370
Genre orig-research
GroupedDBID -DZ
-~X
.DC
0R~
123
1OL
29P
3EH
4.4
6IK
85S
97E
9M8
AAJGR
AAWTH
ABAZT
ABFSI
ABJNI
ABQJQ
ABVLG
ACBEA
ACGFS
AENEX
AETEA
AETIX
AFOGA
AGNAY
AGQYO
AGSQL
AHBIQ
AIBXA
ALLEH
ALMA_UNASSIGNED_HOLDINGS
AZLTO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
EJD
FA8
HZ~
H~9
IAAWW
IBMZZ
ICLAB
IDIHD
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
MVM
O9-
OCL
RIA
RIE
RIU
RNS
TAE
TN5
TWZ
UDY
UHB
UKR
UQL
VOH
WHG
XJT
XOL
YNT
ZCA
ZXP
ZY4
~02
AAYOK
AAYXX
CITATION
RIG
7SP
8FD
L7M
F28
FR3
ID FETCH-LOGICAL-c393t-32f2f989664aff3b5ff2363d741d525feb69c0377c4c7de81f37058c0b4321a53
IEDL.DBID RIE
ISSN 0018-9219
IngestDate Fri Sep 05 14:37:11 EDT 2025
Mon Jun 30 07:17:31 EDT 2025
Tue Jul 01 01:56:35 EDT 2025
Thu Apr 24 23:07:49 EDT 2025
Wed Aug 27 02:43:14 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 11
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c393t-32f2f989664aff3b5ff2363d741d525feb69c0377c4c7de81f37058c0b4321a53
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
PQID 1030144249
PQPubID 85453
PageCount 18
ParticipantIDs proquest_miscellaneous_831161128
crossref_primary_10_1109_JPROC_2010_2052531
proquest_journals_1030144249
ieee_primary_5545370
crossref_citationtrail_10_1109_JPROC_2010_2052531
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2010-11-01
PublicationDateYYYYMMDD 2010-11-01
PublicationDate_xml – month: 11
  year: 2010
  text: 2010-11-01
  day: 01
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle Proceedings of the IEEE
PublicationTitleAbbrev JPROC
PublicationYear 2010
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref57
ram (ref97) 2009
ref56
tsitsiklis (ref17) 1984
ref59
ref58
ref53
zhao (ref1) 2004
ref52
ref55
ref54
ribeiro (ref101) 2009
ref51
ref50
ref46
ref48
ref42
ref41
ref44
sheng (ref110) 2003
ref49
ref7
mallat (ref117) 1999
ref9
ref4
ref3
ref6
ref5
ref100
ref40
ref35
benezit (ref47) 2007
nevel'son (ref105) 1973
ref36
servetto (ref115) 2002
ref31
ref30
ref33
ref32
ref38
li (ref109) 2003; 2003
ciancio (ref12) 2006
el gamal (ref84) 2009
ref24
ref23
huang (ref106) 2007
ref26
ref25
ref20
chung (ref119) 1997
ref22
levis (ref16) 2004; 1
ref21
ref28
ref29
yildiz (ref79) 2007
gupta (ref34) 1998
diaconis (ref37) 2000
yu (ref8) 2004
ref128
ref15
ref129
ref14
ref126
ref96
ref124
ref99
ref125
ref98
ref10
ratnasamy (ref13) 2003; 8
ref18
bertsekas (ref27) 1997
ref93
ref95
ref94
cybenko (ref19) 1989; 7
ref90
ref89
jung (ref39) 2007
ref85
ref88
ref87
cao (ref43) 2006
kar (ref86) 2007
kar (ref91) 2008
ref82
ref81
ref83
ref80
ref108
ref78
ref107
ref75
ref104
ref74
ref76
ref103
ref2
salehi (ref63) 2006
carli (ref102) 2008; 26
ref71
ref111
ref70
ref112
ref73
ref72
carli (ref77) 2008; 44
ref68
ref67
ref69
ref118
ref64
ref116
ref66
ref113
ref65
kar (ref92) 2008
ref114
son (ref11) 2005; 2
ref60
ref122
ref123
ram (ref127) 2009
ref62
ref120
ref61
ref121
johansson (ref45) 2008
References_xml – start-page: 1419
  year: 2007
  ident: ref106
  article-title: stochastic lyapunov analysis for consensus algorithms with noisy measurements
  publication-title: Proc Amer Control Conf
– ident: ref85
  doi: 10.1109/ICASSP.2009.4960419
– ident: ref41
  doi: 10.1109/TIT.2008.924648
– year: 2007
  ident: ref86
  article-title: consensus based detection in sensor networks: topology optimization under practical constraints
  publication-title: Proc Int Workshop Inf Theory Sens Netw
– ident: ref90
  doi: 10.1109/ISSNIP.2008.4762050
– year: 1973
  ident: ref105
  publication-title: Stochastic approximation and recursive estimation
– ident: ref22
  doi: 10.1109/TAC.2004.834433
– year: 2006
  ident: ref63
  article-title: on consensus in random networks
  publication-title: Proc Allerton Conf Commun Control Comput
– ident: ref93
  doi: 10.1109/TSP.2008.917383
– ident: ref46
  doi: 10.1109/TSP.2010.2043127
– volume: 2003
  start-page: 321
  year: 2003
  ident: ref109
  article-title: energy based collaborative source localization using acoustic micro-sensor array
  publication-title: Eurosip J Appl Signal Processing
  doi: 10.1155/S1110865703212075
– ident: ref7
  doi: 10.1145/1031495.1031518
– ident: ref33
  doi: 10.1137/S0036144503423264
– ident: ref100
  doi: 10.1109/TSP.2008.927480
– ident: ref2
  doi: 10.1109/JPROC.2003.814921
– ident: ref3
  doi: 10.1109/JPROC.2003.814926
– ident: ref61
  doi: 10.1109/ACC.2007.4282571
– ident: ref87
  doi: 10.1109/TSP.2006.880227
– ident: ref50
  doi: 10.1109/ALLERTON.2008.4797581
– ident: ref70
  doi: 10.1006/jcss.1996.0075
– ident: ref67
  doi: 10.1145/181014.181361
– year: 2004
  ident: ref1
  publication-title: Wireless Sensor Networks An Information Processing Approach
– ident: ref113
  doi: 10.1109/TSP.2009.2014812
– ident: ref36
  doi: 10.1109/TIT.2010.2081030
– ident: ref65
  doi: 10.1109/TAC.2010.2041686
– start-page: 1106
  year: 1998
  ident: ref34
  article-title: critical power for asymptotic connectivity in wireless networks
  publication-title: Proc Stochastic Anal Control Optim Appl
– ident: ref29
  doi: 10.1109/MCS.2007.338264
– ident: ref51
  doi: 10.1109/T-WC.2009.071146
– ident: ref68
  doi: 10.1109/SFCS.1998.743520
– volume: 7
  start-page: 279
  year: 1989
  ident: ref19
  article-title: dynamic load balancing for distributed memory multiprocessors
  publication-title: J Parallel Distrib Comput
  doi: 10.1016/0743-7315(89)90021-X
– ident: ref114
  doi: 10.1109/TIT.1973.1055037
– ident: ref52
  doi: 10.1109/79.733495
– volume: 1
  start-page: 2
  year: 2004
  ident: ref16
  article-title: trickle: a self-regulating algorithm for code propagation and maintenance in wireless sensor networks
  publication-title: Proc USENIX/ACM Symp Netw Syst Design Implement
– year: 2008
  ident: ref45
  article-title: faster linear iterations for distributed averaging
  publication-title: Proc IFAC World Congr
– start-page: 285
  year: 2003
  ident: ref110
  article-title: energy based acoustic source localization
  publication-title: Proc ACM/IEEE Int Conf Inf Process Sensor Netw
– ident: ref112
  doi: 10.1109/ICASSP.2005.1416489
– ident: ref88
  doi: 10.1109/TIT.2006.883539
– ident: ref14
  doi: 10.1109/SFCS.2000.892324
– ident: ref35
  doi: 10.1145/1127777.1127791
– ident: ref20
  doi: 10.1109/TAC.2003.812781
– ident: ref71
  doi: 10.1109/ACC.2009.5160485
– ident: ref129
  doi: 10.1109/INFCOM.2009.5062132
– ident: ref69
  doi: 10.1145/167088.167250
– ident: ref26
  doi: 10.1109/CDC.2003.1272421
– ident: ref18
  doi: 10.1109/TAC.1986.1104412
– ident: ref72
  doi: 10.1109/ACC.2009.5160568
– year: 2006
  ident: ref43
  article-title: accelerated gossip algorithms for distributed computation
  publication-title: Proc 44th Annu Allerton Conf Commun Control Comput
– ident: ref73
  doi: 10.1109/ICASSP.2009.4960420
– ident: ref99
  doi: 10.1109/ICASSP.2008.4518212
– ident: ref23
  doi: 10.1109/CDC.2006.377646
– year: 2004
  ident: ref8
  article-title: energy-latency tradeoffs for data gathering in wireless sensor networks
  publication-title: Proc IEEE InfoCom
– year: 1997
  ident: ref119
  publication-title: Spectral Graph Theory
– volume: 2
  start-page: 969
  year: 2005
  ident: ref11
  article-title: the value of clustering in distributed estimation for sensor networks
  publication-title: Proc IEEE Int Conf Wireless Netw Commun Mobile Comput
– ident: ref32
  doi: 10.1007/BFb0023849
– ident: ref62
  doi: 10.1109/TSP.2010.2046635
– ident: ref82
  doi: 10.1109/TIT.2002.1003821
– ident: ref66
  doi: 10.1016/j.automatica.2007.01.002
– ident: ref95
  doi: 10.1109/ICASSP.2008.4518353
– year: 1984
  ident: ref17
  publication-title: Problems in decentralized decision making and computation
– ident: ref107
  doi: 10.1109/ICASSP.2009.4960422
– ident: ref108
  doi: 10.1109/MSP.2005.1458287
– ident: ref124
  doi: 10.1109/MSP.2007.914732
– ident: ref104
  doi: 10.1109/TSP.2007.906734
– ident: ref25
  doi: 10.1109/TIT.2006.874516
– year: 2007
  ident: ref39
  article-title: fast gossip through lifted markov chains
  publication-title: Proc Allerton Conf Commun Control Comput
– ident: ref48
  doi: 10.1007/11776178_16
– year: 2009
  ident: ref101
  article-title: kalman filtering in wireless sensor networks: incorporating communication cost in state estimation problems
  publication-title: IEEE Control Syst Mag
– ident: ref44
  doi: 10.1109/TSP.2008.2006147
– year: 2008
  ident: ref92
  publication-title: Distributed parameter estimation in sensor networks Nonlinear observation models and imperfect communication
– ident: ref116
  doi: 10.1109/79.985684
– ident: ref126
  doi: 10.1145/1236360.1236413
– ident: ref15
  doi: 10.1109/SFCS.2003.1238221
– ident: ref125
  doi: 10.1109/ACSSC.2009.5469908
– ident: ref9
  doi: 10.1145/984622.984626
– ident: ref98
  doi: 10.1109/CDC.2005.1583486
– year: 2007
  ident: ref47
  article-title: gossip along the way: order-optimal consensus through randomized path averaging
  publication-title: Allerton Conf Commun Control Comput
– ident: ref42
  doi: 10.1016/0022-0000(85)90041-8
– ident: ref111
  doi: 10.1109/TSP.2004.838930
– ident: ref80
  doi: 10.1109/TSP.2008.919636
– year: 1997
  ident: ref27
  publication-title: Parallel and Distributed Computation Numerical Methods
– ident: ref75
  doi: 10.1109/SSP.2007.4301337
– ident: ref89
  doi: 10.1109/ICDSC.2008.4635701
– ident: ref94
  doi: 10.1109/CDC.2007.4434812
– ident: ref64
  doi: 10.1109/TSP.2008.2007111
– ident: ref4
  doi: 10.1109/JPROC.2003.814918
– ident: ref59
  doi: 10.1109/ALLERTON.2008.4797616
– ident: ref118
  doi: 10.1017/S0962492900002816
– ident: ref55
  doi: 10.1002/0471200611
– ident: ref58
  doi: 10.1109/SPAWC.2005.1506308
– ident: ref40
  doi: 10.1109/LCOMM.2009.090460
– ident: ref10
  doi: 10.1109/TSP.2006.879312
– ident: ref123
  doi: 10.1145/1127777.1127789
– volume: 26
  start-page: 622
  year: 2008
  ident: ref102
  article-title: distributed kalman filtering based on consensus strategies
  publication-title: IEEE J Sel Areas Commun
  doi: 10.1109/JSAC.2008.080505
– ident: ref76
  doi: 10.1109/TSP.2008.927071
– year: 2009
  ident: ref97
  publication-title: Sensor Networks Where Theory Meets Practice
– ident: ref30
  doi: 10.1109/CDC.2004.1429652
– ident: ref103
  doi: 10.1109/SAHCN.2006.288500
– ident: ref74
  doi: 10.1109/TSP.2009.2036046
– ident: ref38
  doi: 10.1145/301250.301315
– ident: ref56
  doi: 10.1109/TSP.2008.920143
– ident: ref60
  doi: 10.1109/TAC.2006.878783
– volume: 8
  start-page: 427
  year: 2003
  ident: ref13
  article-title: data-centric storage in sensornets with ght, a geographic hash table
  publication-title: Mobile Net and App
  doi: 10.1023/A:1024591915518
– start-page: 3581
  year: 2009
  ident: ref127
  article-title: Asynchronous gossip algorithms for stochastic optimization
  publication-title: Proc IEEE Conf Decision Control
– start-page: 89
  year: 2007
  ident: ref79
  article-title: differential nested lattice encoding for consensus problems
  publication-title: Proc Inf Process Sensor Netw
– volume: 44
  start-page: 671
  year: 2008
  ident: ref77
  article-title: communication constraints in the average consensus problem
  publication-title: Automatica
  doi: 10.1016/j.automatica.2007.07.009
– ident: ref49
  doi: 10.1109/TSP.2009.2016247
– ident: ref96
  doi: 10.1109/TAC.2009.2037460
– start-page: 726
  year: 2000
  ident: ref37
  article-title: analysis of a nonreversible markov chain sampler
  publication-title: Ann Appl Probab
– ident: ref128
  doi: 10.1109/MSP.2006.1657816
– ident: ref57
  doi: 10.1109/CDC.2004.1430343
– ident: ref78
  doi: 10.1109/9.948466
– year: 1999
  ident: ref117
  publication-title: A Wavelet Tour of Signal Processing
– ident: ref31
  doi: 10.1109/JSAC.2008.080506
– ident: ref120
  doi: 10.1109/TIT.2005.858979
– start-page: 1453
  year: 2009
  ident: ref84
  article-title: distributed lossy averaging
  publication-title: Proc IEEE Int Symp Inf Theory
– ident: ref54
  doi: 10.1109/TIT.2007.904785
– ident: ref6
  doi: 10.1145/332833.332838
– ident: ref28
  doi: 10.1109/JPROC.2006.887293
– start-page: 309
  year: 2006
  ident: ref12
  article-title: energy-efficient data representation and routing for wireless sensor networks based on a distributed wavelet compression algorithm
  publication-title: Proc IEEE/ACM Symp Inf Process Sensor Netw
– ident: ref24
  doi: 10.1109/TSP.2008.923536
– ident: ref81
  doi: 10.1109/TIT.1976.1055508
– start-page: 1160
  year: 2008
  ident: ref91
  article-title: a linear iterative algorithm for distributed sensor localization
  publication-title: Proc Asilomar Conf Signals Syst Comput
– ident: ref5
  doi: 10.1109/JPROC.2003.814923
– ident: ref21
  doi: 10.1109/TAC.2004.834113
– ident: ref83
  doi: 10.1109/CDC.2008.4739490
– ident: ref121
  doi: 10.1109/TIT.2006.871582
– ident: ref122
  doi: 10.1109/TIT.2006.885507
– ident: ref53
  doi: 10.1109/18.50368
– year: 2002
  ident: ref115
  article-title: on the feasibility of large-scale wireless sensor networks
  publication-title: Proc Allerton Conf Commun Control Comput
SSID ssj0003563
Score 2.566609
Snippet Gossip algorithms are attractive for in-network processing in sensor networks because they do not require any specialized routing, there is no bottleneck or...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1847
SubjectTerms Algorithms
Computer science
Consensus protocols
Consumption
Convergence
distributed algorithms
distributed processing
Failure
gossip protocols
graph theory
information networks distributed averaging
Information theory
network topology
Networks
peer to peer computing
Position (location)
Process control
protocols
random topologies
Robust control
Robustness
Routing
Signal processing
Signal processing algorithms
Surges
topology design
Wireless communication
Wireless sensor networks
Title Gossip Algorithms for Distributed Signal Processing
URI https://ieeexplore.ieee.org/document/5545370
https://www.proquest.com/docview/1030144249
https://www.proquest.com/docview/831161128
Volume 98
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT8MwDLZgJzgwGCAGA_XADTqapl3b4zReQhogYNJuVfOCidEh1l349ThpWvES4hapSWTZcWw3tj-AwzhQaEmZcFksuIsutXKZTDIXIwE09kz5gdAFzsPr3uUouBqH4yU4rmthpJQm-Ux29dC85YsZX-hfZSdo-kIaYYC-jMesrNWqb10aWtQ0ggqMalgVyHjJydXt3c2gzOLyNWwbJV-MkEFV-XEVG_ty3oRhRVmZVvLcXRSsy9-_NW38L-nrsGYdTadfnowNWJJ5C5oViINjdboFq586Em4CvUB6J69Of_o4e5sUTy9zB71a51S319XIWFI495NHvbGtMMBVWzA6P3sYXLoWV8HlNKGFS33lqyTGQCfIlKIsVMqnPSrQuRDIHiVZL-EejSIe8EjImCikPIy5xwLqkyyk29DIZ7ncAYdKzsIMF3heFoREJCrmCckIihuHQdwGUjE65bbpuMa-mKYm-PCS1Agn1cJJrXDacFSveS1bbvw5e1Nzu55pGd2GTiXP1GrlPCVlAIkRZxuc-jPqk34kyXI5W8zTmBJ0gtFq7_6-8R6smAQCU47YgUbxtpD76JcU7MAcyA-SSN1I
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3dT9swED8h9sB4gAFDFLqRh71BShzHrfNYMVj5KEwbSLxZ8VepgBbR9GV__c6OE42BEG-WYlunO5_vLr67H8A3nlm0pFLHkmsVo0ttY2nyIsZIAI29tGmmXYHz8KI7uM5Ob9jNAuw3tTDGGJ98Zjpu6N_y9VTN3a-yAzR9jPYwQP_AcC9eVWs19y5lATeNoAqjItYlMkl-cPrz1-VhlceVOuA2Sp6ZIY-r8uIy9hbmeBWGNW1VYsldZ17KjvrzX9vG9xL_CVaCqxn1q7OxBgtmsg6rNYxDFLR6HZb_6Um4AfQH0jt-jPr3o-nTuLx9mEXo10bfXYNdh41ldPR7PHIbhxoDXPUZro-Prg4HcUBWiBXNaRnT1KY25xjqZIW1VDJrU9qlGt0LjeyxRnZzldBeT2Wqpw0nFilnXCUyoykpGN2Excl0YrYgokZJVuCCJCkyRnRuucpJQVDgOMx4C0jNaKFC23GHfnEvfPiR5MILRzjhiCCcFuw1ax6rphtvzt5w3G5mBka3oF3LUwS9nAlShZAYc7Ygaj6jRrlnkmJipvOZ4JSgG4x2e_v1jXdhaXA1PBfnJxdnO_DRpxP44sQ2LJZPc_MFvZRSfvWH8y9jJOCb
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Gossip+Algorithms+for+Distributed+Signal+Processing&rft.jtitle=Proceedings+of+the+IEEE&rft.au=Dimakis%2C+Alexandros+G&rft.au=Kar%2C+Soummya&rft.au=Moura%2C+Jose+MF&rft.au=Rabbat%2C+Michael+G&rft.date=2010-11-01&rft.issn=0018-9219&rft.eissn=1558-2256&rft.volume=98&rft.issue=11&rft.spage=1847&rft.epage=1864&rft_id=info:doi/10.1109%2FJPROC.2010.2052531&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9219&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9219&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9219&client=summon