Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1607.00591

A Bayesian Network Model of the Bit Error Rate for Cognitive Radio Networks

Hector Reyes·Sriram Subramaniam·Naima Kaabouch
View original source ↗Read source document ↗Export metadata ↓

Abstract

In addition to serve as platforms for dynamic spectrum access, cognitive radios can also serve as a method for improving the performance of wireless communication systems by smartly adjusting their operating parameters according to the environment and requirements. The uncertainty always present in the environment makes the practical implementation of the latter application difficult. In this paper, we propose a probabilistic graphical model, Bayesian network that captures the causal relationships among the variables bit energy to noise spectral density ratio (EbN0), carrier to interference ratio (C/I), modulation scheme (MOD), Doppler phase shift (Dop_Phi), and bit error rate (BER). BER indicates how the communication link is performing. The goal of our proposed Bayesian network is to use the BER as evidence in order to infer the behavior of the other variables, so the cognitive radio can learn how the conditions of the environment are, and based on that knowledge make better informed decisions. This model along with the method used to build it are described in this paper.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hector Reyes, Sriram Subramaniam, Naima Kaabouch. 2016-07-03. A Bayesian Network Model of the Bit Error Rate for Cognitive Radio Networks. https://doi.org/10.1109/wamicon.2015.7120377

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↗