A Task Allocation Algorithm for Profit Maximization in NFC-RAN

Yang Cai, Xiaofeng Lu, Yuansheng Luo, Kezhi Wang, Dongwei Chen, Kun Yang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Citations (Scopus)
10 Downloads (Pure)


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.
Original languageEnglish
Title of host publication2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)
Place of PublicationPiscataway, NJ
Number of pages5
ISBN (Electronic)9781538677476
ISBN (Print)9781538677483
Publication statusE-pub ahead of print - 22 Jul 2019
Event15th International Wireless Communications and Mobile Computing Conference: Connecting the IoT - Kenzi Solazur Hotel, Tangier, Morocco
Duration: 24 Jun 201928 Jun 2019


Conference15th International Wireless Communications and Mobile Computing Conference
Abbreviated titleIWCMC 2019
Internet address


Dive into the research topics of 'A Task Allocation Algorithm for Profit Maximization in NFC-RAN'. Together they form a unique fingerprint.

Cite this