Collision detection in radio channels
Local area and multiple access networks
Tree-Based Broadcasting in Multihop Radio Networks
IEEE Transactions on Computers
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A lower bound for radio broadcast
Journal of Computer and System Sciences
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
Time-message trade-offs for the weak unison problem
CIAC '94 Proceedings of the second Italian conference on Algorithms and complexity
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Efficient communication strategies for ad-hoc wireless networks (extended abstract)
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
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
Tradeoffs between knowledge and time of communication in geometric radio networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
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
Distributed multi-broadcast in unknown radio networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Handbook of wireless networks and mobile computing
Broadcasting in radio networks
Handbook of wireless networks and mobile computing
Fast broadcasting and gossiping in radio networks
Journal of Algorithms
Efficient Reliable Real-Time Group Communication for Wireless Local Area Networks
EDCC-3 Proceedings of the Third European Dependable Computing Conference on Dependable Computing
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
Advanced Lectures on Networking, NETWORKING 2002 [This book presents the revised version of seven tutorials given at the NETWORKING 2002 Conference in Pisa, Italy in May 2002]
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
Centralized broadcast in multihop radio networks
Journal of Algorithms
Advanced lectures on networking
Minimizing broadcast latency and redundancy in ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Distributed broadcast in radio networks of unknown topology
Theoretical Computer Science
Broadcasting in undirected ad hoc radio networks
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Deterministic broadcasting in ad hoc radio networks
Distributed Computing
The wake-up problem in multi-hop radio networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A better wake-up in radio networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Radio communication in random graphs: extended abstract
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Radio communication in random graphs
Journal of Computer and System Sciences - Special issue on network algorithms 2005
Broadcasting in undirected ad hoc radio networks
Distributed Computing - Special issue: PODC 02
Theoretical Computer Science - Foundations of software science and computation structures
Deterministic M2M multicast in radio networks
Theoretical Computer Science
Broadcasting in geometric radio networks
Journal of Discrete Algorithms
Journal of Discrete Algorithms
Acknowledged broadcasting and gossiping in ad hoc radio networks
Theoretical Computer Science
Broadcasting in udg radio networks with unknown topology
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks
Journal of Parallel and Distributed Computing
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
Minimizing broadcast latency and redundancy in ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Acknowledged broadcasting in ad hoc radio networks
Information Processing Letters
Bounds for Deterministic Reliable Geocast in Mobile Ad-Hoc Networks
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Impact of Information on the Complexity of Asynchronous Radio Broadcasting
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Optimal deterministic broadcasting in known topology radio networks
Distributed Computing
Fast radio broadcasting with advice
Theoretical Computer Science
Sensor network gossiping or how to break the broadcast lower bound
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
Minimum-latency gossiping in multi-hop wireless mesh networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Broadcasting in unreliable radio networks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
IEEE Transactions on Wireless Communications
Reliable neighbor discovery for mobile ad hoc networks
Proceedings of the 6th International Workshop on Foundations of Mobile 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
An optimal algorithm of acknowledged broadcasting in ad hoc radio networks
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
The impact of mobility on the geocasting problem in mobile ad-hoc networks: Solvability and cost
Theoretical Computer Science
Improved lower bound for deterministic broadcasting in radio networks
Theoretical Computer Science
Interference-aware broadcast scheduling in wireless networks
Ad Hoc Networks
The impact of mobility on the time complexity for deterministic broadcasting in radio networks
International Journal of Ad Hoc and Ubiquitous Computing
Maintaining information about nearby processors in a mobile environment
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Low-Latency broadcast scheduling in ad hoc networks
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Mobility tolerant broadcast in mobile ad hoc networks
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Waking up anonymous ad hoc radio networks
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound)
Theoretical Computer Science
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
Reliable neighbor discovery for mobile ad hoc networks
Ad Hoc Networks
Information dissemination in unknown radio networks with large labels
Theoretical Computer Science
Hi-index | 0.01 |
In this paper, we prove a lower bound on the number of rounds required by a deterministic distributed protocol for broadcasting a message in radio networks whose processors do not know the identities of their neighbors. Such an assumption captures the main characteristic of mobile and wireless environments [3], i.e., the instability of the network topology. For any distributed broadcast protocol II, for any n and for any D ≤ n/2, we exhibit a network G with n nodes and diameter D such that the number of rounds needed by H for broadcasting a message in G is Ω(D log n). The result still holds even if the processors in the network use a different program and know n and D. We also consider the version of the broadcast problem in which an arbitrary number of processors issue at the same time an identical message that has to be delivered to the other processors. In such a case we prove that, even assuming that the processors know the network topology, Ω(n) rounds are required for solving the problem on a complete network (D=1) with n processors.