In wireless Sensor networks, the communications between the nodes are unstable, since the quality of the wireless links fluctuates heavily. The sensors that collect the sensible data like temperature, humidity, pressure...etc from the source and delivered to the destination through wireless networks. The methods used in the existing system were minimum spanning tree (MST) and PEDAP for network lifetime and power efficiency. In the existing system the data are send periodically to the destination required more power. To reduce the power, the localized, self-organizing, robust and data aggregation tree approaches for sensor networks which is called Localized Power-efficient Data Aggregation Protocols (L-PEDAPs) is used. This is based on LMST, RNG topologies. Using L-PEDAP, the parent node is defined and shortest route calculated for the data sink. The data are gathered from various nodes and aggregated by the parent node. Then the aggregated data are sending to the data sink through the calculated route. In addition to that the route maintenance also handled when a node is removed or added to the network using this protocol. The network lifetime is reduced to half due to the parent node failure. In order to rectify this problem, the parent node is replaced by a neighbor child node, which has the next highest transmission range and achieve a good packet delivery ratio especially for high load networks.