Deterministic sampling: a new technique for fast pattern matching
SIAM Journal on Computing
Multiple communication im multihop radio networks
SIAM Journal on Computing
An Ω(D log(N/D)) lower bound for broadcast in radio networks
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Journal of Computer and System Sciences
Randomized algorithms
Deterministic restrictions in circuit complexity
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Tree pattern matching and subset matching in deterministic O(n log3 n)-time
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Deterministic broadcasting in unknown radio networks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Deterministic Superimposed Coding with Applications to Pattern Matching
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Fast broadcasting and gossiping in radio networks
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
A Note on Counting Very Different Sequences
Combinatorics, Probability and Computing
Lower bounds for the broadcast problem in mobile radio networks
Distributed 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
On adaptive deterministic gossiping in ad hoc radio networks
Information Processing Letters
Gossiping with Bounded Size Messages in ad hoc Radio Networks
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Distributed broadcast in radio networks of unknown topology
Theoretical Computer Science
Round Robin is optimal for fault-tolerant broadcasting on wireless networks
Journal of Parallel and Distributed Computing
A better wake-up in radio networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
On selection problem in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Deterministic Broadcast and Gossiping Algorithms for Ad hoc Networks
The Journal of Supercomputing
Time efficient centralized gossiping in radio networks
Theoretical Computer Science
Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks
Journal of Parallel and Distributed Computing
Distributed computation in dynamic networks
Proceedings of the forty-second ACM symposium on Theory of computing
Broadcast and gossiping algorithms for mobile ad hoc networks based on breadth-first traversal
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
| Hi-index | 0.00 |
One of the most frequent tasks in multi-hop synchronous radio networks is the multi-broadcast operation: it consists in performing r independent message broadcasts through a network of n nodes. We investigate the case in which messages have logarithmic bounded size and the nodes have no knowledge of the topology (i.e. unknown networks).Let D and c be the maximum eccentricity and the congestion of the network, respectively. First, we prove an &OHgr;(c+(D+c/log c) log n) lower bound on the number of time-slots required to complete a multi-broadcast operation by any deterministic distributed protocol. Secondly, we prove an &OHgr;(c+(c/log c)log n + D log(n/D)) lower bound for randomized distributed protocols. An important consequence is that “perfect pipeline” is not achievable for both deterministic and randomized protocols.Finally, for any constant &agr; 0, we provide an O((D + c)d2 log(2+&agr;) n) deterministic upper bound for the same task where d is the maximum in-degree of the network. Our (non-constructive) deterministic distributed protocol is thus almost optimal when d = O(polylogn) and it can be converted into an efficiently constructible one having O((D + c)d2 log(3+&agr;) n) completion time.