Optimal-Delay-Guaranteed Energy Efficient Cooperative Offloading in VEC Networks

Globecom, pp. 1–6

Abstract

Taking into consideration of vehicle mobility and fairness, in this paper we provide a cooperative offloading algorithm maximizing the energy efficiency for a vehicular edge computing network, while guaranteeing the shortest delay of the worst-case vehicle. In particular, through exploiting the geometrical feature of the unidirectional road, we formulate a mixed integer convex problem by jointly designing the offloading selection and allocating the computation resource simultaneously. The optimization is carried out by a proposed two-step optimization algorithm: We first optimize the server selection to obtain the minimized achievable delay, and subsequently optimize jointly the selection and resource allocation to maximize the energy efficiency while maintaining the optimal achievable delay. Via simulations, we show the advantage of proposed algorithms and evaluate the system performance.

Authors 5

1. Yao Lin Zhu Aachen ISEK Research Group

   RWTH Aachen University

   Affiliation as printed

   ISEK Research Group, RWTH Aachen, Germany

2. Tianyu Yang

   Technische Universität Berlin

   Affiliation as printed

   Communications and Information Theory Group (CommIT), TU Berlin, Germany

3. Yulin Hu Aachen ISEK Research Group

   RWTH Aachen University

   Affiliation as printed

   ISEK Research Group, RWTH Aachen, Germany

4. Wanting Gao Aachen ISEK Research Group

   RWTH Aachen University

   Affiliation as printed

   ISEK Research Group, RWTH Aachen, Germany

5. Anke Schmeink Aachen ISEK Research Group

   RWTH Aachen University

   Affiliation as printed

   ISEK Research Group, RWTH Aachen, Germany