Within the field of Wireless Sensor Networks, one problem area is the limited energy supplies of the sensor nodes. In most situations, it is infeasible to replace the energy supply in each individual node. Thus it becomes important to minimize the energy expenditure of the sensor nodes, to get the maximum performance possible. There have been numerous algorithms to find the data routing schedule that maximizes the amount of time a network lasts. In this paper we propose an alternate algorithm for maximizing the network lifetime, that gives nearoptimal results, with a quick running time.