By Topic

Opportunistic file transfer over a fading channel: A POMDP search theory formulation with optimal threshold policies

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Johnston, L.A. ; Dept. of Electr. & Electron. Eng., Univ. of Melbourne, Vic., Australia ; Krishnamurthy, V.

We present a computationally efficient algorithm that minimizes the transmission energy and latency associated with transmitting a file across a Gilbert Elliott fading channel. We formulate the optimal tradeoff between transmission energy and latency as a partially observed Markov decision process problem (POMDP). The channel state is not directly observed and hence transmission decisions must be based on ACK/NAK information provided over a feedback channel. The key idea is to reformulate the resulting POMDP as a Markovian search problem, with optimal transmission control policies that are threshold in nature. Threshold policies are computationally inexpensive to implement. Our analysis shows that for different parameter values of the Gilbert Elliott fading channel, the optimal transmission policy, while threshold in structure, exhibits vastly different behaviour - from persistent retransmission to back-off and wait. Numerical examples demonstrate the performance improvements that can be obtained using the optimal threshold policies as compared to existing heuristic algorithms.

Published in:

Wireless Communications, IEEE Transactions on  (Volume:5 ,  Issue: 2 )