Zanaj et al., 2007 - Google Patents
Efficiency of the gossip algorithm for wireless sensor networksZanaj et al., 2007
View PDF- Document ID
- 162190092853919215
- Author
- Zanaj E
- Baldi M
- Chiaraluce F
- Publication year
- Publication venue
- 2007 15th International Conference on Software, Telecommunications and Computer Networks
External Links
Snippet
Gossip is a well-known technique for distributed computing in an arbitrarily connected network of nodes. The gossip algorithm, which is very simple to implement, takes into account strong limitations in computational, communication and energy resources that …
- 238000004422 calculation algorithm 0 title abstract description 14
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zanaj et al. | Efficiency of the gossip algorithm for wireless sensor networks | |
| Xie et al. | Accurate recovery of internet traffic data: A sequential tensor completion approach | |
| Li et al. | On random walk based graph sampling | |
| Aysal et al. | Distributed average consensus with dithered quantization | |
| Denantes et al. | Which distributed averaging algorithm should I choose for my sensor network? | |
| Fischione | Fast-lipschitz optimization with wireless sensor networks applications | |
| Gjoka et al. | 2.5 k-graphs: from sampling to generation | |
| Chen et al. | Heterogeneous online learning for “thing-adaptive” fog computing in IoT | |
| Kong et al. | Connectivity and latency in large-scale wireless networks with unreliable links | |
| Sun et al. | Trust establishment in distributed networks: Analysis and modeling | |
| Li et al. | Characterizing the topological and controllability features of US power transmission networks | |
| Alderson et al. | Diversity of graphs with highly variable connectivity | |
| Ghazanfari-Rad et al. | Formulation and analysis of LMS adaptive networks for distributed estimation in the presence of transmission errors | |
| Asadi et al. | Generalized algebraic connectivity for asymmetric networks | |
| Seike et al. | Fork rate-based analysis of the longest chain growth time interval of a pow blockchain | |
| Shen et al. | Design of distributed recursive filters based on data compression for sensor networks | |
| Nguyen et al. | A binary independent component analysis approach to tree topology inference | |
| Gaeta et al. | A simple analytical framework to analyze search strategies in large-scale peer-to-peer networks | |
| Aysal et al. | Rates of convergence for distributed average consensus with probabilistic quantization | |
| Li et al. | STAR-RIS Empowered Heterogeneous Federated Edge Learning With Flexible Aggregation | |
| Salehi et al. | A measurement framework for directed networks | |
| Coluccia et al. | A Bayesian framework for distributed estimation of arrival rates in asynchronous networks | |
| Zhang et al. | A greedy-based approach of fast transaction broadcasting in bitcoin networks | |
| Xu et al. | CSTAR-FL: Stochastic Client Selection for Tree All-Reduce Federated Learning | |
| Mishkovski et al. | Enhancing robustness and synchronizability of networks homogenizing their degree distribution |