In wireless sensor networks where nodes operate on limited battery energy, some other unique characteristics make these nodes impossible to be replaced or recharged, so the efficient utilization of the energy is very important. There are many papers proposed in order to reduce energy consumption, but at the same time another problem emerged, i.e., for each node with limited energy the cumulative load of data traffic from its neighbor nodes will become heavier and the energy of such nodes will deplete more quickly than before. So we have formulated the routing problem as maximizing the network lifetime. Firstly we split these nodes into to some domains, and then we balance load among each domain dynamic. Considering this we describe a dynamic load balancing routing algorithm based on each node's energy, through which we trying to maximize the lifetime of each node as well as the whole lifespan of the sensor networks. Through our models and algorithms, the simulation results showed our algorithms are more dynamic and mobility efficient, nodes can change their domains if necessary.