Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1703.06483

Enhancing Physical Layer Security in Dual-Hop Multiuser Transmission

Waqas Aman·Guftaar Ahmad Sardar Sidhu·Tayyaba Jabeen·Feifei Gao·Shi Jin
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we consider the Physical Layer Security(PLS) problem in orthogonal frequency division multiple access (OFDMA) based dual-hop system which consists of multiple users, multiple amplify and forward relays, and an eavesdropper. The aim is to enhance PLS of the entire system by maximizing sum secrecy rate of secret users through optimal resource allocation under various practical constraints. Specifically, the sub-carrier allocation to different users, the relay assignments, and the power loading over different sub-carriers at transmitting nodes are optimized. The joint optimization problem is modeled as a mixed binary integer programming problem subject to exclusive sub-carrier allocation and separate power budget constraints at each node. A joint optimization solution is obtained through Lagrangian dual decomposition where KKT conditions are exploited to find the optimal power allocation at base station. Further, to reduce the complexity, a sub-optimal scheme is presented where the optimal power allocation is derived under fixed sub-carrier-relay assignment. Simulation results are also provided to validate the performance of proposed schemes.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Waqas Aman, Guftaar Ahmad Sardar Sidhu, Tayyaba Jabeen, Feifei Gao, Shi Jin. 2017-03-19. Enhancing Physical Layer Security in Dual-Hop Multiuser Transmission. https://doi.org/10.1109/wcnc.2016.7564989

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↗