Cluster Based Random Node Mobility Model by Using K-Means Algorithm in Mobile Ad Hoc Network
Saba Khan, Priya Pathak · IOSR Journal of Computer Engineering · 2017
with the advanced technology of wireless network, the nodes interact with each other without any fixed infrastructure.This network is fully decentralized in nature and make it more efficient network to establish all over the field.There is no need to maintain wired infrastructure and easy to maintain.Nodes are free to communicate and can move at any direction without taking others opinion.In this paper, we introduced mobility models for the mobility pattern of the nodes and then the k-means cluster.Most important issue is node movement as it becomes easy to forward the data.In the proposed work, we apply cluster based random node mobility model in which nodes move freely anywhere and then create clusters to eliminate communication breaking.So in our results, we improve the network performance by increasing the throughput and packet delivery ratio.