In wireless sensor network (WSN), the major issue is the limited memory, bandwidth and power of sensors. So that this limited resources are not suitable for long running WSN since it will not perform as we expect from it. As we know the mobility of sink has very efficient and strongly appeared as far as the potential solution to it. So that for solving these problem a Mobile Based (MS) method and algorithm are invented, for better utilization and enhance the performance of every sensor. In current scenario the most of the sensor lost the data for waiting only for mobile sink because of sensor low data generation rate, So that the sensor networks mobile sink will not be able to take all the data from node in efficient time. Therefore lots of sensors may not be able to transmit the data to mobile sink because of their limited power consumption. In our work, we propose a sensor Data Generation Rate (DGR) based algorithm for efficiently rendezvous point (RP) selection and after that scheduling the path for the mobile sink. We simulate the propose algorithm and compare the results with existing algorithm to measure its efficiency.

Keywords Wireless sensor networks, Data generation rate, mobile sink, Rendezvous point;