Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
