|
|
|
|
LEADER |
02109 am a22002413u 4500 |
001 |
96987 |
042 |
|
|
|a dc
|
100 |
1 |
0 |
|a Johnston, Matthew Ryan
|e author
|
100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
|e contributor
|
100 |
1 |
0 |
|a Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
|e contributor
|
100 |
1 |
0 |
|a Johnston, Matthew Ryan
|e contributor
|
100 |
1 |
0 |
|a Modiano, Eytan H.
|e contributor
|
700 |
1 |
0 |
|a Modiano, Eytan H.
|e author
|
245 |
0 |
0 |
|a Optimal channel probing in communication systems: The two-channel case
|
260 |
|
|
|b Institute of Electrical and Electronics Engineers (IEEE),
|c 2015-05-14T13:38:21Z.
|
856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/1721.1/96987
|
520 |
|
|
|a We consider a multi-channel communication system in which a transmitter has access to two channels, but does not know the state of either channel. We model the channel state using an ON/OFF Markovian model, and allow the transmitter to probe one of the channels at predetermined probing intervals to decide over which channel to transmit. For models in which the transmitter must transmit over the probed channel, it has been shown that a myopic policy that probes the channel most likely to be ON is optimal. In this work, we allow the transmitter to select a channel over which to transmit that is not necessarily the one it probed. We show that in the case where the two channels are i.i.d, all probing policies yield equal reward. We extend this problem to dynamically choose when to probe based on the results of previous probes, and characterize the optimal policy, as well as provide a LP in terms of state action frequencies to find the optimal policy.
|
520 |
|
|
|a National Science Foundation (U.S.) (Grant CNS-0915988)
|
520 |
|
|
|a National Science Foundation (U.S.) (Grant CNS-1217048)
|
520 |
|
|
|a United States. Army Research Office. Multidisciplinary University Research Initiative (Grant W911NF-08-1-0238)
|
546 |
|
|
|a en_US
|
655 |
7 |
|
|a Article
|
773 |
|
|
|t Proceedings of the 2013 IEEE Global Communications Conference (GLOBECOM)
|