Dynamic K Means Algorithm for Optimized Routing in Mobile Ad Hoc Networks
In this paper, a dynamic K means algorithm to improve the routing process in Mobile Ad Hoc networks (MANETs) is presented. Mobile ad hoc networks are a collocation of mobile wireless nodes that can operate without using focal access points, pre existing infrastructures, or a centralized management point. In MANETs, the quick motion of nodes modifies the topology of network. This feature of MANETS is lead to various problems in the routing process such as increase of the overhead massages and inefficient routing between nodes of network. A large variety of clustering methods have been developed for establishing an efficient routing process in MANETs. Routing is one of the crucial topics which are having significant impact on MANETs performance. The K means algorithm is one of the effective clustering methods aimed to reduce routing difficulties related to bandwidth, throughput and power consumption. This paper proposed a new K means clustering algorithm to find out optimal path from source node to destinations node in MANETs. The main goal of proposed approach which is called the dynamic K means clustering methods is to solve the limitation of basic K means method like permanent cluster head and fixed cluster members. The experimental results demonstrate that using dynamic K means scheme enhance the performance of routing process in Mobile ad hoc networks.