Minimizing broadcast latency and redundancy in ad hoc networks

Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

Volumn , Issue , 2003, Pages 222-232

  Gandhi, Rajiv ^a   Parthasarathy, Srinivasan ^a   Mishra, Arunesh ^a  

^a University of Maryland   (United States)

Author keywords

Ad hoc networks; Approximation algorithms; Broadcasting; NP hardness

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BROADCASTING; COMPUTATIONAL COMPLEXITY; MOBILE TELECOMMUNICATION SYSTEMS; REDUNDANCY; TELECOMMUNICATION CONTROL; THEOREM PROVING; WIRELESS TELECOMMUNICATION SYSTEMS;

AD HOC NETWORKS; BROADCAST LATENCY;

NETWORK PROTOCOLS;

EID: 0242527322     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/778440.778442     Document Type: Conference Paper

References (29)

1. Alon, N., Bar-Noy, A., Linial, N., and Peleg, D. A lower bound for radio broadcast. Journal of Computer and System Sciences 43, 2 (Oct. 1991), 290-298.
2. Bar-Yehuda, R., Goldreich, O., and Ital, A. On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. Journal of Computer and System Sciences 45 (1992), 104-126.
3. Basagni, S., Chlamtac, I., and Bruschi, D. A mobility-transparent deterministic broadcast mechanism for ad hoc networks. IEEE/ACM Transactions on Networking (TON) 7, 6 (1999), 799-807.
4. Bruschi, D., and Pinto, M. D. Lower bounds for the broadcast problem in mobile radio networks. Distributed Computing (1997), 129-135.
5. Cheng, X., Huang, X., Li, D., and Du, D.-Z. Polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks. Tech. rep.
6. Chlamtac, I., and Farago, A. Making transmission schedule immune to topology changes in multi-hop packet radio networks. IEEE/ACM Transactions on Networking (1994), 23-29.
7. Chlamtac, I., and Kutten, S. On broadcasting in radio networks - problem analysis and protocol design. IEEE Transactions on Communications 33, 12 (1985), 1240-1246.
8. Chlamtac, I., and Kutten, S. Tree-based broadcasting in multihop radio networks. IEEE Transactions on Computers 36, 10 (1987), 1209-1223.
9. Chlebus, B., Gasieniec, L., Gibbons, A., Pelc, A., and Rytter, W. Deterministic broadcasting in unknown radio networks. Distributed Computing (2002), 27-38.
10. Clark, B., Colbourn, C., and Johnson, D. Unit disk graphs. Discrete Mathematics 86 (1990), 165-177.
11. Das, B. and Bharghavan, V. Routing in ad-hoc networks using minimum connected dominating sets. In ICC (1) (1997), pp. 376-380.
12. Das, B., Sivakumar, R., and Bharghavan, V. Routing in ad-hoc networks using a virtual backbone. In 6th International Conference on Computer Communications and Networks (IC3N '97) (Sept. 1997), pp. 1-20.
13. Elkin, M., and Kortsarz, G. Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem. In Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (2002), ACM Press, pp. 438-447.
14. Guha, S., and Khuller, S. Approximation algorithms for connected dominating sets. Algorithmica (1998), 374-387.
15. Ho, C., Obraczka, K., Tsudik, G., and Viswanath, K. Flooding for reliable multicast in multi-hop ad hoc networks. In Proceedings of the International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM) (1999), pp. 64-71.
16. Hung, P.-K., Sheu, J.-P., and Hsu, C.-S. Scheduling of broadcasts in multihop wireless networks. In European Wireless (2002).
17. Jetcheva, J., Hu, Y., Maltz, D., and Johnson, D. A simple protocol for multicast and broadcast in mobile ad hoc networks, July 2001.
18. Kowalski, D. R., and Pelc, A. Deterministic broadcasting time in radio networks of unknown topology. In 43rd Annual Symposium on Foundations of Computer Science (FOCS) (2002), pp. 63-72.
19. Lim, H., and Kim, C. Multicast tree construction and flooding in wireless ad hoc networks. In Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems (2000), ACM Press, pp. 61-68.
20. Marathe, M. V., Breu, H., Hunt III, H. B., Ravi, S. S., and Rosenkrantz, D. J. Simple heuristics for unit disk graphs. Networks 25 (1995), 59-68.
21. Ni, S.-Y., Tseng, Y.-C., Chen, Y.-S., and Sheu, J.-P. The broadcast storm problem in a mobile ad hoc network. In Proceedings of the fifth annual ACM/IEEE international conference on Mobile computing and networking (1999), ACM Press, pp. 151-162.
22. Peng, W., and Lu, X. Efficient broadcast in mobile ad hoc networks using connected dominating sets. Journal of Software - Beijing, China (1999).
23. Peng,W., and Lu, X. Ahbp: An efficient broadcast protocol for mobile adhoc networks. Journal of Science and Technology - Beijing, China (2000).
24. Peng, W., and Lu, X.-C. On the reduction of broadcast redundancy in mobile adhoc networks. In Proceedings of First Annual Workshop on Mobile Ad Hoc Networking Computing. MobiHOC (Aug. 11, 2000).
25. Qayyum, A., Viennot, L., and Laouiti, A. Multipoint relaying: An efficient technique for flooding in mobile wireless networks. Tech. Rep. Research Report RR-3898, INRIA, Feb. 2000.
26. Sivakumar, R., Das, B., and Bharghavan, V. Spine routing in ad hoc networks. ACM/Baltzer Cluster Computing Journal (special issue on Mobile Computing) (1998).
27. Sucec, J., and Marsic, I. An efficient distributed network-wide broadcast algorithm for mobile adhoc networks. Tech. rep., Rutgers University, September 2000.
28. Wan, P.-J., Alzoubi, K., and Frieder, O. Distributed construction of connected dominating set in wireless ad hoc networks. In IEEE INFOCOM (2002).
29. Williams, B., and Camp, T. Comparison of broadcasting techniques for mobile ad hoc networks. In Proceedings of the third ACM international symposium on Mobile ad hoc networking and computing (2002), ACM Press, pp. 194-205.