Clustering Algorithms
An Efficient Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems
IEEE Transactions on Parallel and Distributed Systems
MapReduce: simplified data processing on large clusters
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Steps toward self-aware networks
Communications of the ACM - Barbara Liskov: ACM's A.M. Turing Award Winner
QoS issues in ad hoc wireless networks
IEEE Communications Magazine
A Survey of Routing Protocols that Support QoS in Mobile Ad Hoc Networks
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
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.