English
Related papers

Related papers: On Optimality of Myopic Sensing Policy with Imperf…

200 papers

We consider the channel access problem in a multi-channel opportunistic communication system with imperfect channel sensing, where the state of each channel evolves as a non independent and identically distributed Markov process. This…

Systems and Control · Computer Science 2015-06-05 Kehao Wang , Lin Chen , Quan Liu , Khaldoun Al Agha

We consider opportunistic communications over multiple channels where the state ("good" or "bad") of each channel evolves as independent and identically distributed Markov processes. A user, with limited sensing and access capability,…

Networking and Internet Architecture · Computer Science 2009-03-11 Sahand H. A. Ahmad , Mingyan Liu , Tara Javidi , Qing Zhao , Bhaskar Krishnamachari

We consider the scheduling problem concerning N projects. Each project evolves as a multi-state Markov process. At each time instant, one project is scheduled to work, and some reward depending on the state of the chosen project is…

Optimization and Control · Mathematics 2016-02-02 Kehao Wang

We consider a multi-channel opportunistic communication system where the states of these channels evolve as independent and statistically identical Markov chains (the Gilbert-Elliot channel model). A user chooses one channel to sense and…

Networking and Internet Architecture · Computer Science 2016-11-17 Qing Zhao , Bhaskar Krishnamachari , Keqin Liu

We consider the channel sensing problem arising in opportunistic scheduling over fading channels, cognitive radio networks, and resource constrained jamming. The communication system consists of N channels. Each channel is modeled as a…

Systems and Control · Computer Science 2013-05-31 Yi Ouyang , Demosthenis Teneketzis

A restless multi-armed bandit problem that arises in multichannel opportunistic communications is considered, where channels are modeled as independent and identical Gilbert-Elliot channels and channel state observations are subject to…

Networking and Internet Architecture · Computer Science 2008-11-13 Qing Zhao , Bhaskar Krishnamachari

Recent works have developed a simple and robust myopic sensing policy for multi-channel opportunistic communication systems where a secondary user (SU) can access one of N i.i.d. Markovian channels. The optimality of the myopic sensing…

Information Theory · Computer Science 2011-03-10 Kehao Wang , Lin Chen

This paper considers a widely studied stochastic control problem arising from opportunistic spectrum access (OSA) in a multi-channel system, with the goal of providing a unifying analytical framework whereby a number of prior results may be…

Information Theory · Computer Science 2013-09-17 Yang Liu , Mingyan Liu , Sahand Haji Ali Ahmad

A multi-access wireless network with N transmitting nodes, each equipped with an energy harvesting (EH) device and a rechargeable battery of finite capacity, is studied. At each time slot (TS) a node is operative with a certain probability,…

Information Theory · Computer Science 2015-01-05 Pol Blasco , Deniz Gunduz

This paper considers the following stochastic control problem that arises in opportunistic spectrum access: a system consists of n channels (Gilbert-Elliot channels)where the state (good or bad) of each channel evolves as independent and…

Information Theory · Computer Science 2009-10-13 Sahand Haji Ali Ahmad , Mingyan Liu

The problem of minimizing queueing delay of opportunistic access of multiple continuous time Markov channels is considered. A new access policy based on myopic sensing and adaptive transmission (MS-AT) is proposed. Under the framework of…

Optimization and Control · Mathematics 2011-08-02 Shiyao Chen , Lang Tong , Qing Zhao

In the classic Bayesian restless multi-armed bandit (RMAB) problem, there are $N$ arms, with rewards on all arms evolving at each time as Markov chains with known parameters. A player seeks to activate $K \geq 1$ arms at each time in order…

Optimization and Control · Mathematics 2011-12-25 Wenhan Dai , Yi Gai , Bhaskar Krishnamachari , Qing Zhao

In the classic Bayesian restless multi-armed bandit (RMAB) problem, there are $N$ arms, with rewards on all arms evolving at each time as Markov chains with known parameters. A player seeks to activate $K \geq 1$ arms at each time in order…

Optimization and Control · Mathematics 2010-11-23 Wenhan Dai , Yi Gai , Bhaskar Krishnamachari , Qing Zhao

In this paper, the problem of opportunistic channel sensing and access in cognitive radio networks when the sensing is imperfect and a secondary user has limited traffic to send at a time is investigated. Primary users' statistical…

Information Theory · Computer Science 2012-01-23 Zhou Zhang , Hai Jiang , Peng Tan , Jim Slevinsky

We study the restless contextual multi-play multi-armed bandit (MP-MAB) problem for channel allocation in the opportunity spectrum access (OSA) scenario. Most existing MP-MAB methods are impractical for real-world OSA systems as they assume…

Machine Learning · Computer Science 2026-05-26 Ruiyu Li , Guangxia Li , Xiao Lu , Jichao Liu , Yan Jin

We consider a class of restless multi-armed bandit problems (RMBP) that arises in dynamic multichannel access, user/server scheduling, and optimal activation in multi-agent systems. For this class of RMBP, we establish the indexability and…

Information Theory · Computer Science 2008-11-13 Keqin Liu , Qing Zhao

Designing efficient channel access schemes for wireless communications without any prior knowledge about the nature of environments has been a very challenging issue, especially when the channel states distribution of all spectrum resources…

Networking and Internet Architecture · Computer Science 2016-11-17 Pan Zhou , Tao Jiang

This paper establishes the equivalence between cognitive medium access and the competitive multi-armed bandit problem. First, the scenario in which a single cognitive user wishes to opportunistically exploit the availability of empty…

Information Theory · Computer Science 2007-10-09 Lifeng Lai , Hesham El Gamal , Hai Jiang , H. Vincent Poor

We study a problem of information gathering in a social network with dynamically available sources and time varying quality of information. We formulate this problem as a restless multi-armed bandit (RMAB). In this problem, information…

Systems and Control · Computer Science 2018-01-22 Varun Mehta , Rahul Meshram , Kesav Kaza , S. N. Merchant

This paper addresses the problem of optimal control of robotic sensing systems aimed at autonomous information gathering in scenarios such as environmental monitoring, search and rescue, and surveillance and reconnaissance. The information…

Systems and Control · Computer Science 2016-01-28 Mikko Lauri , Nikolay Atanasov , George J. Pappas , Risto Ritala
‹ Prev 1 2 3 10 Next ›