Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/broadcasting-in-undirected-ad-hoc-radio-networks-3o1v2ojeOD
References (28)
-
There exists p < k/2 such that ]Bz(p)[ _> k ¢ / ~ -
R. Bar-Yehuda, O. Goldreich, A. Itai (1992)
On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and RandomizationJ. Comput. Syst. Sci., 45
-
D. Kowalski, A. Pelc (2003)
Faster Deterministic Broadcasting in Ad Hoc Radio Networks -
E. Kushilevitz, Y. Mansour (1998)
An Omega(D log (N/D)) Lower Bound for Broadcast in Radio NetworksSIAM J. Comput., 27
-
Set ti+l := ti + 1 -
A. Clementi, A. Monti, R. Silvestri (2001)
Selective families, superimposed codes, and broadcasting on unknown radio networks -
I. Chlamtac (1991)
The wave expansion approach to broadcasting in multihop radio networksIEEE Trans. Commun., 39
-
B. Awerbuch (1985)
A New Distributed Depth-First-Search AlgorithmInf. Process. Lett., 20
-
@BULLET for other nodes v, define/l~/,i+l(v ) as the empty message -
D. Bruschi, M. Pinto (1997)
Lower bounds for the broadcast problem in mobile radio networksDistributed Computing, 10
-
D. Kowalski, A. Pelc (2004)
Time of Deterministic Broadcasting in Radio Networks with Local KnowledgeSIAM J. Comput., 33
-
S. Basagni, I. Chlamtac, D. Bruschi (1999)
A mobility-transparent deterministic broadcast mechanism for ad hoc networksIEEE/ACM Trans. Netw., 7
-
D. Kowalski, A. Pelc (2005)
Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinismTheor. Comput. Sci., 333
-
Bogdan Chlebus, L. Gąsieniec, A. Gibbons, A. Pelc, W. Rytter (2002)
Deterministic broadcasting in ad hoc radio networksDistributed Computing, 15
-
Iris Gaber-Rosenblum, Y. Mansour (1995)
Broadcast in radio networks -
Bogdan Chlebus, L. Gąsieniec, A. Gibbons, A. Pelc, W. Rytter (2000)
Deterministic broadcasting in unknown radio networks -
D. Kowalski, A. Pelc (2002)
Deterministic broadcasting time in radio networks of unknown topologyThe 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
-
E. Kushilevitz, Y. Mansour (1993)
An Ω(D log(N/D)) lower bound for broadcast in radio networks -
A. Clementi, A. Monti, R. Silvestri (2001)
Distributed multi-broadcast in unknown radio networks -
Bogdan Chlebus, L. Gąsieniec, A. Pagh, J. Robson (2000)
Deterministic Radio Broadcasting -
N. Alon, A. Bar-Noy, N. Linial, D. Peleg (1991)
A Lower Bound for Radio BroadcastJ. Comput. Syst. Sci., 43
-
M. Chrobak, L. Gąsieniec, W. Rytter (2000)
Fast broadcasting and gossiping in radio networksProceedings 41st Annual Symposium on Foundations of Computer Science
-
R. Bar-Yehuda, Oded Goldreich, A. Itai (1987)
On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization -
Iris Gaber-Rosenblum, Y. Mansour (2003)
Centralized broadcast in multihop radio networksJ. Algorithms, 46
-
M. Chrobak, L. Gasieniec, W. Rytter (2002)
Fast broadcasting and gossiping in radio networksJournal of Algorithms, 43
-
B~(p) C BL-i(P), for all p < k/2 -
For every node v E Ri+2 and step 0 < l' < ti+~, define H~, (v) as the empty history -
A. Czumaj, W. Rytter (2003)
Broadcasting algorithms in radio networks with unknown topology44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
- Publisher
- Springer Journals
- Copyright
- Copyright © 2005 by Springer-Verlag Berlin/Heidelberg
- Subject
- Computer Science; Computer Hardware; Computer Systems Organization and Communication Networks; Software Engineering/Programming and Operating Systems; Theory of Computation; Computer Communication Networks
- ISSN
- 0178-2770
- eISSN
- 1432-0452
- DOI
- 10.1007/s00446-005-0126-7
- Publisher site
- See Article on Publisher Site
Abstract
We consider distributed broadcasting in radio networks, modeled as undirected graphs, whose nodes have no information on the topology of the network, nor even on their immediate neighborhood. For randomized broadcasting, we give an algorithm working in expected time $ {\user1{\mathcal{O}}}{\left( {D\;\log {\left( {n/D} \right)} + \log ^{2} n} \right)} $ in n-node radio networks of diameter D, which is optimal, as it matches the lower bounds of Alon et al. [1] and Kushilevitz and Mansour [16]. Our algorithm improves the best previously known randomized broadcasting algorithm of Bar-Yehuda, Goldreich and Itai [3], running in expected time $ {\user1{\mathcal{O}}}{\left( {D\;\log n + \log ^{2} n} \right)} $ . (In fact, our result holds also in the setting of n-node directed radio networks of radius D.) For deterministic broadcasting, we show the lower bound $\Omega (n \frac{\log n}{\log (n/D)})$ on broadcasting time in n-node radio networks of diameter D. This implies previously known lower bounds of Bar-Yehuda, Goldreich and Itai [3] and Bruschi and Del Pinto [5], and is sharper than any of them in many cases. We also give an algorithm working in time $ {\user1{\mathcal{O}}}{\left( {n\log n} \right)} $ , thus shrinking - for the first time - the gap between the upper and the lower bound on deterministic broadcasting time to a logarithmic factor.
Journal
Distributed Computing – Springer Journals
Published: Jan 1, 2005