Minimizing broadcast latency and redundancy in ad hoc networks

IEEE/ACM Transactions on Networking

Volumn 16, Issue 4, 2008, Pages 840-851

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

^a RUTGERS UNIVERSITY   (United States)

^b University of Wisconsin Madison   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Ad Hoc networking; Approximation algorithms; Broadcast algorithms; Wireless scheduling

Indexed keywords

BROADCASTING; DECODING; NUCLEAR PROPULSION; RADIO; RADIO BROADCASTING; TRANSMISSIONS; TURBO CODES; WIRELESS TELECOMMUNICATION SYSTEMS;

AD HOC NETWORKING; APPROXIMATION ALGORITHMS; BROADCAST ALGORITHMS; BROADCASTING ALGORITHMS; EXPERIMENTAL STUDIES; MULTIPLE MESSAGES; MULTIPLE SOURCES; NETWORK-WIDE BROADCASTING; NODE TRANSMISSION; NP-COMPLETE; OPTIMAL VALUES; SOURCE NODES; WIRELESS SCHEDULING; WORST CASE;

AD HOC NETWORKS;

EID: 50149093082     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2007.905588     Document Type: Article

References (31)

1. S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu, "The broadcast storm problem in a mobile ad hoc network," in Proc. 5th Annu. ACM/IEEE Int. Mobile Comput. Netw. Conf., 1999, pp. 151-162.
2. C. Ho, K. Obraczka, G. Tsudik, and K. Viswanath, "Flooding for reliable multicast in multi-hop ad hoc networks," in Proc. Int. Disc. Alg. and Method for Mobile Comput. Commun. Workshop, 1999, pp. 64-71.
3. J. Jetcheva, Y. Hu, D. Maltz, and D. Johnson, "A simple protocol for multicast and broadcast in mobile ad hoc networks," IETF MANET Working Group, Internet draft, 2001.
4. R. Sivakumar, B. Das, and V. Bharghavan, "Spine-based routing in ad hoc networks," ACM/Baltzer Cluster Comput. J., Special Issue on Mobile Computing, vol. 1, pp. 237-248, Nov. 1998.
5. B. Das, R. Sivakumar, and V. Bharghavan, "Routing in ad hoc networks using a virtual backbone," in Proc. 6th Int. Comput. Commun. and Netw. Conf., 1997, pp. 1-20.
6. B. Das and V. Bharghavan, "Routing in ad hoc networks using minimum connected dominating sets," in Proc. IEEE Int. Commun. Conf., 1997, vol. 1, pp. 376-380.
7. D. Lichtenstein, "Planar formulae and their uses," SIAM J. Comput. vol. 11, pp. 329-343, 1982.
8. B. Clark, C. Colbourn, and D. Johnson, "Unit disk graphs," Discrete Mathematics, vol. 86, pp. 165-177, 1990.
9. P.-J. Wan, K. M. Alzoubi, and O. Frieder, "Distributed construction of connected dominating set in wireless ad hoc networks," Mobile Networks and Applications, vol. 9, no. 2, pp. 141-149, Apr. 2004.
10. X. Cheng, X. Huang, D. Li, and D.-Z. Du, "Polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks," Networks, vol. 42, no. 4, pp. 202-208, 2003.
11. M. V. Marathe, H. Breu, H. B. Hunt, III, S. S. Ravi, and D. J. Rosenkrantz, "Simple heuristics for unit disk graphs," Networks, vol. 25, pp. 59-68, 1995.
12. H. Lim and C. Kim, "Multicast tree construction and flooding in wireless ad hoc networks," in Proc. 3rd ACM Int. Modeling, Anal., Simulation of Wireless and Mobile Syst. Workshop, 2000, pp. 61-68.
13. W. Peng and X.-C. Lu, "On the reduction of broadcast redundancy in mobile ad hoc networks," in Proc. 1st ACM Int. Symp. Mobile Ad Hoc Networking and Computing, Aug. 2000, pp. 129-130, Poster Session.
14. A. Qayyum, L. Viennot, and A. Laouiti, "Multipoint relaying: An efficient technique for flooding in mobile wireless networks," INRIA, Le Chesnay, France, Tech. Res. Rep. RR-3898, Feb. 2000.
15. W. Peng and X.-C. Lu, "AHBP: An efficient broadcast protocol for mobile ad hoc networks," J. Comput. Sci. Technol., vol. 16, no. 2, pp. 114-125, 2001.
16. J. Sucec and I. Marsic, "An efficient distributed network-wide broadcast algorithm for mobile ad hoc networks," Rutgers Univ., New Brunswick, NJ, Tech. Rep., 2000.
17. W. Peng and X. Lu, "Efficient broadcast in mobile ad hoc networks using connected dominating sets," J. Softw., vol. 12, no. 4, pp. 529-536, 2001.
18. I. Stojmenovic, M. Seddigh, and J. Zunic, "Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks," IEEE Trans. Parallel Distrib. Syst., vol. 13, no. 1, pp. 14-25, Jan. 2002.
19. L. Orecchia, A. Panconesi, C. Petrioli, and A. Vitaletti, "Localized techniques for broadcasting in wireless sensor networks," in DIALM-POMC'04: Proc. Joint Foundations Mobile Comput. Workshop, New York, NY, 2004, pp. 41-51.
20. H. F. Salama, D. S. Reeves, and Y. Viniotis, "The delay-constrained minimum spanning tree problem," in 2nd IEEE Comput. Soc. Comput. Commun. Symp., 1997, pp. 699-704.
21. I. Chlamtac and S. Kutten, "On broadcasting in radio networks - Problem analysis and protocol design," IEEE Trans. Commun., vol. COM-33, no. 12, pp. 1240-1246, Dec. 1985.
22. I. Chlamtac and S. Kutten, "Tree-based broadcasting in multihop radio networks," IEEE Trans. Comput., vol. C-36, no. 10, pp. 1209-1223, Oct. 1987.
23. S. Basagni, I. Chlamtac, and D. Bruschi, "A mobility-transparent deterministic broadcast mechanism for ad hoc networks," IEEE/ACM Trans. Netw., vol. 7, no. 6, pp. 799-807, Jun. 1999.
24. I. Chlamtac and A. Farago, "Making transmission schedule immune to topology changes in multi-hop packet radio networks," IEEE/ACM Trans. Netw., vol. 2, no. 1, pp. 23-29, Jan. 1994.
25. B. S. Chlebus, L. Gasieniec, A. Gibbons, A. Pelc, and W. Rytter, "Deterministic broadcasting in ad hoc radio networks," Distrib. Comput., vol. 15, no. 1, pp. 27-38, Jan. 2002.
26. J.-P. Sheu, P.-K. Hung, and C.-S. Hsu, "Scheduling of broadcasts in multihop wireless networks,"in The Handbook of Ad Hoc Wireless Networks. Boca Raton, FL: CRC Press, 2003, pp. 483-495.
27. B. Williams and T. Camp, "Comparison of broadcasting techniques for mobile ad hoc networks," in Proc. 3rd ACM Int. Mobile Ad Hoc Netw. Comput. Symp., 2002, pp. 194-205.
28. R. Bar-Yehuda, O. Goldreich, and A. Itai, "On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization," J. Comput. Syst. Sci., vol. 45, pp. 104-126, 1992.
29. N. Alon, A. Bar-Noy, N. Linial, and D. Peleg, "A lower bound for radio broadcast," J. Comput. Syst. Sci., vol. 43, no. 2, pp. 290-298, 1991.
30. D. Bruschi and M. D. Pinto, "Lower bounds for the broadcast problem in mobile radio networks," Distrib. Comput., pp. 129-135, 1997.
31. D. R. Kowalski and A. Pelc, "Deterministic broadcasting time in radio networks of unknown topology," in 43rd Annu. Foundations Comput. Sci. Symp., 2002, pp. 63-72.