Skip to main content

WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks


In this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in nature due to the mobility of nodes. The association and dissociation of nodes to and from clusters perturb the stability of the network topology, and hence a reconfiguration of the system is often unavoidable. However, it is vital to keep the topology stable as long as possible. The clusterheads, form a dominant set in the network, determine the topology and its stability. The proposed weight-based distributed clustering algorithm takes into consideration the ideal degree, transmission power, mobility, and battery power of mobile nodes. The time required to identify the clusterheads depends on the diameter of the underlying graph. We try to keep the number of nodes in a cluster around a pre-defined threshold to facilitate the optimal operation of the medium access control (MAC) protocol. The non-periodic procedure for clusterhead election is invoked on-demand, and is aimed to reduce the computation and communication costs. The clusterheads, operating in “dual” power mode, connects the clusters which help in routing messages from a node to any other node. We observe a trade-off between the uniformity of the load handled by the clusterheads and the connectivity of the network. Simulation experiments are conducted to evaluate the performance of our algorithm in terms of the number of clusterheads, reaffiliation frequency, and dominant set updates. Results show that our algorithm performs better than existing ones and is also tunable to different kinds of network conditions.

This is a preview of subscription content, access via your institution.


  1. A. Amis and R. Prakash, Load-balancing clusters in wireless ad hocnetworks, in: Proceedings of ASSET 2000, Richardson, TX, March 2000, pp. 25-32.

  2. D.J. Baker and A. Ephremides, A distributed algorithm for organizing mobile radio telecommunication networks, in: Proceedings of the 2nd International Conference on Distributed Computer Systems, April 1981, pp. 476-483.

  3. D.J. Baker and A. Ephremides, The architectural organization of a mobile radio network via a distributed algorithm, IEEE Transactions on Communications COM-29 11 (1981) 1694-1701.

    Google Scholar 

  4. S. Basagni, I. Chlamtac and A. Farago, A generalized clustering algorithm for peer-to-peer networks, in: Proceedings of Workshop on Algorithmic Aspects of Communication (satellite workshop of ICALP), July 1997.

  5. S. Basagni, Distributed clustering for ad hoc networks, in: Proceedings of International Symposium on Parallel Architectures, Algorithms and Networks, June 1999, pp. 310-315.

  6. S. Basagni, Distributed and mobility-adaptive clustering for multimedia support in multi-hop wireless networks, in: Proceedings of Vehicular Technology Conference, VTC, Vol. 2, 1999-Fall, pp. 889–893.

    Google Scholar 

  7. B. Bollbas, Random Graphs (Academic Press, 1985).

  8. M. Chatterjee, S.K. Das and D. Turgut, An on-demand weighted clustering algorithm (WCA) for ad hoc networks, in: Proceedings of IEEE GLOBECOM 2000, San Francisco, November 2000, pp. 1697-1701.

  9. I. Chlamtac and A. Farago, A new approach to the design and analysis of peer-to-peer mobile networks, Wireless Networks 5(3) (August 1999) 149–156.

    Google Scholar 

  10. A. Ephremides, J.E. Wieselthier and D.J. Baker, A design concept for reliable mobile radio networks with frequency hopping signaling, in: Proceedings of IEEE, Vol. 75(1) (1987) 56–73.

    Google Scholar 

  11. M. Gerla and J.T.C. Tsai, Multicluster, mobile, multimedia radio network, Wireless Networks 1(3) (1995) 255–265.

    Google Scholar 


  13. M. Joa-Ng and I.-T. Lu, A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks, IEEE Journal on Selected Areas in Communications (August 1999) 1415-1425.

  14. D.B. Johnson, Routing in ad hoc networks of mobile hosts, in: Proceedings of the IEEE Workshop on Mobile Computing Systems and Applications (December 1994) pp. 158-163.

  15. D.B. Johnson and D.A. Maltz, Dynamic source routing in ad hoc wireless networks, Mobile Computing, eds. T. Imielinski and H. Korth (Kluwer Academic Publishers, 1996) ch. 5, pp. 153-181.

  16. W.C.Y. Lee, Mobile Cellular Telecommunications (McGraw Hill, 1995).

  17. C.-H.R. Lin and M. Gerla, A distributed control scheme in multi-hop packet radio networks for voice/data traffic support, in: Proceedings of IEEE GLOBECOM (1995) pp. 1238-1242.

  18. C.-H.R. Lin and M. Gerla, A distributed architecture for multimedia in dynamic wireless networks, in: Proceedings of IEEE GLOBECOM (1995) pp. 1468-1472.

  19. A.B. McDonald and T.F. Znati, A mobility-based framework for adaptive clustering in wireless ad hoc networks, IEEE Journal on Selected Areas in Communications 17(8) (1999) 1466–1487.

    Google Scholar 

  20. A.K. Parekh, Selecting routers in ad-hoc wireless networks, in: Proceedings of the SBT/IEEE International Telecommunications Symposium, August 1994.

  21. L. Ramachandran, M. Kapoor, A. Sarkar and A. Aggarwal, Clustering algorithms for wireless ad hoc networks, in: Proceedings of Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Boston, August 2000, pp. 54-63.

  22. E.H.-K.Wu, J.T.-C. Tsai and M. Gerla, The effect of radio propagation on multimedia, mobile, multihop networks: models and countermeasures, in: Proceedings of IEEE Singapore International Conference on Networks, SICON'97.

Download references

Author information

Authors and Affiliations


Rights and permissions

Reprints and Permissions

About this article

Cite this article

Chatterjee, M., Das, S.K. & Turgut, D. WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks. Cluster Computing 5, 193–204 (2002).

Download citation

  • Issue Date:

  • DOI:

  • ad hoc networks
  • clusters
  • dominant set
  • load balancing