Wireless networks are composed of wireless devices with the limited battery. They can be used in the situation where the supply of powers is not practical, therefore it is important to construct the energy efficient routing protocol.
In this paper, we propose tree-based greedy algorithm to solve the minimum power broadcasting problem for minimizing the total transmit power on broadcasting in wireless networks. We apply a neighborhood list, which is a set of nodes that can transmit message to other nodes within the maximum transmission energy to the proposed algorithm. Among the nodes that receive the data, a node that has the greatest number of the neighborhood list transmits data to neighbor preferentially. We compare the performance of the proposed algorithm with other existing algorithms through computer simulation in terms of transmitting energy of nodes. Experiment results show that the proposed algorithm outperforms better than the existing algorithms.