Authors : Priya Sethuraman and N. Kannan
Abstract: The clustering algorithm are widely used to manage the nodes in large scale network. Eventhough, the clustering algorithm is designed to achieve communication stability for a large number of nodes to coordinate and balance the resources and reduce retransmissions and collisions, much of its resource is utilised for the cluster head election which is the frequent procedure in clustering as the nodes constantly move within and outside the cluster. When the cluster head is moved out new cluster head needs to be elected which is a overhead. Inorder to minimize this overhead, a new algorithm B-cluster is proposed which has a principle of electing two head at a time in a single election and have the second cluster head as reserve cluster head. When the first cluster head leaves the cluster reelection is not required in the proposed model as the reserve cluster head is declared as the new cluster head. Moreover, the overhead involved in the existing cluster head selection algorithm is reduced exponentially by giving preference to the Bring Your Own Device (BYOD) node as cluster head. BYOD is a preconfigured with the acees control and hence, is used to establish secured communication amoung the nodes in the cluster. The proposed algorithm is evaluated and the results are tabulated.
Priya Sethuraman and N. Kannan, 2016. B-Cluster: A Novel Cluster Algorithm for Secured Communication in MANET. Asian Journal of Information Technology, 15: 283-286.