Please use this identifier to cite or link to this item:
|Title:||Parallelized K-Means clustering algorithm for self aware mobile Ad-hoc networks|
Ram Mohana Reddy, Guddeti
|Citation:||ACM International Conference Proceeding Series, 2011, Vol., , pp.152-155|
|Abstract:||Providing Quality of Service (QoS) in Mobile Ad-hoc Network (MANET) in terms of bandwidth, delay, jitter, throughput etc., is critical and challenging issue because of node mobility and the shared medium. The work in this paper predicts the best effective cluster while taking QoS parameters into account. The proposed work uses K-Means clustering algorithm for automatically discovering clusters from large data repositories. Further, iterative K-Means clustering algorithm is parallelized using Map-Reduce technique in order to improve the computational efficiency and thereby predicting the best effective cluster. Hence, parallel K-Means algorithm is explored for finding the best effective cluster containing the hops which lies in the best cluster with the best throughput in self aware MANET. Copyright � 2011 ACM.|
|Appears in Collections:||2. Conference Papers|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.