Mobile sink is the challenging task for wireless sensor networks (WSNs). In this paper we propose to design an efficient routing protocol for single mobile sink and multiple mobile sink for data gathering in WSN. In this process, a biased random walk method is used to determine the next position of the sink. Then, a rendezvous point selection with splitting tree technique is used to find the optimal data transmission path. If the sink moves within the range of the rendezvous point, it receives the gathered data and if moved out, it selects a relay node from its neighbours to relay packets from rendezvous point to the sink. Proposed algorithm reduces the signal overhead and improves the triangular routing problem. Here the sink acts as a vehicle and collect the data from the sensor. The results show that the proposed model effectively supports sink mobility with low overhead and delay when compared with Intelligent Agent-based Routing protocol (IAR) and also increases the reliability and delivery ratio when the number of sources increases.