Efficient construction of weakly-connected dominating set for clustering wireless ad hoc networks

GLOBECOM - IEEE Global Telecommunications Conference

Volumn , Issue , 2006, Pages

  Han, Bo ^a   Jia, Weijia ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Clustering; Distributed algorithm; Dominating set; Weakly connected dominating set; Wireless ad hoc networks

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; PARALLEL ALGORITHMS;

DOMINATING SET; NETWORK TOPOLOGY; WEAKLY CONNECTED DOMINATING SET; WIRELESS AD HOC NETWORKS;

AD HOC NETWORKS;

EID: 50949088702     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2006.1003     Document Type: Conference Paper

References (25)

1. P. Gupta, and P. R. Kumar, "The Capacity of Wireless Networks", IEEE Transactions on Information Theory, vol. 46, no. 2, pp. 388-404, March 2000.
2. D.J. Baker and A. Ephremides, "The Architectureal Organization of a Mobile Radio Network via a Distributed Algorithm", IEEE Trans, on Communications, vol. 29, no. 11, pp. 1694-1701, Nov. 1981.
3. M. Gerla and J.T.-C. Tsai, "Multicluster, Mobile, Multimedia Radio Network", Wireless Networks, vol. 1, no. 3, pp. 255-265, 1995.
4. C.R. Lin and M. Gerla, "Adaptive Clustering for Mobile Wireless Networks", IEEE Journal on Selected Areas in Communications, vol. 15, no. 7, pp. 1265-1275, 1997.
5. S. Basagni, "Distributed clustering for ad hoc networks", Proc. of I-SPAN'1999, pp. 310-315, June 1999.
6. R. Rajaraman, "Topology control and routing in ad hoc networks: a survey", SIGACT News, vol. 33, no. 2, pp. 60-73, 2002.
7. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
8. V. Chvatal, "A greedy heuristic for the set-covering problem", Math of Operation Research, vol. 4, no. 3, pp. 233-235, 1979.
9. B. N. Clark, C. J. Colbourn, and D. S. Johnson, "Unit Disk Graphs", Discrete Mathematics, vol. 86, no. 1-3, pp. 165-177, 1990.
10. 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.
11. J. E. Dunbar, J.W. Grossman, J.H. Hattingh, S. T. Hedetniemi, and A. A. McRae, "On weakly connected domination in graphs", Discrete Mathematics, vol. 167-168, pp. 261-269, April 1997.
12. B. Das, R. Sivakumar, and V. Bhargavan, "Routing in ad-hoc networks using a spine", Proc. of ICCCN'1997, pp. 1-20, Sep. 1997.
13. S. Guha and S. Khuller, "Approximation algorithms for connected dominating sets", Algorithmica, vol. 20, no. 4, pp. 374-387, 1998.
14. J. Wu and H. Li, "On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks" Proc. of ACM DIALM'1999, pp. 7-14, August 1999.
15. I. Stojmenpvic, S. Seddigh, and J. Zunic, "Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks", IEEE Trans. on Parallel and Distributed Systems, vol. 13, no. 1, pp. 14-25, Jan. 2002.
16. P.-J. Wan, K. Alzoubi, and O. Frieder, "Distributed construction of connected dominating set in wireless ad hoc networks", Proc. of IEEE INFOCOM'2002, vol. 3, pp. 1597-1604, June 2002.
17. D. Dubhashi, A. Mei, A. Panconesi, J. Radhakrishnan, and A. Srinivasan, "Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons," Proc. of SODA'2003, pp. 717-724, January 2003.
18. S. Basagni, M. Mastrogiovanni and C. Petrioli, "A Performance Comparison of Protocols for Clustering and Backbone Formation in Large Scale Ad Hoc Network", Proc. of MASS'2004, pp. 70-79, October 2004.
19. Y. Z. Chen and A. L. Liestman, "Approximating Minimum Size Weakly-Connected Dominating Sets for Clustering Mobile Ad Hoc Networks", Proc. of MobiHoc'2002, pp. 157-164, June 2002.
20. Y. Z. Chen and A. L. Liestman, "A Zonal Algorithm for Clustering Ad Hoc Networks", International Journal of Foundations of Computer Science, vol.14 no. 2, pp. 305-322, April 2003.
21. K. M. Alzoubi, P.-J. Wan, O. Frieder, "Maximal Independent Set, Weakly Connected Dominating Set, and Induced Spanners for Mobile Ad Hoc Networks", International Journal of Foundations of Computer Science, vol. 14, no. 2, pp. 287-303, April 2003.
22. Z. Gaspar and T. Tarnai, "Upper bound of density for packing of equal circles in special domains in the plane", Periodica Polytechnica Ser. CIV. Eng., vol. 44, no. 1, pp. 13-32, 2000.
23. H. Groemer, "Über die Einlagerung von Kreisen in einen konvexen Bereich", Math. vol. 73, pp. 285-294, 1960.
24. Y. Z. Chen and A. L. Liestman, "Maintaining Weakly-Connected Dominating Sets for Clustering Ad Hoc Networks", Ad Hoc Networks, vol. 3, no. 5, pp. 629-642, September 2005.
25. B. Han and W. Jia, "Efficient Construction of Weakly-Connected Dominating Set for Clustering Wireless Ad Hoc Networks", Technical Report, Department of Computer Science, City University of Hong Kong, 2005.