A lower bound for radio broadcast
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Proceedings of the international workshop on Broadcasting and gossiping 1990
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Fault-tolerant broadcasting in radio networks
Journal of Algorithms
The impact of information on broadcasting time in linear radio networks
Theoretical Computer Science
Deterministic Radio Broadcasting
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Centralized broadcast in multihop radio networks
Journal of Algorithms
Fast broadcasting and gossiping in radio networks
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Deterministic broadcasting in ad hoc radio networks
Distributed Computing
Lower bounds for the broadcast problem in mobile radio networks
Distributed Computing
Improved schedule for radio broadcast
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Faster communication in known topology radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Broadcasting in undirected ad hoc radio networks
Distributed Computing - Special issue: PODC 02
Broadcasting algorithms in radio networks with unknown topology
Journal of Algorithms
Theoretical Computer Science - Foundations of software science and computation structures
Broadcasting in geometric radio networks
Journal of Discrete Algorithms
Broadcasting in udg radio networks with unknown topology
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Centralized asynchronous broadcast in radio networks
Theoretical Computer Science
Distributed broadcast in unknown radio networks
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On the effect of the deployment setting on broadcasting in Euclidean radio networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Optimal deterministic broadcasting in known topology radio networks
Distributed Computing
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
Hi-index | 0.00 |
We consider asynchronous deterministic broadcasting in radio networks. An execution of a broadcasting protocol is a series of events, each of which consists of simultaneous transmitting or delivering of messages. The aim is to transmit the source message to all nodes of the network. If two messages are delivered simultaneously to a node, a collision occurs and this node does not hear anything. An asynchronous adversary may delay message deliveries, so as to create unwanted collisions and interfere with message dissemination. The total number of message transmissions executed by a protocol in the worst case is called the work of the protocol, and is used as the measure of its complexity. The aim of this paper is to study how various types of information available to nodes influence the optimal work of an asynchronous broadcasting protocol. This information may concern past events possibly affecting the behavior of nodes (adaptive vs. oblivious protocols), or may concern the topology of the network or some of its parameters. We show that decreasing the knowledge available to nodes may cause exponential increase of work of an asynchronous broadcasting protocol, and in some cases may even make broadcasting impossible.