Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1702.03507

Sense-and-Predict: Opportunistic MAC Based on Spatial Interference Correlation for Cognitive Radio Networks

Jeemin Kim·Seung-Woo Ko·Han Cha·Seong-Lyun Kim
View original source ↗Read source document ↗Export metadata ↓

Abstract

Opportunity detection at secondary transmitters (TXs) is a key technique enabling cognitive radio (CR) networks. Such detection however cannot guarantee reliable communication at secondary receivers (RXs), especially when their association distance is long. To cope with the issue, this paper proposes a novel MAC called sense-and-predict (SaP), where each secondary TX decides whether to access or not based on the prediction of the interference level at RX. Firstly, we provide the spatial interference correlation in a probabilistic form using stochastic geometry, and utilize it to maximize the area spectral efficiency (ASE) for secondary networks while guaranteeing the service quality of primary networks. Through simulations and testbed experiments using USRP, SaP is shown to always achieve ASE improvement compared with the conventional TX based sensing.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jeemin Kim, Seung-Woo Ko, Han Cha, Seong-Lyun Kim. 2017-02-12. Sense-and-Predict: Opportunistic MAC Based on Spatial Interference Correlation for Cognitive Radio Networks. https://arxiv.org/abs/1702.03507

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↗