In this paper, existing lifetime-aware routing algorithms are divided into two categories: General Max-Min (GMM) algorithm and Conditional Max-Min (CMM) algorithm. Motivated by algorithmic mechanism design, two truthful mechanisms for these two types of algorithms are proposed: SMM for GMM algorithm and SMM-VCG for CMM algorithm. By giving appropriate payments to the relay nodes, the proposed mechanisms gurantee that existing algorithms achieve their design objectives even in the presence of selfish nodes. It is shown that the payment ratio is relatively small and stable due to the nature of lifetime-aware routing algorithms, which is also confirmed by experiments.