On radio broadcasting in random geometric graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5218 LNCS, Issue , 2008, Pages 212-226

  Elsässer, Robert ^a   Ga̧sieniec, Leszek ^b   Sauerwald, Thomas ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCASTING; COMPUTATIONAL GEOMETRY; DECODING; ENERGY EFFICIENCY; GRAPH THEORY; INFORMATION DISSEMINATION; PROBABILITY; PROBABILITY DENSITY FUNCTION; PROBABILITY DISTRIBUTIONS; RADIO TRANSMISSION; RANDOM PROCESSES; TELEVISION BROADCASTING;

ASYMPTOTICALLY OPTIMAL; BROADCASTING ALGORITHMS; CAN DESIGNS; COMMUNICATION NETWORKS; ENERGY-EFFICIENT; HIGH PROBABILITIES; POWER LAWS; PROBABILITY DENSITIES; RADIO NETWORKS; RANDOM GEOMETRIC GRAPHS; RANDOMIZED ALGORITHMS; RUNNING TIMES; STRONGLY CONNECTED; TRANSMISSION POWERS; TRANSMISSION RADIUSES;

RADIO BROADCASTING;

EID: 56449118881     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87779-0_15     Document Type: Conference Paper

References (31)

1. Berenbrink, P., Cooper, C., Hu, Z.: Energy efficient randomised communication in unknown adhoc networks. In: Proc. of 19th SPAA 2007, pp. 250-259 (2007)
2. Brusci, D., Pinto, M.D.: Lower bounds for the broadcast problem in mobile radio networks. Distributed Computing 10(3), 129-135 (1997)
3. Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat. 23, 493-507 (1952)
4. Chlamtac, I., Kutten, S.: On broadcasting in radio networks - problem analysis and protocol design. IEEE Transactions on Communications 33(12), 1240-1246 (1985)
5. Chlebus, B., Ga̧sieniec, L., Östlin, A., Robson, J.: Deterministic radio broadcasting. In: Welzl, E., Montanari, U., Rolim, J. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 717-728. Springer, Heidelberg (2000)
6. Chlebus, B., Ga̧sieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in ad hoc radio networks. Distributed Computing 15(1), 27-38 (2002)
7. Chrobak, M., GA̧sieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. Journal of Algorithms 43(2), 177-189 (2002)
8. Cicalese, F., Manne, F., Xin, Q.: Faster centralized communication in radio networks. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 339-348. Springer, Heidelberg (2006)
9. Clementi, A., Monti, A., Silvestri, R.: Distributed broadcast in radio networks with unknown topology. Theoretical Computer Science 302, 337-364 (2003)
10. Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. Journal of Algorithms 60(2), 115-143 (2006)
11. Czumaj, A., Wang, X.: Fast messgae dissemination in random geometric ad-hoc radio networks. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 220-231. Springer, Heidelberg (2007)
12. De Marco, G., Pelc, A.: Faster broadcasting in unknown radio networks. Information Processing Letters 79(2), 53-56 (2001)
13. Dessmark, A., Pelc, A.: Broadcasting in geometric radio networks. Journal of Discrete Algorithms 5, 187-201 (2007)
14. Elkin, M., Kortsarz, G.: An improved algorithm for radio broadcast. ACM Transactions on Algorithms 3(1) (2007)
15. Elsässer, R., Ga̧sieniec, L.: Radio communication in random graphs. Journal of Computer and Systems Sciences 72, 490-506 (2006)
16. Emek, Y., Ga̧sieniec, L., Kantor, E., Pelc, A., Peleg, D., Su, C.: Broadcasting in udg radio networks with unknown topology. In: Proc. of PODC 2007, pp. 195-204 (2007)
17. Gaber, I., Mansour, Y.: Centralized broadcast in multihop radio networks. Journal of Algorithms 46(1), 1-20 (2003)
18. Ganesan, D., Govindan, R., Shenker, S., Estrin, D.: Highly resilient, energy-efficient multipath routing in wireless sensor networks, ACM SIGMOBILE Mobile Computing and Communication Review 5(4), 11-25 (2001)
19. Ga̧sieniec, L., Pagourtzis, A., Potapov, I., Radzik, T.: Deterministic communication in radio networks with large labels. Algorithmica 47(1), 97-117 (2007)
20. Gia̧sieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. Distributed Computing 19(4), 289-300 (2007)
21. Hagerup, T., Rüb, C.: A guided tour of Chernoff bounds. Information Processing Letters 36(6), 305-308 (1990)
22. Ishizuka, M., Aida, M.: Achieving power-law placement in wireless sensor networks. In: Proc. of ISADS 2005, pp. 661-666 (2005)
23. Kowalski, D., Pelc, A.: Time of deterministic broadcasting in radio networks with local knowledge. SIAM Journal on Computing 33, 870-891 (2004)
24. Kowalski, D., Pelc, A.: Broadcasting in undirected ad hoc radio networks. Distributed Computing 18(1), 43-57 (2005)
25. Kowalski, D., Pelc, A.: Optimal deterministic broadcasting in known topology radio networks. Distributed Computing 19(3), 183-195 (2007)
26. Krishnamachari, B., Wicker, S., Bejar, R., Pearlman, M.: Critical density thresholds in distributed wireless networks. In: Communications, Information and Network Security. Kluwer Academic Publishers, Dordrecht (2002)
27. Lotker, Z., Navarra, A.: Managing random sensor networks by means of grid emulation. In: Boavida, F., Plagemann, T., Stiller, B., Westphal, C., Monteiro, E. (eds.) NETWORKING 2006. LNCS, vol. 3976, pp. 856-867. Springer, Heidelberg (2006)
28. Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.: Coverage problems in wireless ad-hoc sensor networks. In: Proc. of INFOCOM 2001, vol. 3, pp. 1380-1387 (2001)
29. Muthukrishnan, S., Pandurangan, G.: The bin-covering technique for thresholding geometric graph properties. In: Proc. of 16th SODA 2005, pp. 989-998 (2005)
30. Penrose, M.: Random Geometric Graphs. Oxford Studies in Probability (2003)
31. Sen, A., Huson, M.L.: A new model for scheduling packet radio networks. In: Proc. of INFOCOM 1996, pp. 1116-1124 (1996)