Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2007.03827

Device-Clustering and Rate-Splitting Enabled Device-to-Device Cooperation Framework in Fog Radio Access Network

Md. Zoheb Hassan·Md. Jahangir Hossain·Julian Cheng·Victor C. M. Leung
View original source ↗Read source document ↗Export metadata ↓

Abstract

Resource allocation is investigated to enhance the performance of device-to-device (D2D) cooperation in a fog radio access network (F-RAN) architecture. Our envisioned framework enables two D2D links to share certain orthogonal radio resource blocks (RRBs) by forming device-clusters. In each device-cluster, both content-holder device-users (DUs) transmit to the content-requester DUs via an enhanced remote radio head (eRRH) over the same RRBs. Such RRBs are shared with the uplink F-RAN as well. The intra device-cluster interference is mitigated by exploiting both uplink and downlink rate-splitting schemes, and the inter device-cluster interference is mitigated by using an orthogonal RRB allocation strategy. Our objective is to maximize the end-to-end sum-rate of the device-clusters while reducing the interference between D2D cooperation and the uplink F-RAN over the shared RRBs. Towards this objective, a joint optimization of device-clustering, transmit power allocations, assignment of device-clusters to the eRRHs, and allocation of RRBs among the device-clusters is presented. Since the joint optimization is NP-hard and intractable, it is decomposed into device-clustering and resource allocation sub-problems, and efficient solutions to both sub-problems are developed. Based on the solutions to the sub-problems, a semi-distributed and convergent algorithm, entitled rate-splitting for multi-hop D2D (RSMD), is proposed to obtain the device-clusters and resource allocation for these device-clusters. Through extensive simulations, efficiency of the proposed RSMD algorithm over several benchmark schemes is demonstrated

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Md. Zoheb Hassan, Md. Jahangir Hossain, Julian Cheng, Victor C. M. Leung. 2021-04-15. Device-Clustering and Rate-Splitting Enabled Device-to-Device Cooperation Framework in Fog Radio Access Network. https://arxiv.org/abs/2007.03827

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↗