Search arXivSearch

arXiv · 1410.2867

Multiuser Joint Energy-Bandwidth Allocation with Energy Harvesting - Part II: Multiple Broadcast Channels & Proportional Fairness

Abstract

In this paper, we consider the energy-bandwidth allocation for a network with multiple broadcast channels, where the transmitters access the network orthogonally on the assigned frequency band and each transmitter communicates with multiple receivers orthogonally or non-orthogonally. We assume that the energy harvesting state and channel gain of each transmitter can be predicted for $K$ slots {\em a priori}. To maximize the weighted throughput, we formulate an optimization problem with $O(MK)$ constraints, where $M$ is the number of the receivers, and decompose it into the energy and bandwidth allocation subproblems. In order to use the iterative algorithm proposed in [1] to solve the problem, we propose efficient algorithms to solve the two subproblems, so that the optimal energy-bandwidth allocation can be obtained with an overall complexity of ${\cal O}(MK^2)$, even though the problem is non-convex when the broadcast channel is non-orthogonal. For the orthogonal broadcast channel, we further formulate a proportionally-fair (PF) throughput maximization problem and derive the equivalence conditions such that the optimal solution can be obtained by solving a weighted throughput maximization problem. Further, the algorithm to obtain the proper weights is proposed. Simulation results show that the proposed algorithm can make efficient use of the harvested energy and the available bandwidth, and achieve significantly better performance than some heuristic policies for energy and bandwidth allocation. Moreover, it is seen that with energy-harvesting transmitters, non-orthogonal broadcast offers limited gain over orthogonal broadcast.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhe Wang, Vaneet Aggarwal, Xiaodong Wang. 2014-10-10. Multiuser Joint Energy-Bandwidth Allocation with Energy Harvesting - Part II: Multiple Broadcast Channels & Proportional Fairness. https://arxiv.org/abs/1410.2867

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