Broadcasting in undirected ad hoc radio networks

Distributed Computing

Volumn 18, Issue 1, 2005, Pages 43-57

  Kowalski, Dariusz R ^a   Pelc, Andrzej ^b  

^a UNIVERSITY OF WARSAW   (Poland)

^b UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

Author keywords

Broadcasting; Deterministic; Distributed; Radio network; Randomized

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTER NETWORKS; NETWORKS (CIRCUITS); RANDOM PROCESSES;

DETERMINISTIC; DISTRIBUTED; RADIO NETWORK; RANDOMIZED;

RADIO BROADCASTING;

EID: 27844547602     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-005-0126-7     Document Type: Article

References (16)

1. N. Alon, A. Bar-Noy, N. Linial and D. Peleg, A lower bound for radio broadcast, Journal of Computer and System Sciences 43 (1991), 290-298
2. B. Awerbuch, A new distributed depth-first-search algorithm, Information Processing Letters 20 (1985), 147-150
3. R. Bar-Yehuda, O. Goldreich and A. Itai, On the time complexity of broadcast in radio networks: an exponential gap between determinism and randomization, Journal of Computer and System Sciences 45 (1992), 104-126
4. S. Basagni, D. Bruschi and I. Chlamtac, A mobility-transparent deterministic broadcast mechanism for ad hoc networks, IEEE/ACM Trans. on Networking 7 (1999), 799-807
5. D. Bruschi and M. Del Pinto, Lower bounds for the broadcast problem in mobile radio networks, Distributed Computing 10 (1997), 129-135
6. I. Chlamtac and O. Weinstein, The wave expansion approach to broadcasting in multihop radio networks, IEEE Trans. on Communications 39 (1991), 426-433
7. B. Chlebus, L. Ga̧sieniec, A. Gibbons, A. Pelc and W. Rytter, Deterministic broadcasting in unknown radio networks, Distributed Computing 15 (2002), 27-38.
8. B. Chlebus, L. Ga̧sieniec, A. Östlin and J.M. Robson, Deterministic radio broadcasting, Proc. 27th Int. Coll. on Automata, Languages and Programming (ICALP'2000), 717-728
9. M. Chrobak, L. Ga̧sieniec and W. Rytter, Fast broadcasting and gossiping in radio networks, Journal of Algorithms 43 (2002), 177-189
10. A.E.F. Clementi, A. Monti and R. Silvestri, Selective families, superimposed codes, and broadcasting on unknown radio networks, Proc. 12th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA'2001), 709-718
11. A. Czumaj and W. Rytter, Broadcasting algorithms in radio networks with unknown topology, Proc. 44th Ann.Symposium on Foundations of Computer Science (FOCS'2003), 492-501
12. I. Gaber and Y. Mansour, Centralized broadcast in multihop radio networks, Journal of Algorithms 46(1) (2003), 1-20
13. D. Kowalski and A. Pelc, Time of deterministic broadcasting in radio networks with local knowledge, SIAM Journal on Computing 33 (2004), 870-891
14. D. Kowalski and A. Pelc, Faster deterministic broadcasting in ad hoc radio networks, SIAM Journal on Discrete Mathematics 18 (2004), 332-346
15. D. Kowalski and A. Pelc, Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism, Theoretical Computer Science 333 (2005), 355-371
16. E. Kushilevitz and Y. Mansour, An Ω(D log(N/D)) lower bound for broadcast in radio networks, SIAM Journal on Computing 27 (1998), 702-712