Abstract
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.
Highlights
With the prompt development of wireless communication technologies, the number of Mobile adhoc networks studies has been increasing remarkably in recent years
Simulations have been directed to evaluate the performance of the dynamic K-means clustering algorithm
The proposed dynamic clustering algorithm for Mobile Ad-Hoc networks (MANETs) takes into account of several assessment criteria, route discovery time, delay, total route error sent, receiving packet rate, throughput and total packets dropped
Summary
With the prompt development of wireless communication technologies, the number of Mobile adhoc networks studies has been increasing remarkably in recent years. Due to swift movement of mobile nodes and change the network topology, routing is the largest challenge for this kind of networks. The ground breaking attempts to establish optimized routing methods in wireless networks presented in [1,2,3,4]. Widmer and her team have been proposed an optimized routing scheme for wireless networks with flat structure [5]. Aiming to make a considerable contribution to the routing process of hierarchical wireless networks, Kartalcetin in [6] proposed to effectively employ an entropy based algorithm to find the best path in this kind of networks
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
