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
Routing in communications networks
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
Power consumption in packet radio networks
Theoretical Computer Science
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Deterministic Radio Broadcasting
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Centralized broadcast in multihop radio networks
Journal of Algorithms
Ad-hoc networks beyond unit disk graphs
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile 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
Improved approximation results for the minimum energy broadcasting problem
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Lower bounds for the broadcast problem in mobile radio networks
Distributed Computing
Tighter Bounds for the Minimum Energy Broadcasting Problem
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Maximal independent sets in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Coloring unstructured radio networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
An improved algorithm for radio broadcast
ACM Transactions on Algorithms (TALG)
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
Time efficient centralized gossiping in radio networks
Theoretical Computer Science
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
Broadcasting in UDG Radio Networks with Missing and Inaccurate Information
DISC '08 Proceedings of the 22nd international symposium on 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
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Energy and time efficient broadcasting in known topology radio networks
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Connectivity problem in wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
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 study here deterministic broadcasting in geometric radio networks(GRN) whose nodes have complete knowledge of the network. Nodes of a GRN are deployed in the Euclidean plane (R2) and each of them can transmit within some range rassigned to it. We adopt model in which ranges of nodes are non-uniform and they are drawn from the predefined interval 0 ≤ rmin≤ rmax. All our results are in the conflict-embodied modelwhere a receiving node must be in the range of exactly one transmitting node in order to receive the message.We derive several lower and upper bounds on the time of deterministic broadcasting in GRNs in terms of the number of nodes n, a distribution of nodes ranges, and the eccentricity Dof the source node (i.e., the maximum length of a shortest directed path from the source node to another node in the network). In particular:(1) We show that D+ 茂戮驴(log(n茂戮驴 D)) rounds are required to accomplish broadcasting in some GRN where each node has the transmission range set either to 1 or to 0. We also prove that the bound D+ 茂戮驴(log(n茂戮驴 D)) is almost tight providing a broadcasting procedure that works in this type of GRN in time D+ O(logn).(2) In GRNs with a wider choice of positive node ranges from rmin, ...,rmax, we show that broadcasting requires $D+\Omega (\min\{\log {\frac {r_{max}}{r_{min}}},\log (n-D)\})$ rounds and that it can be accomplished in $O (D\log^2 \frac {r_{max}} {r_{min}})$ rounds subsuming the best currently known upper bound $O (D (\frac {r_{max}} {r_{min}})^4)$ provided in [15].(3) We also study the problem of simulation of minimum energy broadcasting in arbitrary GRNs. We show that energy optimal broadcasting that can be completed in hrounds in a conflict-free modelmay require up to h/2 additional rounds in the conflict-embodied model. This lower bound should be seen as a separation result between conflict-free and conflict-embodied geometric radio networks. Finally, we also prove that any h-hop broadcasting algorithm with the energy consumption ${\cal E}$ in a GRN can be simulated within O(hlog茂戮驴) rounds in the conflict-embodied model using energy $O({\cal E})$, where 茂戮驴is the ratio between the largest and the shortest Euclidean distance between a pair of nodes in the network.