Recently Wireless Sensor Networks (WSN) is one of the increasing technologies to provide a service to the network users. WSN is used to transfer the data among the network nodes. To transferring the data, network should provide better communication method among WSN and should provide efficient energy consumption. To achieve this problems many approaches like mobile sink protocol and some other strategies were developed to transfer data through mobile sink mechanisms. These approaches solved only the data transfer problem but fail in solving efficient energy consumption while routing. Sensor nodes usually have limited energy supply and they are impractical to recharge. How to balance traffic load in sensors in order to increase network lifetime is a very challenging research issue. Many clustering algorithms have been proposed recently for wireless sensor networks (WSNs). However, sensor networks with one fixed sink node often suffer from a hot spots problem since nodes near sink s have more traffic burden to forward during a multi- hop transmission process. The use of mobile sinks has been shown to be an effective technique to enhance network performance features such as latency, energy efficiency, network lifetime etc. Existing work employ one or more mobile sinks. These mobile sinks survey and collect sensed data directly from sensor nodes and thereby help sensor nodes save energy that otherwise would be consumed by multihop communications. In this project the system proposed a WRP, which is a heuristic method that finds a near-optimal traveling tour that minimizes the energy consumption of sensor nodes. It is guaranteed to find a tour if the latter exists. The proposed system define the problem finding a set of RPs to be visited by a mobile sink.