Radio communication in random graphs

Journal of Computer and System Sciences

Volumn 72, Issue 3, 2006, Pages 490-506

  Elsasser R ^a   Gasieniec, L ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Radio broadcasting; Random graphs

Indexed keywords

ALGORITHMS; CENTRALIZED SIGNAL CONTROL; COMMUNICATION SYSTEMS; GRAPH THEORY; INFORMATION DISSEMINATION; OPTIMAL SYSTEMS; PROBLEM SOLVING;

RANDOM GRAPHS; RANDOM RADIO NETWORKS; RANDOMIZED DISTRIBUTED BROADCASTING ALGORITHM; RUNNING TIME;

RADIO BROADCASTING;

EID: 33645857968     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2005.09.003     Document Type: Article

References (24)

1. Bollobás B. Random Graphs (1985), Academic Press, New York
2. Brusci D., and Del Pinto M. Lower bounds for the broadcast problem in mobile radio networks. Distrib. Comput. 10 (1997) 129-135
3. Hui Chen, Threshold of broadcast in random graphs, DIMACS Technical Report, 97-12, 1997.
4. Chernoff H. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Statist. 23 (1952) 493-507
5. Chlamtac I., and Kutten S. On broadcasting in radio networks-problem analysis and protocol design. IEEE Trans. Commun. 33 (1985) 1240-1246
6. Chlebus B.S., Gasieniec L., Östlin A., and Robson J.M. Deterministic radio broadcasting. Proceedings of ICALP'00 (2000) 717-728
7. Chlebus B.S., Gasieniec L., Gibbons A., Pelc A., and Rytter W. Deterministic broadcasting in unknown radio networks. Proceedings of SODA'00 (2000) 861-870
8. Chrobak M., Gasieniec L., and Rytter W. Fast broadcasting and gossiping in radio networks. J. Algorithms 43 2 (2002) 177-189
9. Chung F.R.K., and Lu L. Connected components in random graphs with given expected degree sequences. Ann. Combin. 6 (2002) 125-145
10. Clementi A.E.F., Monti A., and Silvestri R. Selective families, superimposed codes, and broadcasting in unknown radio networks. Proceedings of SODA'01 (2001) 709-718
11. Diks K., Kranakis E., Krizanc D., and Pelc A. The impact of knowledge on broadcasting time in radio networks. Proceedings of ESA'99 (1999) 41-52
12. Elkin M., and Kortsarz G. Improved broadcast schedule for radio networks. Proceedings of SODA'05 (2005) 222-231
13. Elsässer R., Lorenz U., and Sauerwald T. Agent-based information handling in large networks. Proceedings of MFCS'04 (2004) 586-598
14. Erdos P., and Rényi A. On random graphs I. Publ. Math. Debrecen 6 (1959) 290-297
15. Erdos P., and Rényi A. On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci. 5 (1960) 17-61
16. Feige U., Peleg D., Raghavan P., and Upfal E. Randomized broadcast in networks. Random Struct. Algorithm 1 4 (1990) 447-460
17. Frieze A.M., and Molloy M. Broadcasting in random graphs. Discrete Appl. Math. 54 (1994) 77-79
18. Gaber I., and Mansour Y. Broadcast in radio networks. Proceedings of SODA'95 (1995) 577-585
19. Gilbert E.N. Random graphs. Ann. Math. Statist. 30 (1959) 1141-1144
20. Gasieniec L., Pagourtzis A., and Potapov I. Deterministic communication in radio networks with large labels. Proceedings of ESA'02 (2002) 512-524
21. L. Gasieniec, D. Peleg, Q. Xin, Faster centralised communication in radio networks, in: Proceedings of PODC'2005, pp. 129-137.
22. Hagerup T., and Rüb C. A guided tour of Chernoff bounds. Inform. Process. Lett. 36 6 (1990) 305-308
23. De Marco G., and Pelc A. Faster broadcasting in unknown radio networks. Inform. Process. Lett. 79 2 (2001) 53-56
24. Sen A., and Huson M.L. A new model for scheduling packet radio networks. Proceedings of 15th Annual Joint Conference of the IEEE Computer and Communication Societies (1996) 1116-1124