Minimum-Energy Packet Forwarding Over Lossy Networks Under Deadline and Reliability Constraints
This paper studies minimum-energy packet forwarding over multi-hop lossy networks under deadline and reliability constraints. The authors assume a routing topology in the form of a directed graph with packet loss processes on links described by finite-state Markov chains, and formulate the forwarding problem as a finite-horizon constrained Markov decision process. They show that the minimum energy forwarding policy under hard deadline and reliability constraint can be computed using dynamic programming, and that the optimal forwarding policy is a randomized policy over two history-independent and deterministic policies. Closed-form optimal policies are derived for some particular scenarios.