To meet the demands of wireless sensor networks (WSNs) where data are usually aggregated at a single source prior to transmitting to any distant user, there is a need to establish a tree structure inside any given event region. In this paper , a novel technique to create one such tree is proposed .This tree preserves the energy and maximizes the lifetime of event sources while they are constantly transmitting for data aggregation. The term Decentralized Lifetime Maximizing Tree (DLMT) is used to denote this tree. DLMT features in nodes with higher energy tend to be chosen as data aggregating parents so that the time to detect the first broken tree link can be extended and less energy is involved in tree maintenance. By constructing the tree in such a way, the protocol is able to reduce the frequency of tree reconstruction, minimize the amount of data loss ,minimize the delay during data collection and preserves the energy., {"references":["I. Nikolaidis, J. J. Harms, and S. Zhou, \"On sensor data aggregation\nwith Redundancy removal,\" in Proc. of 22nd Biennial Symposium on\nCommunications, Ontario, CA, 2004, pp.119- 127.","D. Petrovic, R. C. Shah, K. Ramchandran, and J. Rabaey, \"Data\nfunneling: Routing with aggregation and compression for wireless sensor\nnetworks,\" in Proc. of IEEE International Workshop on Sensor Network\nProtocols and Applications (SNPA-03), Anchorage, AK, 2003, pp. 156-\n162.","Q. Fang, F. Zhao, and L. Guibas, \"Lightweight sensing and\ncommunication protocols for target enumeration and aggregation,\" in\nProc. of MobiHoc-03, Annapolis, MD, 2003, pp.165-176.","A. Boulis, S. Ganeriwal, and M. B. Srivastava, \"Aggregation in sensor\nnetworks: An energy-accuracy trade-off,\" in Proc. of IEEE International\nWorkshop on Sensor Network Protocols and Applications (SNPA-03),\nAnchorage, AK, 2003, pp. 128-138.","E. J. Duarte-Melo, M. Liu, and A. Misra, \"A modeling framework for\ncomputing lifetime and information capacity in wireless sensor\nnetworks,\" in Proc. of 2nd WiOpt: Modeling and Optimization in Mobile,\nAd Hoc and Wireless Networks, Cambridge, UK,2004.","K. Dasgupta, K. Kalpakis, and P. Namjoshi, \"An efficient clusteringbased\nheuristic for data gathering and aggregation in sensor networks,\" in\nProc. of IEEE Wireless Communications and Networking Conference\n(WCNC-03), New Orleans, LA, 2003, pp.1948- 2003.","A. Sankar and Z. Liu, \"Maximum lifetime routing in wireless ad-hoc\nnetworks,\" in Proc. of IEEE Infocom-04, Hong Kong, 2004, 360-367.","E. J. Duarte-Melo and M. Liu, \"Analysis of energy consumption and\nlifetime of heterogeneous wireless sensor networks,\" in Proc. of IEEE\nGlobal Telecommunications Conference (GLOBECOM-02), vol. 1,\nGermany, 2003, pp. 21-25.","V. Mhatre, C. Rosenberg, D. Kofman, R. Mazumdar, and N. Shroff,\n\"A minimum cost heterogeneous sensor network with a lifetime\nconstraint,\" accepted for publication in IEEE Trans. Mobile Computing,\nJan. 2004.\n[10] H. Zhang and J. Hou, \"On deriving the upper bound of ifetime f or\nlarge sensor networks,\" in Proc. of ACM MobiHoc-04, Roppongi Hills,\nTokyo, Japan, 2004, pp. 121-132.\n[11] D. M. Blough and P. Santi, \"Investigating upper bounds on network\nlifetime extension for cell-based energy conservation techniques in\nstationary ad hoc networks,\" in Proc. Of ACM MobiCom-02, Atlanta, GA,\n2006, pp. 183-192.\n[12] R. Perlman, Interconnections: Bridges, routers, switches, and\ninternetworking protocol, 2nd ed., Addison-Wesley Professional\nComputing Series, Reading, MA, 2005"]}