𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Deterministic Broadcast and Gossiping Algorithms for Ad hoc Networks

✍ Scribed by Koushik Sinha; Pradip K. Srimani

Publisher
Springer US
Year
2006
Tongue
English
Weight
376 KB
Volume
37
Category
Article
ISSN
0920-8542

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Hypergossiping: A generalized broadcast
Hypergossiping: A generalized broadcast strategy for mobile ad hoc networks
✍ Abdelmajid Khelil; Pedro JosΓ© MarrΓ³n; Christian Becker; Kurt Rothermel πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 463 KB

Broadcasting is a commonly used communication primitive needed by many applications and protocols in mobile ad hoc networks (MANET). Unfortunately, most broadcast solutions are tailored to one class of MANETs with respect to node density and node mobility and are unlikely to operate well in other cl

Approximation Algorithms for Broadcastin
Approximation Algorithms for Broadcasting and Gossiping
✍ Pierre Fraigniaud; Sandrine Vial πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 152 KB

Broadcasting and gossiping are two basic communication patterns which commonly occur when programming parallel and distributed systems. This paper deals with approximation algorithms for solving these problems on arbitrary topologies. We present new strategies to derive efficient broadcasting and go