Search arXivSearch

arXiv · 1002.1584

Power Control for Maximum Throughput in Spectrum Underlay Cognitive Radio Networks

Abstract

We investigate power allocation for users in a spectrum underlay cognitive network. Our objective is to find a power control scheme that allocates transmit power for both primary and secondary users so that the overall network throughput is maximized while maintaining the quality of service (QoS) of the primary users greater than a certain minimum limit. Since an optimum solution to our problem is computationally intractable, as the optimization problem is non-convex, we propose an iterative algorithm based on sequential geometric programming, that is proved to converge to at least a local optimum solution. We use the proposed algorithm to show how a spectrum underlay network would achieve higher throughput with secondary users operation than with primary users operating alone. Also, we show via simulations that the loss in primary throughput due to the admission of the secondary users is accompanied by a reduction in the total primary transmit power.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

John Tadrous, Ahmed Sultan, Mohammed Nafie, Amr El-Keyi. 2010-02-08. Power Control for Maximum Throughput in Spectrum Underlay Cognitive Radio Networks. https://arxiv.org/abs/1002.1584

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

KEEP EXPLORING

Related papers

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

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

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