Deadline-constrained maximum reliability packet forwarding with limited channel state information

QC 20131112
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.

TEKNIK OCH TEKNOLOGIER Elektroteknik och elektronik Kommunikationssystem hsv//swe
ENGINEERING AND TECHNOLOGY Electrical Engineering, Electronic Engineering, Information Engineering Communication Systems hsv//eng
Approximate solution
Implementation complexity
Maximum reliability
Numerical example
Packet forwarding
Packet transmissions
Partially observable Markov decision process
Wireless multi-hop network

Ingår i:2013 IEEE Wireless Communications and Networking Conference (WCNC)New York : IEEE Communications Society, s. 1721-17269781467359399

Om ämnet

TEKNIK OCH TEKNOLOGIER: TEKNIK OCH TEKNO ...; och Elektroteknik oc ...; och Kommunikationssy ...

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.