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

Abstract

<p><strong>Abstract—</strong> 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 information 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 data points belong to each cluster. The Fuzzy C-means clustering (FCM) algorithm 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 cluster, whereas nodes members of various clusters are extremely dissimilar in nature. The FCM algorithm is used for implementation and evaluation the simulated 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 %) respectively.<strong></strong></p>

Localization Technique Model of Ships Ad Hoc Network (SANET) Using Geographic's Database and Clustering Analysis

“…The algorithmic process of the FCM clustering technique used to generate the findings given in the experimental setup is as follows [38]:…”

Intelligent Mobile Coronavirus Recognition Centre Based on IEEE 802.15.4

“…Other performance metrics were employed to calculate the efficiency of the proposed communication system after integrating it with a detection system. These metrics include packet delivery rate (PDR), throughput, and end-to-end delay [26].…”

Priority-Mobility Aware Clustering Routing Algorithm for Lifetime Improvement of Dynamic Wireless Sensor Network

“…If one cluster head receives CH announcement from other overlapping cluster head, then need to find cluster probability. The node with the greater probability retains the head position so the lower probability CH performs the cluster shifting process by sending the shifting message to both CM and overlapping CH, then cluster head assigns slot to members [14] [15] C. Self Healing Scheduling Approach using Reinforcement Learning Self-healing scheduling approach using Q-learning algorithm decides when to transmit the packets in sub timeslot. This algorithm works with rewards and penalty so that Generally it takes the value between [0, 1], Here, 0 means that the prior information will be retained as it is and 1 indicates that it will positively identify the prior information.…”