Optimal Channel Probing and Transmission Scheduling for Opportunistic Spectrum Access
In this study, we consider optimal opportunistic spectrum access (OSA) policies for a transmitter in a multichannel wireless system, where a channel can be in one of multiple states. In such systems, the transmitter typically does not have complete information on the channel states, but can learn by...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute of Electrical and Electronics Engineers and Association for Computing Machinery
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/52364 |
| _version_ | 1826198287277883392 |
|---|---|
| author | Chang, Nicholas B. Liu, Mingyan |
| author2 | Lincoln Laboratory |
| author_facet | Lincoln Laboratory Chang, Nicholas B. Liu, Mingyan |
| author_sort | Chang, Nicholas B. |
| collection | MIT |
| description | In this study, we consider optimal opportunistic spectrum access (OSA) policies for a transmitter in a multichannel wireless system, where a channel can be in one of multiple states. In such systems, the transmitter typically does not have complete information on the channel states, but can learn by probing individual channels at the expense of certain resources, e.g., energy and time. The main goal is to derive optimal strategies for determining which channels to probe, in what sequence, and which channel to use for transmission. We consider two problems within this context and show that they are equivalent to different data maximization and throughput maximization problems. For both problems, we derive key structural properties of the corresponding optimal strategy. In particular, we show that it has a threshold structure and can be described by an index policy. We further show that the optimal strategy for the first problem can only take one of three structural forms. Using these results, we first present a dynamic program that computes the optimal strategy within a finite number of steps, even when the state space is uncountably infinite. We then present and examine a more efficient, but suboptimal, two-step look-ahead strategy for each problem. These strategies are shown to be optimal for a number of cases of practical interest. We examine their performance via numerical studies. |
| first_indexed | 2024-09-23T11:02:30Z |
| format | Article |
| id | mit-1721.1/52364 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T11:02:30Z |
| publishDate | 2010 |
| publisher | Institute of Electrical and Electronics Engineers and Association for Computing Machinery |
| record_format | dspace |
| spelling | mit-1721.1/523642022-10-01T00:43:39Z Optimal Channel Probing and Transmission Scheduling for Opportunistic Spectrum Access Chang, Nicholas B. Liu, Mingyan Lincoln Laboratory Chang, Nicholas B. Chang, Nicholas B. stochastic optimization scheduling optimal stopping opportunistic spectrum access (OSA) dynamic programming cognitive radio channel probing In this study, we consider optimal opportunistic spectrum access (OSA) policies for a transmitter in a multichannel wireless system, where a channel can be in one of multiple states. In such systems, the transmitter typically does not have complete information on the channel states, but can learn by probing individual channels at the expense of certain resources, e.g., energy and time. The main goal is to derive optimal strategies for determining which channels to probe, in what sequence, and which channel to use for transmission. We consider two problems within this context and show that they are equivalent to different data maximization and throughput maximization problems. For both problems, we derive key structural properties of the corresponding optimal strategy. In particular, we show that it has a threshold structure and can be described by an index policy. We further show that the optimal strategy for the first problem can only take one of three structural forms. Using these results, we first present a dynamic program that computes the optimal strategy within a finite number of steps, even when the state space is uncountably infinite. We then present and examine a more efficient, but suboptimal, two-step look-ahead strategy for each problem. These strategies are shown to be optimal for a number of cases of practical interest. We examine their performance via numerical studies. Lincoln Laboratory (2005-2006 Fellowship) National Science Foundation (Award ANI-0238035) 2010-03-08T15:12:34Z 2010-03-08T15:12:34Z 2009-12 2008-12 Article http://purl.org/eprint/type/JournalArticle 1063-6692 INSPEC Accession Number: 11020209 http://hdl.handle.net/1721.1/52364 Chang, N.B., and Mingyan Liu. “Optimal Channel Probing and Transmission Scheduling for Opportunistic Spectrum Access.” Networking, IEEE/ACM Transactions on 17.6 (2009): 1805-1818. © 2009 Institute of Electrical and Electronics Engineers en_US http://dx.doi.org/10.1109/TNET.2009.2014460 IEEE/ACM Transactions on Networking Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. application/pdf Institute of Electrical and Electronics Engineers and Association for Computing Machinery IEEE |
| spellingShingle | stochastic optimization scheduling optimal stopping opportunistic spectrum access (OSA) dynamic programming cognitive radio channel probing Chang, Nicholas B. Liu, Mingyan Optimal Channel Probing and Transmission Scheduling for Opportunistic Spectrum Access |
| title | Optimal Channel Probing and Transmission Scheduling for Opportunistic Spectrum Access |
| title_full | Optimal Channel Probing and Transmission Scheduling for Opportunistic Spectrum Access |
| title_fullStr | Optimal Channel Probing and Transmission Scheduling for Opportunistic Spectrum Access |
| title_full_unstemmed | Optimal Channel Probing and Transmission Scheduling for Opportunistic Spectrum Access |
| title_short | Optimal Channel Probing and Transmission Scheduling for Opportunistic Spectrum Access |
| title_sort | optimal channel probing and transmission scheduling for opportunistic spectrum access |
| topic | stochastic optimization scheduling optimal stopping opportunistic spectrum access (OSA) dynamic programming cognitive radio channel probing |
| url | http://hdl.handle.net/1721.1/52364 |
| work_keys_str_mv | AT changnicholasb optimalchannelprobingandtransmissionschedulingforopportunisticspectrumaccess AT liumingyan optimalchannelprobingandtransmissionschedulingforopportunisticspectrumaccess |