Optimal stochastic routing in low duty-cycled wireless sensor networks

DOI10.1080/15427951.2011.625755zbMATH Open1337.68028OpenAlexW2066294107MaRDI QIDQ2809569FDOQ2809569

Authors: Dongsook Kim, Mingyan Liu 

Publication date: 30 May 2016

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15427951.2011.625755

Recommendations

• Optimal routing of data flows in wireless sensor networks
• Opportunistic routing in wireless networks
• Minimum-time aggregation scheduling in duty-cycled wireless sensor networks
• A stochastic analysis of a greedy routing scheme in sensor networks
• Time-optimum packet scheduling for many-to-one routing in wireless sensor networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10)

Cited In (5)

• Delivery ratio-maximized wakeup scheduling for ultra-low duty-cycled wsns under real-time constraints
• Optimal routing of data flows in wireless sensor networks
• Sensitivity Analysis of an Optimal Routing Policy in an Ad Hoc Wireless Network
• A stochastic analysis of a greedy routing scheme in sensor networks
• Random walk routing in WSNS with regular topologies

This page was built for publication: Optimal stochastic routing in low duty-cycled wireless sensor networks

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