Aydın, Nevin2023-02-072023-02-072014Aydın, N. (2014). Heuristic Clustering Algorithms in Ad hoc Networks. EMAJ: Emerging Markets Journal, 3(3), 77–80.https://dx.doi.org/10.5195/emaj.2014.39https://hdl.handle.net/11494/4671The clustering allows the geographical region to be covered into small zones in which each zone can be handled with a powerful node called clusterhead. The clusterheads have direct communication link with each of its members whereas the member nodes of a cluster must go through the clusterhead to communicate with each other. Since choosing clusterheads optimally is an NP-hard problem, existing solutions to this problem are based on heuristic (mostly greedy) approaches. In this paper, we present three well-known heuristic clustering algorithms: the Lowest-ID, the Highest-Degree, and the Node-Weight.eninfo:eu-repo/semantics/openAccessClustering algorithmsClusterhead, heuristicsAd hoc networksArticle33778010.5195/emaj.2014.39