The sensor nodes near to the fixed sink node suffer from the quickly tired energy. For this, many existing methods have been researched to distribute the energy consumption into all wireless sensor nodes using a rechargeable mobile sink. Since the mobile sink changes its location in the network constantly, it has limited time to communicate with the sensor nodes and needs the time to move to each sensor node. Therefore, before the mobile sink approaches the sensor node, the node can collect huge data by event occurrence. It causes the memory overflow of the sensor node and then the data loss. The proposed network is sectioned into a set of sub networks, each of which is called a cluster. In each cluster, one node represents the others and is called the Cluster Head (CH). The objective of the tour building step is to minimize the traveling cost, and therefore it is exactly the anchor point selection algorithm based TSP problem. The proposed algorithm anchor point selection based on a crucial step of the data gathering process since it determines the efficiency of energy transferring and the latency of data gathering. A significant scheme is to simply visit all the sensor nodes, collect data through single-hop transmission and use the mobile sink to forward data back to the static sink through long range communications.