• Manisha Shekhawa
• Ms. Nidhi Naruka

Data communication is the significant piece of the present universe of data innovation. The primary issues when moving the data is about the moving of enormous measure of data and safely moving the data without getting it hacked. Clustering is fundamentally utilized for gathering the related data, and the K-Means clustering clusters based on the centroid. The base desk work is likewise impact by the K-Means algorithm however a few holes inspires us to work in this field. As the idea included is awesome, the enormous document sending and safely sending them is consistently the issue. In this proposed idea the clusters, will be gathered based on the normal components and the comparable clusters are sorted out based on the size of each cluster and the cluster choice is gone based on the arbitrary premise, based on the cluster division of the size range bunch in which reaches are based on the size e.g 0-10 , 10-15 etc...The Clusters are then scrambled based on the AES based algorithm in which the arbitrarily produced key will be utilized for the creating the encoded clusters. The document which is send and the record which is gotten on the beneficiary end requires to be actually same and the base paper has not play out any approval of confirming that, so in proposed work we will attempt to work on this.

"Clustering Algorithm Using Random Approach and MD5 Validation ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 6, page no.7-12, June-2019, Available :http://www.jetir.org/papers/JETIR1908002.pdf

"Clustering Algorithm Using Random Approach and MD5 Validation ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 6, page no. pp7-12, June-2019, Available at : http://www.jetir.org/papers/JETIR1908002.pdf