A Combinatorial Auction for Joint Radio and Processing Resource Allocation in C-RAN

Mira Morcos; Jocelyne Elias; Fabio Martignon; Lin Chen; Tijani Chahed

doi:10.1109/ICC.2019.8762077

A Combinatorial Auction for Joint Radio and Processing Resource Allocation in C-RAN

Mira Morcos
, Jocelyne Elias
, Fabio Martignon
, Lin Chen
, Tijani Chahed

Université de Paris

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

In this paper, we propose a truthful combinatorial auction for the joint radio and processing resource allocation problem in the context of a Cloud-based Radio Access Network (C-RAN). We formulate the auction as an Integer Linear Program (ILP), taking into accurate account interference constraints while leveraging radio resource reuse to generate an optimal revenue for the RAN operator. Then, we propose Truthful Greedy Approach (TGA), an effective and truthful heuristic that guarantees a close-to-optimum revenue compared to the one obtained with the ILP formulation. Extensive simulations, conducted in representative network scenarios, compare and evaluate our auction with state-of-the-art approaches from the literature, showing its effectiveness.

Original language	English
Title of host publication	2019 IEEE International Conference on Communications, ICC 2019 - Proceedings
Publisher	Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)	9781538680889
DOIs	https://doi.org/10.1109/ICC.2019.8762077
Publication status	Published - 1 May 2019
Externally published	Yes
Event	2019 IEEE International Conference on Communications, ICC 2019 - Shanghai, China Duration: 20 May 2019 → 24 May 2019

Publication series

Name	IEEE International Conference on Communications
Volume	2019-May
ISSN (Print)	1550-3607

Conference

Conference	2019 IEEE International Conference on Communications, ICC 2019
Country/Territory	China
City	Shanghai
Period	20/05/19 → 24/05/19

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 12 Responsible Consumption and Production

Keywords

C-RAN
Combinatorial auction
Multi-resource allocation
Truthfulness

Access to Document

10.1109/ICC.2019.8762077

Cite this

Morcos, M., Elias, J., Martignon, F., Chen, L., & Chahed, T. (2019). A Combinatorial Auction for Joint Radio and Processing Resource Allocation in C-RAN. In 2019 IEEE International Conference on Communications, ICC 2019 - Proceedings Article 8762077 (IEEE International Conference on Communications; Vol. 2019-May). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICC.2019.8762077

@inproceedings{5b8cce81b3894849b39fd23fddba3185,

title = "A Combinatorial Auction for Joint Radio and Processing Resource Allocation in C-RAN",

abstract = "In this paper, we propose a truthful combinatorial auction for the joint radio and processing resource allocation problem in the context of a Cloud-based Radio Access Network (C-RAN). We formulate the auction as an Integer Linear Program (ILP), taking into accurate account interference constraints while leveraging radio resource reuse to generate an optimal revenue for the RAN operator. Then, we propose Truthful Greedy Approach (TGA), an effective and truthful heuristic that guarantees a close-to-optimum revenue compared to the one obtained with the ILP formulation. Extensive simulations, conducted in representative network scenarios, compare and evaluate our auction with state-of-the-art approaches from the literature, showing its effectiveness.",

keywords = "C-RAN, Combinatorial auction, Multi-resource allocation, Truthfulness",

author = "Mira Morcos and Jocelyne Elias and Fabio Martignon and Lin Chen and Tijani Chahed",

note = "Publisher Copyright: {\textcopyright} 2019 IEEE.; 2019 IEEE International Conference on Communications, ICC 2019 ; Conference date: 20-05-2019 Through 24-05-2019",

year = "2019",

month = may,

day = "1",

doi = "10.1109/ICC.2019.8762077",

language = "English",

series = "IEEE International Conference on Communications",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

booktitle = "2019 IEEE International Conference on Communications, ICC 2019 - Proceedings",

}

Morcos, M, Elias, J, Martignon, F, Chen, L & Chahed, T 2019, A Combinatorial Auction for Joint Radio and Processing Resource Allocation in C-RAN. in 2019 IEEE International Conference on Communications, ICC 2019 - Proceedings., 8762077, IEEE International Conference on Communications, vol. 2019-May, Institute of Electrical and Electronics Engineers Inc., 2019 IEEE International Conference on Communications, ICC 2019, Shanghai, China, 20/05/19. https://doi.org/10.1109/ICC.2019.8762077

A Combinatorial Auction for Joint Radio and Processing Resource Allocation in C-RAN. / Morcos, Mira; Elias, Jocelyne; Martignon, Fabio et al.
2019 IEEE International Conference on Communications, ICC 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. 8762077 (IEEE International Conference on Communications; Vol. 2019-May).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A Combinatorial Auction for Joint Radio and Processing Resource Allocation in C-RAN

AU - Morcos, Mira

AU - Elias, Jocelyne

AU - Martignon, Fabio

AU - Chen, Lin

AU - Chahed, Tijani

PY - 2019/5/1

Y1 - 2019/5/1

N2 - In this paper, we propose a truthful combinatorial auction for the joint radio and processing resource allocation problem in the context of a Cloud-based Radio Access Network (C-RAN). We formulate the auction as an Integer Linear Program (ILP), taking into accurate account interference constraints while leveraging radio resource reuse to generate an optimal revenue for the RAN operator. Then, we propose Truthful Greedy Approach (TGA), an effective and truthful heuristic that guarantees a close-to-optimum revenue compared to the one obtained with the ILP formulation. Extensive simulations, conducted in representative network scenarios, compare and evaluate our auction with state-of-the-art approaches from the literature, showing its effectiveness.

AB - In this paper, we propose a truthful combinatorial auction for the joint radio and processing resource allocation problem in the context of a Cloud-based Radio Access Network (C-RAN). We formulate the auction as an Integer Linear Program (ILP), taking into accurate account interference constraints while leveraging radio resource reuse to generate an optimal revenue for the RAN operator. Then, we propose Truthful Greedy Approach (TGA), an effective and truthful heuristic that guarantees a close-to-optimum revenue compared to the one obtained with the ILP formulation. Extensive simulations, conducted in representative network scenarios, compare and evaluate our auction with state-of-the-art approaches from the literature, showing its effectiveness.

KW - C-RAN

KW - Combinatorial auction

KW - Multi-resource allocation

KW - Truthfulness

UR - https://www.scopus.com/pages/publications/85070203224

U2 - 10.1109/ICC.2019.8762077

DO - 10.1109/ICC.2019.8762077

M3 - Conference contribution

AN - SCOPUS:85070203224

T3 - IEEE International Conference on Communications

BT - 2019 IEEE International Conference on Communications, ICC 2019 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2019 IEEE International Conference on Communications, ICC 2019

Y2 - 20 May 2019 through 24 May 2019

ER -

A Combinatorial Auction for Joint Radio and Processing Resource Allocation in C-RAN

Abstract

Publication series

Conference

UN SDGs

Keywords

Access to Document

Other files and links

Fingerprint

Cite this