Journal of Computer and System Sciences
Reliable broadcast in mobile multihop packet networks
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
Oblivious gossiping in ad-hoc radio networks
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
An Adaptive Protocol for Reliable Multicast in Mobile Multi-hop Radio Networks
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
ALOHA packet system with and without slots and capture
ACM SIGCOMM Computer Communication Review
Lower bounds for the broadcast problem in mobile radio networks
Distributed Computing
On selection problem in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Reliable Broadcast in Wireless Mobile Ad Hoc Networks
HICSS '06 Proceedings of the 39th Annual Hawaii International Conference on System Sciences - Volume 09
Theoretical Computer Science - Foundations of software science and computation structures
Broadcasting in geometric radio networks
Journal of Discrete Algorithms
Communication in dynamic radio networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Bounds for Deterministic Reliable Geocast in Mobile Ad-Hoc Networks
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Sensor network gossiping or how to break the broadcast lower bound
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Deterministic communication in the weak sensor model
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
On many-to-many communication in packet radio networks
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Opportunistic networking: data forwarding in disconnected mobile ad hoc networks
IEEE Communications Magazine
Mobility versus the cost of geocasting in mobile ad-hoc networks
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Coordinated consensus in dynamic networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
DISC'11 Proceedings of the 25th international conference on Distributed computing
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Gossiping in one-dimensional synchronous ad hoc wireless radio networks
Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems
Lower bounds on information dissemination in dynamic networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Reliable neighbor discovery for mobile ad hoc networks
Ad Hoc Networks
| Hi-index | 0.00 |
The topic of this paper is the study of Information Dissemination in Mobile Ad-hoc Networks by means of deterministic protocols. We characterize the connectivity resulting from the movement, from failures and from the fact that nodes may join the computation at different times with two values, α and β, so that, within α time slots, some node that has the information must be connected to some node without it for at least β time slots. The protocols studied are classified into three classes: oblivious (the transmission schedule of a node is only a function of its ID), quasi-oblivious (the transmission schedule may also depend on a global time), and adaptive. The main contribution of this work concerns negative results. Contrasting the lower and upper bounds derived, interesting complexity gaps among protocol-classes are observed. More precisely, in order to guarantee any progress towards solving the problem, it is shown that β must be at least n - 1 in general, but that β ∈ Ω(n2/ log n) if an oblivious protocol is used. Since quasi-oblivious protocols can guarantee progress with β ∈ O(n), this represents a significant gap, almost linear in β, between oblivious and quasi-oblivious protocols. Regarding the time to complete the dissemination, a lower bound of Ω(nα + n3/ log n) is proved for oblivious protocols, which is tight up to a polylogarithmic factor because a constructive Ω(nα + n3 log n) upper bound exists for the same class. It is also proved that adaptive protocols require Ω(nα + n2), which is optimal given that a matching upper bound can be proved for quasi-oblivious protocols. These results show that the gap in time complexity between oblivious and quasi-oblivious, and hence adaptive, protocols is almost linear. This gap is what we call the profit of global synchrony, since it represents the gain the network obtains from global synchrony with respect to not having it.