We consider the problem of data propagation in wireless sensor networks and revisit the family of mixed strategy routing schemes. We show that maximizing the lifespan, balancing the energy among individual sensors and maximizing the message flow in the network are equivalent. We propose a distributed and adaptive data propagation algorithm for balancing the energy among sensors in the network. The mixed routing algorithm we propose allows each sensor node to either send a message to one of its immediate neighbors, or to send it directly to the base station, the decision being based on a potential function depending on its remaining energy. By considering a simple model of the network and using a linear programming description of the message flow, we prove the strong result that an energy-balanced mixed strategy beats every other possible routing strategy in terms of lifespan maximization. Moreover, we provide sufficient conditions for ensuring the dynamic stability of the algorithm. Th...