Distributed heuristics for connected dominating sets in wireless ad hoc networks

Journal of Communications and Networks

Volumn 4, Issue 1, 2002, Pages 22-29

  Alzoubi, Khaled M ^a   Peng Jun, Wan ^a   Frieder, Ophir ^a  

^a Illinois Institute of Technology   (United States)

Author keywords

Ad hoc networks; Connected dominating set; Independent set; Leader election; Spanning tree

Indexed keywords

EID: 0038562914     PISSN: 12292370     EISSN: None     Source Type: Journal    
DOI: 10.1109/JCN.2002.6596929     Document Type: Article

References (18)

1. S. Guha and S. Khuller, "Approximation algorithms for connected dominating sets," Algorithmica, 20(4), pp. 374-387, Apr. 1998.
2. V. Bharghavan and B. Das, "Routing in ad hoc networks using minimum connected dominating sets," in Proc. Int. Conf. Commun.'97, Montreal, Canada. June 1997.
3. B. Das, R. Sivakumar, and V. Bhargavan, "Routing in ad-hoc networks using a spine," in Proc. Int. Conf. Comput. and Commun. Networks, Las Vegas, NV., Sept. 1997.
4. R. Sivakumar, B. Das, and V. Bharghavan, "An improved spine-based infrastructure for routing in ad hoc networks," in Proc. IEEE Symp. Comput. and Commun., Athens, Greece, June 1998.
5. J. Wu and H.L. Li, "On calculating connected dominating set for efficient routing in ad hoc wireless networks," in Proc. The 3rd ACM Int. Workshop Disc. Algor. and Methods for Mobile Computing and Commun., 1999, pp. 7-14.
6. B. N. Clark, C. J. Colbourn, and D. S. Johnson, "Unit disk graphs," Disc. Math., 86, pp. 165-177, 1990.
7. U. Feige, "A threshold of ln n for approximating set-cover," in Proc. 28th ACM Symp. Theory Comput., 1996, pp. 314-318.
8. C. Lund and M. Yannakakis, "On the hardness of approximating minimization problems," J. the ACM, 41(5), pp. 960-981, 1994.
9. M. V. Marathe et al., "Simple heuristics for unit disk graphs," Networks, vol. 25, pp. 59-68, 1995.
10. I. Stojmenovic, M. Seddigh, and J. Zunic, "Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks," in Proc. IEEE Hawaii Int. Conf. System Sciences, Jan. 2001.
11. M. Gerla and J. Tsai, "Multicluster, mobile, multimedia radio network," ACM-Baltzer J. Wireless Networks, vol.1, no.3, pp.255-265, 1995.
12. C.R. Lin and M. Gerla, "Adaptive clustering for mobile wireless networks," IEEE J. Select. Areas Commun., vol. 15, no. 7, pp. 1265-1275, Sept. 1997.
13. G. Chen and I. Stojmenovic, "Clustering and routing in wireless ad hoc networks," Technical Report TR-99-05, Computer Science, SITE, University of Ottawa, June 1999.
14. H. B. Hunt III et al., "NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs," J. Algorithms, 26(2), pp. 238-274, 1998.
15. D. S. Hochbaum and W. Maass, "Approximation schemes for covering and packing problems in image processing and VLSI," J. the ACM, 32(1), pp. 130-136, 1985.
16. B. S. Baker, "Approximation algorithms for NP-complete problems on planar graphs," J. the ACM, 41(1), pp. 153-180, 1994.
17. I. Cidon and O. Mokryn, "Propagation and leader election in multihop broadcast environment," in Proc. 12th Int. Symp. Distr. Computing, Greece, Sept. 1998, pp. 104-119.
18. K. M. Alzoubi, P.-J. Wan, and O. Frieder, "New distributed algorithm for connected dominating set in wireless ad hoc networks," HICSS35, Hawaii, Jan. 2002.