Tree-Based Broadcasting in Multihop Radio Networks
IEEE Transactions on Computers
A trade-off between information and communication in broadcast protocols
Journal of the ACM (JACM)
A lower bound for radio broadcast
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Making transmission schedules immune to topology changes in multi-hop packet radio networks
IEEE/ACM Transactions on Networking (TON)
Proceedings of the international workshop on Broadcasting and gossiping 1990
Time-spread multiple-access (TSMA) protocols for multihop mobile radio networks
IEEE/ACM Transactions on Networking (TON)
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
A mobility-transparent deterministic broadcast mechanism for ad hoc networks
IEEE/ACM Transactions on Networking (TON)
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
Tradeoffs between knowledge and time of communication in geometric radio networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Faster broadcasting in unknown radio networks
Information Processing Letters
The impact of information on broadcasting time in linear radio networks
Theoretical Computer Science
Fast broadcasting and gossiping in radio networks
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Broadcasting in undirected ad hoc radio networks
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Broadcasting Algorithms in Radio Networks with Unknown Topology
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Deterministic broadcasting in ad hoc radio networks
Distributed Computing
Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
SIAM Journal on Computing
Faster Deterministic Broadcasting in Ad Hoc Radio Networks
SIAM Journal on Discrete Mathematics
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
Feasibility and complexity of broadcasting with random transmission failures
Proceedings of the twenty-fourth annual 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
A perspective on multiaccess channels
IEEE Transactions on Information Theory
Broadcasting in udg radio networks with unknown topology
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Trade-offs between the size of advice and broadcasting time in trees
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
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
Maximum Finding in the Symmetric Radio Networks with Collision Detection
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Fast Radio Broadcasting with Advice
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Communication in Random Geometric Radio Networks with Positively Correlated Random Faults
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
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
Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Acknowledged broadcasting in ad hoc radio networks
Information Processing Letters
Impact of Information on the Complexity of Asynchronous Radio Broadcasting
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Fast radio broadcasting with advice
Theoretical Computer Science
Fast message dissemination in random geometric ad-hoc radio networks
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Time-efficient broadcasting in radio networks: a review
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
What is the use of collision detection (in wireless networks)?
DISC'10 Proceedings of the 24th international conference on Distributed computing
Connectivity problem in wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
DISC'10 Proceedings of the 24th international conference on Distributed computing
Broadcasting in sensor networks of unknown topology in the presence of swamping
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Optimal gossiping in directed geometric radio networks in presence of dynamical faults
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Distributed backbone structure for algorithms in the SINR model of wireless networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound)
Theoretical Computer Science
Distributed deterministic broadcasting in wireless networks of weak devices
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Distributed deterministic broadcasting in uniform-power ad hoc wireless networks
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
We consider deterministic broadcasting in geometric radio networks (GRN) whose nodes know only a limited part of the network. Nodes of a GRN are situated in the plane and each of them is equipped with a transmitter of some range r. A signal from this node can reach all nodes at distance at most r from it but if a node u is situated within the range of two nodes transmitting simultaneously, then a collision occurs at u and u cannot get any message. Each node knows the part of the network within knowledge radius s from it, i.e., it knows the positions, labels and ranges of all nodes at distance at most s. The aim of this paper is to study the impact of knowledge radius s on the time of deterministic broadcasting in a GRN with n nodes and eccentricity D of the source. Our results show sharp contrasts between the efficiency of broadcasting in geometric radio networks as compared to broadcasting in arbitrary graphs. They also show quantitatively the impact of various types of knowledge available to nodes on broadcasting time in GRN. Efficiency of broadcasting is influenced by knowledge radius, knowledge of individual positions when knowledge radius is zero, and awareness of collisions.