Sink mobility has strongly proven its efficiency in enhancing the network lifetime and also balancing the remaining energy of the sensor nodes of a wireless sensor network. However, the technique has several critical issues affecting its performance. One of the major issues is the path selection for the mobile sink. In this work, we propose a centralized rendezvous point (RP) based path selection technique to ensure the coverage of each sensor node. Here the RPs are selected from the normal sensor nodes with the objective of covering each sensor node through the minimum number of RPs. The proposed algorithm is compared with a technique finding the same number of RPs using the existing k-means clustering algorithm over the deployed sensor nodes. The cluster centers are treated as the RPs. Both the algorithms were simulated rigorously and the comparison result proves the effectiveness of the proposed algorithm.