This paper presents algorithms for constructing energy-efficient broadcast and multicast trees in wireless networks. The authors address the challenges of broadcasting and multicasting in all-wireless environments, where traditional wired network models do not apply. They propose the Broadcast Incremental Power (BIP) algorithm, which exploits the broadcast nature of wireless communication to minimize energy consumption. The algorithm is adapted for multicast operations and is shown to outperform link-based algorithms used in wired networks. The authors emphasize the importance of considering the node-based nature of wireless communications, as opposed to the link-based models used in wired networks. They argue that joint decisions on connectivity and routing can lead to significant improvements in energy efficiency. The paper also introduces the concept of the "wireless multicast advantage," which allows a single transmission to reach multiple nodes within communication range, reducing the need for multiple transmissions. The authors evaluate the performance of various algorithms, including the Broadcast Least-Unicast-cost (BLU) algorithm and the Broadcast Link-based MST (BLiMST) algorithm. They find that the BIP algorithm provides better performance in terms of energy efficiency, especially when combined with a "sweep" operation that eliminates unnecessary transmissions. The Multicast Incremental Power (MIP) algorithm, which is an adaptation of BIP for multicast operations, is shown to outperform other multicast algorithms in terms of energy efficiency. The paper also discusses the performance of the algorithms on different network sizes and propagation models. It shows that the BIP and MIP algorithms perform well across a range of network examples, with MIP providing the best performance for larger multicast groups. The results indicate that the BIP and MIP algorithms are more efficient than traditional link-based algorithms in wireless networks, where the node-based nature of communication allows for more efficient tree construction. The authors conclude that the BIP and MIP algorithms are effective in minimizing energy consumption for broadcast and multicast operations in wireless networks.This paper presents algorithms for constructing energy-efficient broadcast and multicast trees in wireless networks. The authors address the challenges of broadcasting and multicasting in all-wireless environments, where traditional wired network models do not apply. They propose the Broadcast Incremental Power (BIP) algorithm, which exploits the broadcast nature of wireless communication to minimize energy consumption. The algorithm is adapted for multicast operations and is shown to outperform link-based algorithms used in wired networks. The authors emphasize the importance of considering the node-based nature of wireless communications, as opposed to the link-based models used in wired networks. They argue that joint decisions on connectivity and routing can lead to significant improvements in energy efficiency. The paper also introduces the concept of the "wireless multicast advantage," which allows a single transmission to reach multiple nodes within communication range, reducing the need for multiple transmissions. The authors evaluate the performance of various algorithms, including the Broadcast Least-Unicast-cost (BLU) algorithm and the Broadcast Link-based MST (BLiMST) algorithm. They find that the BIP algorithm provides better performance in terms of energy efficiency, especially when combined with a "sweep" operation that eliminates unnecessary transmissions. The Multicast Incremental Power (MIP) algorithm, which is an adaptation of BIP for multicast operations, is shown to outperform other multicast algorithms in terms of energy efficiency. The paper also discusses the performance of the algorithms on different network sizes and propagation models. It shows that the BIP and MIP algorithms perform well across a range of network examples, with MIP providing the best performance for larger multicast groups. The results indicate that the BIP and MIP algorithms are more efficient than traditional link-based algorithms in wireless networks, where the node-based nature of communication allows for more efficient tree construction. The authors conclude that the BIP and MIP algorithms are effective in minimizing energy consumption for broadcast and multicast operations in wireless networks.