Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1409.5954

An Energy Efficiency policy for Communications with C-RAN, ICN and Transition Smooth

Di Zhang·Zhenyu Zhou·Takuro Sato
View original source ↗Read source document ↗Export metadata ↓

Abstract

Towards next generation communications, Energy Efficiency (EE) attracts lots of attentions nowadays. Some innovative techniques have been proposed in prior literatures, especially the sleep mechanism of base station (BS). Yet how to sleep and when to sleep are still vague concepts. Another, most of the studies focus on the cellular section or core networks separately while integral and comprehensive version is neglected in prior literatures. In this paper,the integral optimization structure is studied based on cloud radio network (C-RAN) and information centric network (ICN) that raised latest combined with the sleep mode. The original C-RAN and ICN structures are amended in terms of reality application of sleep techniques. While adopting the sleep techniques both in core and cellular, apart from previous works, a transition smooth method that solve the current surge problems which is ignored before is further proposed. Based on the new method, it will be much more feasible to adopt the sleep techniques by knowing the appropriate occasion for transition between sleep and idle mode. Comprehensive computer based simulation results demonstrate that this integer proposal achieves better EE feature with negligible impact on quality of service (QoS) of user equipments (UEs).

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Di Zhang, Zhenyu Zhou, Takuro Sato. 2014-09-21. An Energy Efficiency policy for Communications with C-RAN, ICN and Transition Smooth. https://arxiv.org/abs/1409.5954

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↗