Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0905.3436

On Active Learning and Supervised Transmission of Spectrum Sharing Based Cognitive Radios by Exploiting Hidden Primary Radio Feedback

Rui Zhang
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper studies the wireless spectrum sharing between a pair of distributed primary radio (PR) and cognitive radio (CR) links. Assuming that the PR link adapts its transmit power and/or rate upon receiving an interference signal from the CR and such transmit adaptations are observable by the CR, this results in a new form of feedback from the PR to CR, refereed to as hidden PR feedback, whereby the CR learns the PR's strategy for transmit adaptations without the need of a dedicated feedback channel from the PR. In this paper, we exploit the hidden PR feedback to design new learning and transmission schemes for spectrum sharing based CRs, namely active learning and supervised transmission. For active learning, the CR initiatively sends a probing signal to interfere with the PR, and from the observed PR transmit adaptations the CR estimates the channel gain from its transmitter to the PR receiver, which is essential for the CR to control its interference to the PR during the subsequent data transmission. This paper proposes a new transmission protocol for the CR to implement the active learning and the solutions to deal with various practical issues for implementation, such as time synchronization, rate estimation granularity, power measurement noise, and channel variation. Furthermore, with the acquired knowledge from active learning, the CR designs a supervised data transmission by effectively controlling the interference powers both to and from the PR, so as to achieve the optimum performance tradeoffs for the PR and CR links. Numerical results are provided to evaluate the effectiveness of the proposed schemes for CRs under different system setups.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rui Zhang. 2010-06-21. On Active Learning and Supervised Transmission of Spectrum Sharing Based Cognitive Radios by Exploiting Hidden Primary Radio Feedback. https://arxiv.org/abs/0905.3436

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT↗
arXiv2026

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT↗
arXiv2026

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT↗