Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
From MaRDI portal
Publication:1938370
DOI10.1007/s00446-012-0165-9zbMath1284.68070OpenAlexW1998692792MaRDI QIDQ1938370
Alessia Milani, Antonio Fernández Anta, Miguel A. Mosteiro, Shmuel Zaks
Publication date: 4 February 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-012-0165-9
Related Items (5)
Polynomial anonymous dynamic distributed computing without a unique leader ⋮ A faster exact-counting protocol for anonymous dynamic networks ⋮ The cost of global broadcast in dynamic radio networks ⋮ Polynomial anonymous dynamic distributed computing without a unique leader ⋮ Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations
Cites Work
- Unnamed Item
- Unnamed Item
- Gradient clock synchronization in dynamic networks
- Deterministic recurrent communication in restricted sensor networks
- Broadcasting in geometric radio networks
- Broadcasting in dynamic radio networks
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
- Optimal lower bounds for some distributed algorithms for a complete network of processors
- Round robin is optimal for fault-tolerant broadcasting on wireless networks
- Approximate formulas for some functions of prime numbers
- Distributed computation in dynamic networks
- Flooding time in edge-Markovian dynamic graphs
- Time-Efficient Broadcast in Radio Networks
- Mobility Versus the Cost of Geocasting in Mobile Ad-Hoc Networks
- Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony
- Impossibility of distributed consensus with one faulty process
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- Parsimonious flooding in dynamic graphs
- On selection problem in radio networks
- Sensor Network Gossiping or How to Break the Broadcast Lower Bound
- Broadcasting in udg radio networks with unknown topology
- Communication in dynamic radio networks
- Automata, Languages and Programming
This page was built for publication: Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
