Connectivity-Based Algorithm Analysis

Recently, a number of clustering algorithms have been proposed to select a cluster-head, based on various parameters such as speed and direction, mobility, energy, position, and the number of neighbours of a given node. Though these works have many advantages, there are certain limitations like high computational overheads for both clustering algorithm execution and update operations.
Hussein,A.H, et al[4] have proposed the Highest-Degree Algorithm, also known as Connectivity-Based Algorithm ,in which the degree of nodes is assumed to be the number of neighbours of a given node. The major drawbacks of this algorithm are the degree of a node changes rapidly and the cluster-heads are not likely to play their role as cluster-heads for very long

A node is selected as a cluster head if its weight is higher than any of its neighbor’s weight; otherwise, it joins a neighboring cluster-head. The smaller weighted node ID is chosen in case of an equality. The DCA makes an assumption that the network topology does not change during the execution of the algorithm. Since node weights were different in each simulation cycle, identifying the cluster-heads becomes very expensive and there are no optimizations on the system parameters such as throughput and power control.
The enhanced performance clustering algorithm (EPCA) for MANET [10] involves in identifying the deserved cluster heads, based on the stability of the nodes. Since the weight of the node is varied dynamically the selection of the cluster head is not done periodically. This work doesn’t find the re-affiliation which determines the stability of the node. In this approach the numbers of clusters are more than in other algorithm which increase the communication overhead and affects the related

It corresponds to nodes that disconnect from current cluster and move to another cluster. Here the idea reflects on the cluster head election, to consider relative mobility to select stable cluster head.
In WCA, the running average speed for every node till current time T is computed as follows (1) where (Xt, Yt) and (Xt – 1, Yt – 1) are the coordinates of the node ‘i’ at time ‘t’ and ‘(t – 1)’ respectively. This value is an indication of the absolute mobility of a node and it does not provide any information about the stability between a node and its neighbours, i.e, the relative stability.
The novelty of the Proposed Trust Based Weighted Clustering Algorithm is that, it has taken into account the node’s relative mobility with the help of stability factor and trust value so as to identify a stable trusted node as the cluster-head, and thus reduces the number of reaffiliations which has not been actually done in