Search arXivSearch

arXiv · 1909.10696

Computation Offloading for IoT in C-RAN: Optimization and Deep Learning

Abstract

We consider computation offloading for Internet-of-things (IoT) applications in multiple-input-multiple-output (MIMO) cloud-radio-access-network (C-RAN). Due to the limited battery life and computational capability in the IoT devices (IoTDs), the computational tasks of the IoTDs are offloaded to a MIMO C-RAN, where a MIMO radio resource head (RRH) is connected to a baseband unit (BBU) through a capacity-limited fronthaul link, facilitated by the spatial filtering and uniform scalar quantization. We formulate a computation offloading optimization problem to minimize the total transmit power of the IoTDs while satisfying the latency requirement of the computational tasks, and find that the problem is non-convex. To obtain a feasible solution, firstly the spatial filtering matrix is locally optimized at the MIMO RRH. Subsequently, we leverage the alternating optimization framework for joint optimization on the residual variables at the BBU, where the baseband combiner is obtained in a closed-form, the resource allocation sub-problem is solved through successive inner convexification, and the number of quantization bits is obtained by a line-search method. As a low-complexity approach, we deploy a supervised deep learning method, which is trained with the solutions to our optimization algorithm. Numerical results validate the effectiveness of the proposed algorithm and the deep learning method.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chandan Pradhan, Ang Li, Changyang She, Yonghui Li, Branka Vucetic. 2019-09-24. Computation Offloading for IoT in C-RAN: Optimization and Deep Learning. https://arxiv.org/abs/1909.10696

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Decoding Delay Guarantees of Space Regulated Multiple Access Random Wireless Networks using Successive Interference Cancellation

This paper is focused on decoding delay guarantees in wireless networks, where messages have a given signal-to-interference-plus-noise ratio threshold $η_0$ to meet in order to be successfully decoded, and where transmissions should occur within some strict time constraints. Its main contribution consists in quantifying the worst-case transmissions decoding delays in the uplink of cellular and cell-free networks using successive interference cancellation. We show how such decoding delay guarantees can be obtained using spatial network calculus, a new tool introduced recently, and in particular spatial regulation. The results rely on the assumption of absence of fading. We nevertheless outline what this approach will lead to in the fading case for cellular networks.

cs.NI

Toward Composable Network Digital Twins: A Subgraph-Based Latency Prediction Study

Modern networks must support changing topologies, configurations, and performance objectives, motivating fast and reliable performance estimation. Network digital twins (NDTs) enable what-if analysis for performance estimation in such network scenarios, however, existing machine learning-based NDT approaches often rely on entire topology representations, which are inherently monolithic and lack reusability under topological or traffic changes in the network. This paper introduces a composable NDT approach that decomposes networks into subgraphs represented by reusable unit twins that capture subgraph structure, configuration and traffic behaviours. A lightweight composer aggregates unit twin combinations to create NDTs that predict per-route end-to-end latency through an overall topology. Evaluation across controlled synthetic topologies and diverse traffic scenarios, real-world Topology Zoo topologies, and a public NDT challenge dataset demonstrates that the composable NDTs achieve high in-distribution accuracy while remaining stable under out-of-distribution scenarios. Comparison with monolithic full topology NDTs demonstrates that our composable approach achieves reusability, while achieving comparable or superior accuracy.

cs.NI

Pattern-Aware Virtual Network Embedding Optimization for Cloud Data Centers

The network virtualization (NV) technology has enabled the sharing of multiple resources among virtual networks (VNs) in cloud data centers. One of the key challenges is to allocate resources in real-time for virtual network request (VNR), which is known as online virtual network embedding (VNE). However, the existing online VNE methods do not exploit the multi-dimensional complementary relationship among diverse VNRs, resulting in the fragmentation and waste of substrate resources. In this paper, we propose the pattern matching based online VNE approach by constructing appropriate matching rules among observed patterns to maximize resources utilization. We devise the clustering based VNRs quantization method and conduct rigorous study on the pattern combination filtering problem. Then, we utilize the column generation to solve it and construct the pattern matching rules. Based on the rules, we propose an online pattern matching VNE algorithm with linear worst-case complexity. Evaluation on a 106-server testbed using Alibaba production cluster trace dataset shows that our algorithm achieves close-to-offline performance and more accepted workloads that outperforms traditional designs by 25%-30%.

cs.NI