In this paper

we propose a distributed tree-based algorithm for precise data gathering in wireless sensor networks called EEDAT

which achieves longer network lifetime than existing distributed algorithms.The EEDAT algorithm has two steps.In the first step

a shortest path tree is constructed in a distributed manner.In the second step

EEDAT adjusts the load of nodes in the generated tree to balance energy consumption of different nodes

which effectively extends the lifetime of the network.In the adjustment

both the number of children of a node and its residual energy are considered.Simulation results show that EEDAT achieves longer lifetime than the LMST algorithm.On average

compared with LMST

EEDAT prolongs the lifetime by 20%.