A Task Allocation Algorithm for Profit Maximization in NFC-RAN

Cai, Yang, Lu, Xiaofeng, Luo, Yuansheng, Wang, Kezhi, Chen, Dongwei and Yang, Kun (2019) A Task Allocation Algorithm for Profit Maximization in NFC-RAN. In: 2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC). IEEE, Piscataway, NJ, pp. 203-207. ISBN 9781538677483

[img]
Preview
Text
1570527548 (8).pdf - Accepted Version

Download (411kB) | Preview

Abstract

In this paper, we study a general Near-Far Computing Enhanced C-RAN (NFC-RAN), in which users can offload the tasks to the near edge cloud (NEC) or the far edge cloud (FEC).We aim to propose a profit-aware task allocation model by maximizing the profit of the edge cloud operators. We first prove that this problem can be transformed to a Multiple-Choice Multi-Dimensional 0-1 Knapsack Problem (MMKP), which is NP-hard. Then, we solve it by using a low complexity heuristic algorithm. The simulation results show that the proposed algorithm achieves a good tradeoff between the performance and the complexity compared with the benchmark algorithm.

Item Type: Book Section
Subjects: G900 Others in Mathematical and Computing Sciences
Department: Faculties > Engineering and Environment > Computer and Information Sciences
Depositing User: Becky Skoyles
Date Deposited: 07 May 2019 12:00
Last Modified: 27 May 2020 10:00
URI: http://nrl.northumbria.ac.uk/id/eprint/39200

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics