DYNAMIC K-MEANS ALGORITHM FOR OPTIMIZED ROUTING IN MOBILE AD HOC NETWORKS

This section presents some stylized facts concerning globalization as a main result of a cluster analysis based on k- means algorithm used to investigate the role of

Using the sandwich methodology, the method use a super node based routing algorithm and P2P ring to reduce the routing overhead and average routing

In this paper, a novel density based k-means clustering algorithm has been proposed to overcome the drawbacks of DBSCAN and kmeans clustering algorithms.. The result will be

if timeout period of sender node is x then timeout period of receiver node will be (x-m), where m will be critical factor. This factor [16] helps us to control the

In Case 1, i,e., for high level of security ( sec_ level = 1), during routing process, the source and destination nodes separately verify the authenticity of all other nodes in

LEACH is a clustering algorithm, which means the nodes of the network are organized within clusters and they communicate between themselves via sensor elements called Cluster

A fuzzy multi-objective evolutionary algorithm for the problem of optimization of vehicle routing problems with multiple depots, multiple customers, and multiple products was

The main objective of this paper is compare the performance of commonly used classical k-means clustering procedures as well as parallel k-means clustering to realize the