This chapter focuses on energy-aware solutions for unicast and multicast routing, presenting a novel class of routing algorithms based on multiple criteria. Routing is a primordial task in wireless ad hoc networks due to the multihop nature of packet relaying for both unicast and multicast communication. In the first phase, the set of candidate paths for each source-destination pair or the set of candidate nondominated sequences of node transmissions for each source node and destination group is enumerated for the case of unicast and multicast communication, respectively. Multicast communication in these networks corresponds to finding a sequence of transmitting nodes instead of a sequence of links as is common in the wireline world. The broadcast version of the minimum weight incremental arborescence algorithm is considered and the broadcast average incremental power heuristic, which uses as criterion, for the addition of a node in the tree, the power consumed when using the corresponding link over the number of newly covered nodes.