Faculty Publications
Permanent URI for this communityhttps://idr.nitk.ac.in/handle/123456789/18736
Publications by NITK Faculty
Browse
2 results
Search Results
Item Parallelized K-Means clustering algorithm for self aware mobile Ad-hoc networks(2011) Thomas, L.; Manjappa, K.; Annappa, B.; Guddeti, G.R.M.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.Item Application of parallel K-means clustering algorithm for prediction of optimal path in self aware mobile ad-hoc networks with link stability(2011) Thomas, L.; Annappa, B.Providing Quality of Service (QoS) in terms of bandwidth, delay, jitter, throughput etc., for Mobile Ad-hoc Network (MANET) which is the autonomous collection of nodes, is challenging issue because of node mobility and the shared medium. This work is to predict the Optimal link based on the link stability which is the number of contacts between 2 pair of nodes that can be effectively applied for prediction of optimal effective path while taking QoS parameters into account to reach the destination using the application of K-Means clustering algorithm for automatically discovering clusters from large data repositories which is parallelized using Map-Reduce technique in order to improve the computational efficiency and thereby predicting the optimal effective path from source to sink. The work optimizes the previous result by pre-assigning task for finding the best stable link in MANET and then work is explored only on that stable link hence, by doing so we are able to predict the optimal path in more time efficient way. © 2011 Springer-Verlag.