A lower bound for radio broadcast
Journal of Computer and System Sciences
Single round simulation on radio networks
Journal of Algorithms
Multiple communication im multihop radio networks
SIAM Journal on Computing
Journal of Computer and System Sciences
Wireless information networks
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Computation in noisy radio networks
Proceedings of the ninth 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
The Impact of Knowledge on Broadcasting Time in Radio Networks
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
A new model for scheduling packet radio networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Distributed coloring and communication in rings with local knowledge
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Gossiping with Bounded Size Messages in ad hoc Radio Networks
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Broadcasting with Universal Lists Revisited: Using Competitive Analysis
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Faster Deterministic Broadcasting in Ad Hoc Radio Networks
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A Randomized Algorithm for Gossiping in Radio Networks
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
On Randomized Broadcasting and Gossiping in Radio Networks
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
On Computing Ad-hoc Selective Families
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Deterministic Communication in Radio Networks with Large Labels
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Deterministic Radio Broadcasting at Low Cost
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Radio communication in random graphs
Journal of Computer and System Sciences - Special issue on network algorithms 2005
Fast Radio Broadcasting with Advice
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
On Radio Broadcasting in Random Geometric Graphs
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Broadcasting in UDG Radio Networks with Missing and Inaccurate Information
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Impact of Information on the Complexity of Asynchronous Radio Broadcasting
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Brief announcement: k-shot distributed broadcasting in radio networks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Broadcasting in unreliable radio networks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
An optimal algorithm of acknowledged broadcasting in ad hoc radio networks
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
Distributed Broadcast in Unknown Radio Networks
SIAM Journal on Computing
Improved lower bound for deterministic broadcasting in radio networks
Theoretical Computer Science
Time-efficient randomized multiple-message broadcast in radio networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
On many-to-many communication in packet radio networks
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Deterministic recurrent communication in restricted Sensor Networks
Theoretical Computer Science
Duplicate address detection in wireless ad hoc networks using wireless nature
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Waking up anonymous ad hoc radio networks
DISC'05 Proceedings of the 19th international conference on Distributed Computing
On efficient gossiping in radio networks
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Bounds on contention management in radio networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Round complexity of leader election and gossiping in bidirectional radio networks
Information Processing Letters
Oblivious k-shot broadcasting in ad hoc radio networks
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Oblivious k-shot broadcasting in ad hoc radio networks
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Information dissemination in unknown radio networks with large labels
Theoretical Computer Science
Hi-index | 0.01 |
We consider broadcasting in radio networks: one node of the network knows a message that needs to be learned by all the remaining nodes. We seek distributed deterministic algorithms to perform this task. Radio networks are modeled as directed graphs. They are unknown, in the sense that nodes are not assumed to know their neighbors, nor the size of the network, they are aware only of their individual identifying numbers. If more than one message is delivered to a node in a step then the node cannot hear any of them. Nodes cannot distinguish between such collisions and the case when no messages have been delivered in a step. The fastest previously known deterministic algorithm for deterministic distributed broadcasting in unknown radio networks was presented in [6], it worked in time O(n11/6). We develop three new deterministic distributed algorithms. Algorithm A develops further the ideas of [6] and operates in time O(n1:77291) = O(n9/5), for general networks, and in time O(n1+a+H(a)+o(1)) for sparse networks with in-degrees O(na) fora O(n3/2 log1/2 n) for general networks or O(n1+a+o(1)) for sparse networks. Algorithm C further improves the performance for general networks running in time O(n3/2).