Maintaining weakly-connected dominating sets for clustering ad hoc networks

  • Authors:

  • Yuanzhu Peter Chen;Arthur L. Liestman

  • Affiliations:

  • School of Computing Science, Simon Fraser University, 8888 University Drive, Burnaby, BC, Canada V5A 1S6;School of Computing Science, Simon Fraser University, 8888 University Drive, Burnaby, BC, Canada V5A 1S6

  • Venue:
  • Ad Hoc Networks
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

An ad hoc network is a multihop wireless communication network supporting mobile users. Network performance degradation is a major problem as the network becomes larger. Clustering is an approach to simplify the network structure and thus alleviate the scalability problem. One method that has been proposed to form clusters is to use weakly-connected dominating sets [Y.P. Chen, 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), 2002, pp. 165-172; Y.P. Chen, A.L. Liestman, A zonal algorithm for clustering ad hoc networks, International Journal of Foundations of Computer Science 14(2) (2003) 305-322]. Here, we present a zonal distributed algorithm to maintain weakly-connected dominating sets as the network structure changes. When the zones are small, the algorithm is essentially localized; when the zones are large, it behaves more globally. The size of the weakly-connected dominating set obtained also varies depending on the choice of zone size, with larger zones generally resulting in smaller weakly-connected dominating sets. Experiments provide evidence that this maintenance algorithm keeps the size of the weakly-connected dominating set approximately the same as its initial size and does not compromise the network connectivity.