Antenna allocation and pricing in virtualized massive MIMO networks via Stackelberg game

Ye Liu, Mahsa Derakhshani, Saeedeh Parsaeefard, Sangarapillai Lambotharan, Kai-Kit Wong

Research output: Contribution to journalArticle

1 Citation (Scopus)
1 Downloads (Pure)

Abstract

We study a resource allocation problem for the uplink of a virtualized massive multiple-input multiple-output system, where the antennas at the base station are priced and virtualized among the service providers (SPs). The mobile network operator (MNO) who owns the infrastructure decides the price per antenna, and a Stackelberg game is formulated for the net profit maximization of the MNO, while the minimum rate requirements of SPs are satisfied. To solve the bi-level optimization problem of the MNO, we first derive the closed-form best responses of the SPs with respect to the pricing strategies of the MNO, such that the problem of the MNO can be reduced to a single-level optimization. Then, via transformations and approximations, we cast the MNO's problem with integer constraints into a signomial geometric program (SGP), and we propose an iterative algorithm based on the successive convex approximation (SCA) to solve the SGP. Simulation results show that the proposed algorithm has performance close to the global optimum. Moreover, the interactions between the MNO and SPs in different scenarios are explored via simulations.
Original languageEnglish
Pages (from-to)5220-5234
Number of pages15
JournalIEEE Transactions on Communications
Volume66
Issue number11
DOIs
Publication statusPublished - Nov 2018
Externally publishedYes

Fingerprint

MIMO systems
Wireless networks
Antennas
Costs
Base stations
Resource allocation
Profitability

Bibliographical note

Open Access

Copyright © and Moral Rights are retained by the author(s) and/ or other copyright owners. A copy can be downloaded for personal non-commercial research or study, without prior permission or charge. This item cannot be reproduced or quoted extensively from without first obtaining permission in writing from the copyright holder(s). The content must not be changed in any way or sold commercially in any format or medium without the formal permission of the copyright holders.

Cite this

Antenna allocation and pricing in virtualized massive MIMO networks via Stackelberg game. / Liu, Ye; Derakhshani, Mahsa; Parsaeefard, Saeedeh; Lambotharan, Sangarapillai; Wong, Kai-Kit.

In: IEEE Transactions on Communications, Vol. 66, No. 11, 11.2018, p. 5220-5234.

Research output: Contribution to journalArticle

Liu, Ye ; Derakhshani, Mahsa ; Parsaeefard, Saeedeh ; Lambotharan, Sangarapillai ; Wong, Kai-Kit. / Antenna allocation and pricing in virtualized massive MIMO networks via Stackelberg game. In: IEEE Transactions on Communications. 2018 ; Vol. 66, No. 11. pp. 5220-5234.
@article{d80f2b49e78147a2bb09dc1de2cbee4f,
title = "Antenna allocation and pricing in virtualized massive MIMO networks via Stackelberg game",
abstract = "We study a resource allocation problem for the uplink of a virtualized massive multiple-input multiple-output system, where the antennas at the base station are priced and virtualized among the service providers (SPs). The mobile network operator (MNO) who owns the infrastructure decides the price per antenna, and a Stackelberg game is formulated for the net profit maximization of the MNO, while the minimum rate requirements of SPs are satisfied. To solve the bi-level optimization problem of the MNO, we first derive the closed-form best responses of the SPs with respect to the pricing strategies of the MNO, such that the problem of the MNO can be reduced to a single-level optimization. Then, via transformations and approximations, we cast the MNO's problem with integer constraints into a signomial geometric program (SGP), and we propose an iterative algorithm based on the successive convex approximation (SCA) to solve the SGP. Simulation results show that the proposed algorithm has performance close to the global optimum. Moreover, the interactions between the MNO and SPs in different scenarios are explored via simulations.",
author = "Ye Liu and Mahsa Derakhshani and Saeedeh Parsaeefard and Sangarapillai Lambotharan and Kai-Kit Wong",
note = "Open Access Copyright {\circledC} and Moral Rights are retained by the author(s) and/ or other copyright owners. A copy can be downloaded for personal non-commercial research or study, without prior permission or charge. This item cannot be reproduced or quoted extensively from without first obtaining permission in writing from the copyright holder(s). The content must not be changed in any way or sold commercially in any format or medium without the formal permission of the copyright holders.",
year = "2018",
month = "11",
doi = "10.1109/TCOMM.2018.2846574",
language = "English",
volume = "66",
pages = "5220--5234",
journal = "IEEE Transactions on Communications",
issn = "0096-1965",
publisher = "Institute of Electrical and Electronics Engineers",
number = "11",

}

TY - JOUR

T1 - Antenna allocation and pricing in virtualized massive MIMO networks via Stackelberg game

AU - Liu, Ye

AU - Derakhshani, Mahsa

AU - Parsaeefard, Saeedeh

AU - Lambotharan, Sangarapillai

AU - Wong, Kai-Kit

N1 - Open Access Copyright © and Moral Rights are retained by the author(s) and/ or other copyright owners. A copy can be downloaded for personal non-commercial research or study, without prior permission or charge. This item cannot be reproduced or quoted extensively from without first obtaining permission in writing from the copyright holder(s). The content must not be changed in any way or sold commercially in any format or medium without the formal permission of the copyright holders.

PY - 2018/11

Y1 - 2018/11

N2 - We study a resource allocation problem for the uplink of a virtualized massive multiple-input multiple-output system, where the antennas at the base station are priced and virtualized among the service providers (SPs). The mobile network operator (MNO) who owns the infrastructure decides the price per antenna, and a Stackelberg game is formulated for the net profit maximization of the MNO, while the minimum rate requirements of SPs are satisfied. To solve the bi-level optimization problem of the MNO, we first derive the closed-form best responses of the SPs with respect to the pricing strategies of the MNO, such that the problem of the MNO can be reduced to a single-level optimization. Then, via transformations and approximations, we cast the MNO's problem with integer constraints into a signomial geometric program (SGP), and we propose an iterative algorithm based on the successive convex approximation (SCA) to solve the SGP. Simulation results show that the proposed algorithm has performance close to the global optimum. Moreover, the interactions between the MNO and SPs in different scenarios are explored via simulations.

AB - We study a resource allocation problem for the uplink of a virtualized massive multiple-input multiple-output system, where the antennas at the base station are priced and virtualized among the service providers (SPs). The mobile network operator (MNO) who owns the infrastructure decides the price per antenna, and a Stackelberg game is formulated for the net profit maximization of the MNO, while the minimum rate requirements of SPs are satisfied. To solve the bi-level optimization problem of the MNO, we first derive the closed-form best responses of the SPs with respect to the pricing strategies of the MNO, such that the problem of the MNO can be reduced to a single-level optimization. Then, via transformations and approximations, we cast the MNO's problem with integer constraints into a signomial geometric program (SGP), and we propose an iterative algorithm based on the successive convex approximation (SCA) to solve the SGP. Simulation results show that the proposed algorithm has performance close to the global optimum. Moreover, the interactions between the MNO and SPs in different scenarios are explored via simulations.

U2 - 10.1109/TCOMM.2018.2846574

DO - 10.1109/TCOMM.2018.2846574

M3 - Article

VL - 66

SP - 5220

EP - 5234

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0096-1965

IS - 11

ER -