Discrete Mathematics - Topics on domination
A lower bound for radio broadcast
Journal of Computer and System Sciences
Multiple communication im multihop radio networks
SIAM Journal on Computing
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
Efficient communication strategies for ad-hoc wireless networks (extended abstract)
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Deterministic broadcasting in unknown radio networks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Power consumption in packet radio networks
Theoretical Computer Science
Broadcasting in radio networks
Handbook of wireless networks and mobile computing
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Explicit constructions of selectors and related combinatorial structures, with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Fast broadcasting and gossiping in radio networks
Journal of Algorithms
On adaptive deterministic gossiping in ad hoc radio networks
Information Processing Letters
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Models and Techniques for Communication in Dynamic Networks
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Deterministic Superimposed Coding with Applications to Pattern Matching
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Distributed broadcast in radio networks of unknown topology
Theoretical Computer Science
Simple Routing Strategies for Adversarial Systems
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Round Robin is optimal for fault-tolerant broadcasting on wireless networks
Journal of Parallel and Distributed Computing
On the power assignment problem in radio networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Faster communication in known topology radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Feasibility and complexity of broadcasting with random transmission failures
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Broadcasting algorithms in radio networks with unknown topology
Journal of Algorithms
The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography
The Computer Journal
Broadcasting in geometric radio networks
Journal of Discrete Algorithms
| Hi-index | 0.00 |
We study deterministic fault-tolerant gossiping protocols in directed Geometric Radio Networks (in short, directed GRN). Unpredictable node and link faults may happen during every time slot of the protocol's execution. We first consider the single-message model where every node can send at most one message per time slot. We provide a protocol that, in any directed GRNGof n nodes, completes gossiping in O(nΔ) time (where Δ is the maximal in-degree of G) and hasmessage complexity O(n2). Both bounds are then shown to be optimal. As for the combined-message model, we give a protocol working in optimal completion time O(DΔ) (where D is the maximal source eccentricity) and message complexity O(Dn). Finally, our protocol performs the (single) broadcast operation within the same optimal time and optimal message complexity O(n).