The trust and energy aware remedy routing(TeaRR) algorithm is proposed to enhance the original ARRIVE algorithm. Considering nodes’ trust and remaining energy synthetically, the TeaRR algorithm selects the nodes with the optimal trust value and remaining energy as next-hop nodes. To overcome the packet lost problem caused by the variability of link quality and the On-Off attacks, TeaRR adopts a rescue scheme, which combines sending nodes’ active recommendation with neighbor nodes’ passive participation, to quickly resume forwarding the possible lost packets. Experimental results show that the TeaRR algorithm is more suitable for delay-sensitive applications, and can provide a trade-off between the packet delivery ratio and the energy cost.