𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Study on Gossiping in Transportation Networks

✍ Scribed by Kraus, S.; Parshani, R.; Shavitt, Y.

Book ID
114672468
Publisher
IEEE
Year
2008
Tongue
English
Weight
426 KB
Volume
57
Category
Article
ISSN
0018-9545

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A randomized algorithm for gossiping in
A randomized algorithm for gossiping in radio networks
✍ Marek Chrobak; Leszek GaΜ§sieniec; Wojciech Rytter πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 100 KB

## Abstract We present an __O__(__n__ log^4^__n__)‐time randomized algorithm for gossiping in radio networks with unknown topology. This is the first algorithm for gossiping in this model whose running time is only a polylogarithmic factor away from the optimum. The fastest previously known (determ

On adaptive deterministic gossiping in a
On adaptive deterministic gossiping in ad hoc radio networks
✍ Leszek GaΜ§sieniec; Andrzej Lingas πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 64 KB

We study deterministic algorithms for gossiping problem in ad hoc radio networks. The efficiency of communication algorithms in radio networks is very often expressed in terms of: maximum eccentricity D, maximum in-degree βˆ†, and size (number of nodes) n of underlying graph of connections. The maximu