On the Tradeoff Between Robustness and Energy-Efficiency of the Routing Algorithm for Wireless Sensor Networks

In wireless sensor networks, the power-aware routing algorithm (PowerCost) can effectively reduce routing energy consumption and prolong the network lifetime, however, it can not tolerate localization errors. In contrast, the greedy routing algorithm is robust to localization errors but is not energy-efficient. In this paper, based on the analysis of the tradeoff between robustness and energy-efficiency, a robust power-aware routing algorithm, robust-powercost, is proposed, which combines the advantages of the previous routing algorithms. Extensive simulations are performed to confirm the efficacy of our algorithm and it is shown in the results that robust-powercost achieves near ideal performance for a wide range of system configurations