Broadcasting in Undirected Ad hoc Radio Networks

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 22, Issue , 2003, Pages 73-82

  Kowalski, Dariusz R ^a   Pelc, Andrzej ^b  

^a UNIVERSITY OF WARSAW   (Poland)

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

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; MATHEMATICAL MODELS; RADIO BROADCASTING; RADIO RECEIVERS; SET THEORY; THEOREM PROVING;

BROADCASTING ALGORITHMS; RADIO NETWORKS;

TELECOMMUNICATION NETWORKS;

EID: 1142305230     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/872035.872045     Document Type: Conference Paper

References (14)

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, Inf. Proc. Lett. 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, Distr. Comp. 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, Proc. 41st Symposium on Foundations of Computer Science (FOCS'2000), 575-581.
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. I. Gaber and Y. Mansour, Broadcast in radio networks, Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'1995), 577-585.
12. D. Kowalski and A. Pelc, Deterministic broadcasting time in radio networks of unknown topology, Proc. 43rd Ann. IEEE Symp. on Foundations of Computer Science (FOCS'2002), 63-72.
13. D. Kowalski and A. Pelc, Faster deterministic broadcasting in ad hoc radio networks, Proc. 20th Ann. Symp. on Theoretical Aspects of Computer Science (STACS'2003), LNCS 2607, 109-120.
14. E. Kushilevitz and Y. Mansour, An Ω(D log(N/D)) lower bound for broadcast in radio networks, SIAM J. Comp. 27 (1998), 702-712.