A lower bound for radio broadcast
Journal of Computer and System Sciences
Journal of Computer and System Sciences
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
Fast broadcasting and gossiping in radio networks
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Broadcasting in undirected ad hoc radio networks
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Broadcasting Algorithms in Radio Networks with Unknown Topology
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
ALOHA packet system with and without slots and capture
ACM SIGCOMM Computer Communication Review
Information dissemination in highly dynamic graphs
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
A mobility-management mechanism for broadcasting in unknown mobile ad hoc networks
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Theoretical Computer Science - Foundations of software science and computation structures
Communication in dynamic radio networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Flooding time in edge-Markovian dynamic graphs
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Parsimonious flooding in dynamic graphs
Proceedings of the 28th ACM symposium on Principles of distributed computing
Gradient clock synchronization in dynamic networks
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Distributed computation in dynamic networks
Proceedings of the forty-second ACM symposium on Theory of computing
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
DISC'10 Proceedings of the 24th international conference on Distributed computing
The impact of mobility on the geocasting problem in mobile ad-hoc networks: Solvability and cost
Theoretical Computer Science
Lower bounds for clear transmissions in radio networks
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Opportunistic networking: data forwarding in disconnected mobile ad hoc networks
IEEE Communications Magazine
| Hi-index | 0.00 |
In this paper the problem of information dissemination in Mobile Ad-hoc Networks (MANETs) is studied. The problem is to disseminate a piece of information, initially held by a distinguished source node, to all nodes in a target set. We assume a weak set of restrictions on the mobility of nodes, parameterized by α, the disconnection time, and β, the link stability time, such that the MANETs considered are connected enough for dissemination. Such a connectivity model generalizes previous models in that we assume much less connectivity, or make explicit the assumptions in previous papers. In MANETs, nodes are embedded in the plane and can move with bounded speed. Communication between nodes occurs over a collision-prone single channel. We show upper and lower bounds for different types of randomized protocols, parameterized by α and β. This problem has been extensively studied in static networks and for deterministic protocols. We show tight bounds on the randomized complexity of information dissemination in MANETs, for reasonable choices of α and β. We show that randomization reduces the time complexity of the problem by a logarithmic or linear factor, depending on the class of randomized protocol considered.