Clustering wireless ad hoc networks with weakly connected dominating set

Journal of Parallel and Distributed Computing

Volumn 67, Issue 6, 2007, Pages 727-737

  Han, Bo ^a   Jia, Weijia ^b  

^a University of Maryland   (United States)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

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

Indexed keywords

CELLULAR TELEPHONE SYSTEMS; CLUSTER ANALYSIS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; INFORMATION MANAGEMENT; NETWORK PROTOCOLS; PARALLEL ALGORITHMS;

CLUSTERING PROTOCOLS; MESSAGE COMPLEXITY; WEAKLY CONNECTED DOMINATING SETS (WCDS);

AD HOC NETWORKS;

EID: 34247518694     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2007.03.001     Document Type: Article

References (38)

1. Alzoubi K.M., Wan P.-J., and Frieder O. Maximal independent set, weakly connected dominating set, and induced spanners for mobile ad hoc networks. Internat. J. Found. Comput. Sci. 14 2 (2003) 287-303
2. Baker D.J., Ephremides A., and Flynn J.A. The design and simulation of a mobile radio network with distributed control. IEEE J. Select. Areas Commun. 2 1 (1984) 226-237
3. S. Basagni, Distributed clustering for ad hoc networks, in: Proceedings of I-SPAN'1999, June 1999, pp. 310-315.
4. S. Basagni, M. Mastrogiovanni, C. Petrioli, A performance comparison of protocols for clustering and backbone formation in large scale ad hoc network, in: Proceedings of the First IEEE International Conference on Mobile Ad Hoc and Sensor Systems (MASS'2004), October 2004, pp. 70-79.
5. M. Cardei, X. Cheng, X. Cheng, D.-Z. Du, Connected domination in ad hoc wireless networks, in: Proceedings of the Sixth International Conference on Computer Science and Informatics (CS&I'2002), March 2002.
6. Y.Z. Chen, A.L. Liestman, Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks, in: Proceedings of the Third ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc'2002), June 2002, pp. 157-164.
7. Chen Y.Z., and Liestman A.L. A zonal algorithm for clustering ad hoc networks. Internat. J. Found. Comput. Sci. 14 2 (2003) 305-322
8. Chen Y.Z., and Liestman A.L. Maintaining weakly-connected dominating sets for clustering ad hoc networks. Ad Hoc Networks 3 5 (2005) 629-642
9. C.C. Chiang, H.K. Wu, W. Liu, M. Gerla, Routing in clustered multihop, mobile wireless networks with fading channel, in: Proceedings of IEEE Singapore International Conference on Networks (SICON'1997), April 1997, pp. 197-211.
10. Dai F., and Wu J. An extended localized algorithm for connected dominating set formation in ad hoc wireless networks. IEEE Trans. Parallel Distributed Syst. 15 10 (2004) 908-920
11. Dai F., and Wu J. On constructing k-connected k-dominating set in wireless ad hoc and sensor networks. J. Parallel Distributed Comput. 66 (2006) 947-958
12. B. Das, R. Sivakumar, V. Bhargavan, Routing in ad-hoc networks using a spine, in: Proceedings of the Sixth International Conference on Computers and Communications Networks (ICCCN'1997), September 1997, IEEE Press, pp. 1-20.
13. V. Deverapalli, D. Sidhu, MZR: a multicast protocol for mobile ad hoc networks, in: Proceedings of IEEE ICC'2001, June 2001, pp. 886-891.
14. D. Dubhashi, A. Mei, A. Panconesi, J. Radhakrishnan, A. Srinivasan, Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons, in: Proceedings of SODA'2003, January 2003, pp. 717-724.
15. Dunbar J.E., Grossman J.W., Hattingh J.H., Hedetniemi S.T., and McRae A.A. On weakly connected domination in graphs. Discrete Math. 167-168 (1997) 261-269
16. Gallager R.G., Humblet P.A., and Spira P.M. A distributed algorithm for minimum-weight spanning tree. ACM Trans. Programming Languages Syst. 5 1 (1983) 66-77
17. Garey M., and Johnson D. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, New York
18. Gaspar Z., and Tarnai T. Upper bound of density for packing of equal circles in special domains in the plane. Period. Polytech. Ser. CIV. Eng. 44 1 (2000) 13-32
19. Gerla M., and Tsai J.T.-C. Multicluster, mobile, multimedia radio network. Wireless Networks 1 3 (1995) 255-265
20. Groemer H. Über die Einlagerung von Kreisen in einen konvexen Bereich. Mathematische 73 (1960) 285-294
21. Guha S., and Khuller S. Approximation algorithms for connected dominating sets. Algorithmica 20 4 (1998) 374-387
22. Gupta P., and Kumar P.R. The capacity of wireless networks. IEEE Trans. Inform. Theory 46 2 (2000) 388-404
23. Haas Z.J., and Pearlman M.R. The performance of query control schemes for the zone routing protocol. ACM/IEEE Trans. Networking 9 4 (2001) 427-438
24. M. Hauspie, A. Panier, D. Simplot-Ryl, Localized probabilistic and dominating set based algorithm for efficient information dissemination in ad hoc networks, in: Proceedings of the First IEEE International Conference on Mobile Ad Hoc and Sensor Systems (MASS'2004), October 2004, pp. 11-20.
25. Joa-Ng M., and Lu I.-T. A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks. IEEE J. Select. Areas Commun. 17 8 (1999) 1415-1425
26. Lin C.R., and Gerla M. Adaptive clustering for mobile wireless networks. IEEE J. Select. Areas Commun. 15 7 (1997) 1265-1275
27. 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
28. S. Meguerdichian, S. Slijepcevic, V. Karayan, M. Potkonjak, Localized algorithms in wireless ad-hoc networks: location discovery and sensor exposure, in: Proceedings of the Second ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc'2001), October 2001, pp. 106-116.
29. Rajaraman R. Topology control and routing in ad hoc networks: a survey. SIGACT News 33 2 (2002) 60-73
30. Rhee C., Dhall S.K., and Lakshmivarahan S. The minimum weight dominating set problem for permutation graphs is in NC. J. Parallel Distributed Comput. 28 (1995) 109-112
31. Stojmenovic I., Seddigh S., and Zunic J. Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks. IEEE Trans. Parallel Distributed Syst. 13 1 (2002) 14-25
32. P.-J. Wan, K. Alzoubi, O. Frieder, Distributed construction of connected dominating set in wireless ad hoc networks, in: Proceedings of IEEE INFOCOM'2002, vol. 3, June 2002, pp. 1597-1604.
33. Wang F.-H., Chang J.-M., Wang Y.-L., and Huang S.-J. Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars. J. Parallel Distributed Comput. 63 (2003) 481-487
34. Wang L., and Olariu S. A two-zone hybrid routing protocol for mobile ad hoc networks. IEEE Trans. Parallel Distributed Syst. 15 12 (2004) 1105-1116
35. Y. Wang, W. Wang, X.-Y. Li, Distributed low-cost backbone formation for wireless ad hoc networks, in: Proceedings of ACM MobiHoc'2005, May 2005, pp. 2-13.
36. B. White, J. Lepreau, L, Stoller, R. Ricci, S. Guruprasad, M. Newbold, M. Hibler, C. Barb, A. Joglekar, An Integrated Experimental Environment for Distributed Systems and Networks, in: Proceedings of OSDI'2002, December 2002, pp. 255-270.
37. J. Wu, F. Dai, A generic distributed broadcast scheme in ad hoc wireless networks, in: Proceedings of ICDCS'2003, May 2003, pp. 460-468.
38. J. Wu, H. Li, On calculating connected dominating set for efficient routing in ad hoc wireless networks, in: Proceedings of the Third ACM International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (ACM DIALM'1999), August 1999, pp. 7-14.