Energy-Efficient Delay-Constrained Routing for Sensor Networks with Low Duty Cycles

This paper investigates solutions for the delay-constrained least-cost (DCLC) paths problem in low duty-cycled sensor networks where nodes asynchronously sleep most of their time. Solving DCLC problem in sensor networks is very challenging not only because of its NP-Completeness, but because of the stringent network resources. We propose an approximated DCLC routing algorithm, called ADRA, which distributively executes with a linear message complexity and a constant per-node memory requirement, and achieves near-optimal solutions as the network size or the radio range increases. Theoretical analysis and extensive simulation evaluate our design.