Flooding in wireless ad hoc networks

Computer Communications

Volumn 24, Issue 3-4, 2001, Pages 353-363

  Lim, H ^a   Kim, C ^a  

^a Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONGESTION CONTROL (COMMUNICATION); PACKET NETWORKS; ROUTERS; TELECOMMUNICATION TRAFFIC; THEOREM PROVING;

WIRELESS AD HOC NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 0035865898     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(00)00233-4     Document Type: Article

References (19)

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