Deadline-constrained maximum reliability packet forwarding with limited channel state information
2013 (English)In: 2013 IEEE Wireless Communications and Networking Conference (WCNC), New York: IEEE Communications Society, 2013, 1721-1726 p.Conference paper (Refereed)
This paper considers real-time packet forwarding over wireless multi-hop networks with lossy and bursty links. Our objective is to maximize the probability that individual packets reach their destination before a hard deadline. The loss processes on links are modeled by finite-state Markov chains. While the parameters of the Markov chains are assumed to be known, the instantaneous channel states are not accessible but have to be estimated from observations of successes and failures of actual packet transmissions. We formulate the forwarding problem as a partially observable Markov decision process and derive the optimal forwarding policy. A novel technique, based on maximum-volume inscribed ellipsoids, for computing approximate solutions with reduced implementation complexity is proposed. We further discuss structural properties of the value function and the optimal actions. Finally, numerical examples illustrate the power of the developed techniques.
Place, publisher, year, edition, pages
New York: IEEE Communications Society, 2013. 1721-1726 p.
, IEEE Wireless Communications and Networking Conference, WCNC, ISSN 1525-3511
Approximate solution, Implementation complexity, Maximum reliability, Numerical example, Packet forwarding, Packet transmissions, Partially observable Markov decision process, Wireless multi-hop network
IdentifiersURN: urn:nbn:se:kth:diva-133856DOI: 10.1109/WCNC.2013.6554823ISI: 000326048101140ScopusID: 2-s2.0-84881577612ISBN: 978-146735939-9OAI: oai:DiVA.org:kth-133856DiVA: diva2:663652
2013 IEEE Wireless Communications and Networking Conference, WCNC 2013; Shanghai; China; 7 April 2013 through 10 April 2013
QC 201311122013-11-122013-11-112013-12-10Bibliographically approved