Sensor networks are emerging as the new frontier in sensing technology, however there are still issues that need to be addressed. Two such issues are data collection and energy conservation. We consider a mobile robot, or a mobile agent, traveling the network collecting information from the sensors themselves before their onboard memory storage buffers are full. A novel algorithm is presented that is an adaptation of a local search algorithm for a special case of the Asymmetric Traveling Salesman Problem with Time-windows (ATSPTW) for solving the dynamic scheduling problem of what nodes are to be visited so that the information collected is not lost. Our algorithms are given and compared to other work.