Clustering and Analysis of Dynamic Ad Hoc Network Nodes Movement Based on FCM Algorithm

Abstract

Clustering is a major exploratory data mining activity, and a popular statistical data analysis technique used in many fields. Cluster analysis generally speaking isn't just an automated function, but rather reiterated infor-mation exploration procedure or multipurpose dynamic optimisation comprising trial and error. Parameters for pre-processing and modeling data frequently need to be modified until the output hits the desired properties. -Data points in fuzzy clustering may probably belong to several clusters. Each data point is assigned membership grades. Such grades of membership reflect the degree to which da-ta points belong to each cluster. The Fuzzy C-means clustering (FCM) algo-rithm is among the most widely used fuzzy clustering algorithms. In this paper we use this method to find typological analysis for dynamic Ad Hoc network nodes movement and demonstrate that we can achieve good performance of fuzziness on a simulated data set of dynamic ad hoc network nodes (DANET) and how to use this principle to formulate node clustering as a partitioning problem. Cluster analysis aims at grouping a collection of nodes into clusters in such a way that nodes seeing a high degree of correlation within the same clus-ter, whereas nodes members of various clusters are extremely dissimilar in na-ture. The FCM algorithm is used for implementation and evaluation the simu-lated data set using NS2 simulator with optimized AODV protocol. The results from the algorithm's application show the technique achieved the maximum values of stability for both cluster centers and nodes (98.41 %, 99.99 %) respec-tively and has the highest accuracy (stability) compared to previous methods.