A zonal algorithm for clustering an hoc networks

International Journal of Foundations of Computer Science

Volumn 14, Issue 2, 2003, Pages 305-322

  Chen, Yuanzhu Peter ^a   Liestman, Arthur L ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Ad hoc network; Clustering; Weakly connected dominating set; Zonal algorithm

Indexed keywords

EID: 3042548790     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054103001741     Document Type: Article

References (20)

1. K. M. Alzoubi, P.-J. Wan, and O. Prieder. Distributed heuristics for connected dominating set in wireless ad hoc networks. KICS Journal of Communications and Networks, 4(1), March 2002.
2. K. M. Alzoubi, P.-J. Wan, and O. Prieder. Message-optimal connected dominating sets in mobile ad hoc networks. In The Third ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc'02), pages 157-164, June 2002.
3. K. M. Alzoubi, P.-J. Wan, and O. Frieder. New distributed algorithm for connected dominating set in wireless ad hoc networks. In IEEE HICSS35, January 2002.
4. S. Basagni. Distributed clustering for ad hoc networks. In Proc. ISPAN'99 Int. Symp. on Parallel Architectures, Algorithms, and Networks, pages 310-315, 1999.
5. A. A. Bertonssi. Dominating sets for split and bipartite graphs. Information processing letters, 19:37-40, 1984.
6. J. Broch, D. A. Maltz, D. B. Johnson, Y.-C. Hu, and J. Jetcheva. A performance comparison of multi-hop wireless ad hoc network routing protocols. In Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking, ACM, Dallas, TX, October 1998.
7. G. Chen and I. Stojmenovic. Clustering and routing in mobile wireless networks. Technical Report TR-99-05, SITE, June 1999.
8. Y. P. Chen and A. L. Liestman. Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks. In The Third ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc,02), pages 165-172, June 2002.
9. B. Das and V. Bharghavan. Routing in ad-hoc networks using minimum connected dominating sets. In IEEE International Conference on Communications (ICC'97), June 1997.
10. J. E. Dunbar, J. W. Grossman, J. H. Hattingh, S. T. Hedetniemi, and A. A. McRae. On weakly connected domination in graphs. Discrete Math., 167/168:261-269, 1997.
11. R. G. Gallager, P. A. Humblet, and P. M. Spira. A distributed algorithm for minimum-weight spanning tree. ACM Transactions on Programming Languages and Systems, 5(l):66-77, January 1983.
12. M. L. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco, 1979.
13. M. Gerla, T. J. Kwon, and G. Pei. On demand routing in large ad hoc wireless networks with passive clustering. In Proceedings of IEEE WCNC, September 2000.
14. M. Gerla and J. T.-C. Tsai. Multicluster, mobile, multimedia radio network. Wireless Networks, 1:255-265, 1995.
15. M. C. Golumbic. Algorithmic graph theory and perfect graphs. Academic Press, San Diego, CA, 1980.
16. S. Guha and S. Khuller. Approximation algorithms for connected dominating sets. Algorithmica, 20(4):374-387, 1998.
17. T. W. Haynes, S. T. Hedetniemi, and P. J. Slater. Fundamentals of Domination in graphs. Marcel Dekker, Inc., 1998.
18. E. M. Royer and C.-K. Toh. A review of current routing protocols for ad-hoc mobile wireless networks. IEEE Personal Communications, pages 46-55, 4 1999.
19. P.-J. Wan, K. M. Alzoubi, and O. Frieder. Distributed construction of connected dominating set in wireless ad hoc networks. In IEEE INFOCOM, June 2002.
20. J. Wu and H. Li. On calculating connected dominating set for efficient routing in ad hoc wireless networks. In DIAL M'99, Seattle, 1999.