Delivery ratio-maximized wakeup scheduling for ultra-low duty-cycled wsns under real-time constraints

DOI10.1016/J.COMNET.2010.10.001MaRDI QIDQ2431432zbMATH OpenOpenAlexFDO

Authors Fei Yang, Isabelle Augé-Blum

Publication date 14 April 2011

Published in Computer Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comnet.2010.10.001

zbMATH Keywords

energy efficiencyreal-timereliabilityunreliable linkswireless sensor networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Optimal wake-up scheduling of data gathering trees for wireless sensor networks
• Hypergraph-based data link layer scheduling for reliable packet delivery in wireless sensing and control networks with end-to-end delay constraints
• Optimal stochastic routing in low duty-cycled wireless sensor networks
• Exploiting slack time for just-in-time scheduling in wireless sensor networks
• Minimum-time aggregation scheduling in duty-cycled wireless sensor networks

Cited in

(3)

• Hypergraph-based data link layer scheduling for reliable packet delivery in wireless sensing and control networks with end-to-end delay constraints
• Heterogenous Quorum-Based Wake-Up Scheduling in Wireless Sensor Networks
• Exploiting slack time for just-in-time scheduling in wireless sensor networks

This page was built for publication: Delivery ratio-maximized wakeup scheduling for ultra-low duty-cycled wsns under real-time constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431432)