As cluster heads chosen by nodes, gathers the data from their individual groups and exchanges the collected data to the mobile sink as proposed in the heuristic tour planning technique. In this research, the mobile sink starts the collection of data irregularly from the initial site, which is stored in cluster heads in an individual hop extend and at last returns to the initial site. In existing approaches, scheduling time for data delivery is less. To increase the data delivery, there is a need in extending the concept to higher level routing process. To solve this issue, this paper proposed a collection oriented distribution scheme with k-medoids (CODS-KM). The method can be exhausted for distribute the collection points in network in a particular manner. In this method, k-medoids algorithm for clustering and cluster head process is used. To collect the data purpose, it can be used CH (Cluster Head), CP (Collection Point) and RP (Rendezvous Point). The proposed system helps in mitigation of travelling time when compared to existing approaches. To find the effectiveness of proposed algorithm, NS2 (Network simulator-2) software is used for simulation verification.