Survey of clustering algorithms for MANET
Ratish Agarwal, Dr. Mahesh Motwani

TL;DR
This survey reviews various clustering algorithms for mobile ad hoc networks, highlighting their classification, challenges due to node mobility, and strategies for efficient cluster management.
Contribution
It provides a systematic classification and analysis of existing clustering schemes for MANETs, aiding understanding and future improvements.
Findings
Different clustering schemes focus on various performance metrics.
On-demand clusterhead election reduces overhead.
Mobility impacts topology and clustering efficiency.
Abstract
Many clustering schemes have been proposed for ad hoc networks. A systematic classification of these clustering schemes enables one to better understand and make improvements. In mobile ad hoc networks, the movement of the network nodes may quickly change the topology resulting in the increase of the overhead message in topology maintenance. Protocols 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 protocol. The clusterhead election is invoked on-demand, and is aimed to reduce the computation and communication costs. A large variety of approaches for ad hoc clustering have been developed by researchers which focus on different performance metrics. This paper presents a survey of different clustering schemes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMobile Ad Hoc Networks · Energy Efficient Wireless Sensor Networks · Opportunistic and Delay-Tolerant Networks
