Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1611.01786

Energy-Efficient Resource Allocation for Multi-User Mobile Edge Computing

Junfeng Guo·Zhaozhe Song·Ying Cui
View original source ↗Read source document ↗Export metadata ↓

Abstract

To increase mobile batteries' lifetime and improve quality of experience for computation-intensive and latency-sensitive applications, mobile edge computing has received significant interest. Designing energy-efficient mobile edge computing systems requires joint optimization of communication and computation resources. In this paper, we consider energy-efficient resource allocation for a multi-user mobile edge computing system. First, we establish on two computation-efficient models with negligible and non-negligible base station (BS) executing durations, respectively. Then, under each model, we formulate the overall weighted sum energy consumption minimization problem by optimally allocating communication and computation resources. The optimization problem for negligible BS executing duration is convex, and we obtain the optimal solution in closed-form to this problem. The optimization problem for non-negligible BS executing duration is NP-hard in general, and we obtain a sub-optimal solution with low-complexity to this problem, by connecting it to a three-stage flow-shop scheduling problem and wisely utilizing Johnson's algorithm. Finally, numerical results show that the proposed solutions outperform some baseline schemes.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Junfeng Guo, Zhaozhe Song, Ying Cui. 2016-11-06. Energy-Efficient Resource Allocation for Multi-User Mobile Edge Computing. https://arxiv.org/abs/1611.01786

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↗