In ad hoc networks, energy preservation on communications is crucial because most of nodes are battery-powered. On the other hand, communication delay is an important factor of real-time communications. Since energy-aware routes commonly have long route lengths, which commonly result long communication delays, a trade-off has to be made on route setup between energy preservation and communication delay. Moreover, long route length also incurs high packet drop rate, which causes low reliability and high retransmission cost. We propose energy-aware route search algorithms with limited route length (EAR-LRL). We show that the computational complexities of the centralized version of our algorithms are polynomial. The simulation results show that EARLRL generates routes with limited route length with resonably low total transmission power.