Multicast tree construction and flooding in wireless ad hoc networks

Proceedings of the 3rd ACM International Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems

Volumn , Issue , 2000, Pages 61-68

  Lim, Hyojun ^a   Kim, Chongkwon ^a  

^a Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCASTING; INFORMATION ANALYSIS; MULTICASTING; PACKET NETWORKS;

AD HOC NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 0034592688     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/346855.346865     Document Type: Conference Paper

References (23)

1. V. Park, S. Corson, A highly adaptive distributed routing algorithm for mobile wireless networks, INFOCOM 97 (1997) 1407-1415.
2. S. Basagni, D. Bruschi, I. Chlamtac, A mobility-transparent deterministic broadcast mechanism for ad hoc network, IEEE/ACM Transactions on Networking 7 (6) (1999) 799-807.
3. Z. J. Haas, A new routing protocol for the reconfigurable wireless networks, ICUPC 97 (1997) 562-566.
4. C. Perkins, E. M. Royer, Ad-hoc on-demand distance vector routing, 2nd IEEE Workshop on Mobile Computing Systems and Applications (1999) 3-12.
5. S. Guha, S. Khuller, Approximation algorithms for connected dominating sets, Algorithmica 20 (4) (1998) 374-387.
6. P. Sinha, R. Sivakumar, V. Bharghavan, CEDAR: A core-extraction distributed ad hoc routing algorithm, INFOCOM 99 (1999) 202-209.
7. A. S. Tanenbaum, Computer Networks: Third edition (Prentice Hall, 1996) 351-352.
8. D. B. Johnson, D. A. Maltz, Dynamic source routing in ad hoc wireless networks, Mobile Computing, Academic Publishers (1996) 153-181.
9. S. Even, Graph algorithms (Computer Science Press, 1979) 204-209.
10. T. H. Cormen, C. E. Leiserson, R. L. Rivest, Introduction to Algorithms (The MIT Press, 1990) 974-978.
11. E. M. Royer, C. Perkins, Multicast operation of the ad-hoc on-demand distance vector routing protocol, Mobicom 99 (1999) 207-218.
12. I. Chlamtac, S. Kutten, On broadcasting in radio networks-problem analysis and protocol design, IEEE Transactions on Communications 33 (12) (1985) 1240-1246.
13. S. Lee, M. Gerla, C.-C. Chiang, On-demand multicast routing protocol, WCNC 99 (1999) 1298-1302.
14. L. Lovasz, On the ratio of optimal integral and fractional covers, Discrete mathematics 13 (1975) 383-390.
15. R. Bar-Yehyda, O. Goldreich, A. Itali, On the time-complexity of broadcast in multihop radio networks, SIAM Journal on Computing 22 (4) (1993) 876-887.
16. C. J. Colbourn, L. K. Stewart, Permutation graphs: connected domination and Steiner trees, Discrete Mathematics 86 (1990), 179-189.
17. D. Lichtenstein, Planar formulae and their uses, SIAM Journal on Computing 11 (2) (1982) 329-343.
18. R. M. Karp, Reducibility among combinatorial problems, Complexity of computer computations (Plenum Press, 1972) 85-104.
19. E. Pagani, G. P. Rossi, Reliable broadcast in mobile multihop packet networks, Mobicom 97 (1997) 34-42.
20. K. Bharath-Kumar, J. M. Jaffe, Routing to multiple destinations in computer networks, IEEE Transactions on Communications 31 (3) (1983) 343-351.
21. S. Ni, Y. Tseung, Y. Chen, J. Sheu, The broadcast storm problem in a mobile ad hoc network, Mobicom 99 (1999) 151-162.
22. I. Chlamtac, O. Weinstein, The wave expansion approach to broadcasting in multihop radio networks, IEEE Transactions on Communications 39 (3) (1991) 426-433.
23. I. Chlamtac, S. Kutten, Tree-based broadcasting in multihop radio networks, IEEE Transactions on Computing 36 (10) (1987) 1209-1223.