Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1403.5735

Cooperative Energy Trading in CoMP Systems Powered by Smart Grids

Jie Xu·Rui Zhang
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper studies the energy management in the coordinated multi-point (CoMP) systems powered by smart grids, where each base station (BS) with local renewable energy generation is allowed to implement the two-way energy trading with the grid. Due to the uneven renewable energy supply and communication energy demand over distributed BSs as well as the difference in the prices for their buying/selling energy from/to the gird, it is beneficial for the cooperative BSs to jointly manage their energy trading with the grid and energy consumption in CoMP based communication for reducing the total energy cost. Specifically, we consider the downlink transmission in one CoMP cluster by jointly optimizing the BSs' purchased/sold energy units from/to the grid and their cooperative transmit precoding, so as to minimize the total energy cost subject to the given quality of service (QoS) constraints for the users. First, we obtain the optimal solution to this problem by developing an algorithm based on techniques from convex optimization and the uplink-downlink duality. Next, we propose a sub-optimal solution of lower complexity than the optimal solution, where zero-forcing (ZF) based precoding is implemented at the BSs. Finally, through extensive simulations, we show the performance gain achieved by our proposed joint energy trading and communication cooperation schemes in terms of energy cost reduction, as compared to conventional schemes that separately design communication cooperation and energy trading.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jie Xu, Rui Zhang. 2015-04-14. Cooperative Energy Trading in CoMP Systems Powered by Smart Grids. https://arxiv.org/abs/1403.5735

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↗