Sökning: onr:"swepub:oai:DiVA.org:kth-133856" >
Deadline-constraine...
Deadline-constrained maximum reliability packet forwarding with limited channel state information
-
- Zou, Zhenhua (författare)
- KTH,Reglerteknik
-
- Johansson, Mikael (författare)
- KTH,Reglerteknik
-
(creator_code:org_t)
- New York : IEEE Communications Society, 2013
- 2013
- Engelska.
-
Ingår i: 2013 IEEE Wireless Communications and Networking Conference (WCNC). - New York : IEEE Communications Society. - 9781467359399 ; , s. 1721-1726
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik -- Kommunikationssystem (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering -- Communication Systems (hsv//eng)
Nyckelord
- Approximate solution
- Implementation complexity
- Maximum reliability
- Numerical example
- Packet forwarding
- Packet transmissions
- Partially observable Markov decision process
- Wireless multi-hop network
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas