Average Throughput of Myopic Policy for Opportunistic Access Over Block Fading Channels

Date

2019-03-01

Author

Gül, Ömer Melih

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

210
views

0
downloads

This letter considers a multi-channel access problem in a cognitive radio network with M primary users and a multi-channel secondary user (SU). SU selects K channels for transmission without knowing the channel states or statistics of channel evolution processes. If SU senses that a selected channel is available, it sends data over that channel at that time. Otherwise, SU does not use it in that slot. Under average throughput criteria, myopic policy is proposed and upper bounds of its throughput performance are derived for this problem. It is shown that it achieves optimality over block fading channels for certain channel evolution processes although it is generally suboptimal.

Subject Keywords

Cognitive radio, Wireless network, Opportunistic spectrum access, Resource allocation, Scheduling algorithms

URI

https://hdl.handle.net/11511/57914

Journal

IEEE Networking Letters

DOI

https://doi.org/10.1109/lnet.2019.2894095

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks Kadota, Igor; Sinha, Abhishek; Uysal, Elif; Singh, Rahul; Modiano, Eytan (2018-12-01) In this paper, we consider a wireless broadcast network with a base station sending time-sensitive information to a number of clients through unreliable channels. The Age of Information (AoI), namely the amount of time that elapsed since the most recently delivered packet was generated, captures the freshness of the information. We formulate a discrete-time decision problem to find a transmission scheduling policy that minimizes the expected weighted sum AoI of the clients in the network. We first show that...
Average Throughput Performance of Myopic Policy in Energy Harvesting Wireless Sensor Networks Gül, Ömer Melih; Demirekler, Mübeccel (MDPI AG, 2017-9-26) This paper considers a single-hop wireless sensor network where a fusion center collects data from M energy harvesting wireless sensors. The harvested energy is stored losslessly in an infinite-capacity battery at each sensor. In each time slot, the fusion center schedules K sensors for data transmission over K orthogonal channels. The fusion center does not have direct knowledge on the battery states of sensors, or the statistics of their energy harvesting processes. The fusion center only has information ...
Near-optimal opportunistic spectrum access in cognitive radio networks in the 5G and IoT era Gül, Ömer Melih (2021-10-04) © 2021 IEEE.We consider a cognitive radio network consisting of M primary users, M primary receivers, a secondary user with K channels and K secondary receivers. A channel is assigned to each primary user for transmitting data to a primary receiver. Secondary user is assumed as data backlogged. The secondary user has no direct information on states (good or bad) of M channels, or statistic of channel evolution process. Secondary user chooses K channels for transmission in each time slot. If secondary user s...
Near optimal scheduling for opportunistic spectrum access over block fading channels in cognitive radio assisted vehicular network Gül, Ömer Melih; Kantarci, Burak (2022-10-01) © 2022 Elsevier Inc.With the increasing use of cognitive radio technology in vehicular communications, vehicles will be enabled with cognitive radio in the future. Cognitive radio assisted vehicular networks make cognitive radio enabled vehicles utilize licensed spectrum on highways opportunistically. This work tackles cognitive radio assisted vehicular networks including M primary users (transmitter), M primary receivers, a secondary user (transmitter) with K channels and K secondary receivers. A channel i...
Performance Comparisons of Relaying Schemes in Bi-directional Demodulate-and-Forward Channels ÖZDEMİR, ÖZGÜR; Yılmaz, Ali Özgür; Aktas, Emre (2012-04-04) Bi-directional relaying (BDR) in which two users wish to exchange independent information in presence of a relay is one of the fundamental wireless network coding applications that attracted intense interests recently. In this paper, maximum likelihood (ML), cooperative maximal ratio combining (CMRC) and soft information relaying (SIR) schemes proposed to combat error propagation in wireless relay systems are applied to the BDR scenario with demodulate-and-forward protocol, which decreases system complexity...

Citation Formats

Ö. M. Gül, “Average Throughput of Myopic Policy for Opportunistic Access Over Block Fading Channels,” IEEE Networking Letters, pp. 38–41, 2019, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/57914.