Auction-based competition of hybrid small cells for dropped macrocell users

B. Basutli, S. Lambotharan

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

We propose an auction-based beamforming and user association algorithm for a wireless network consisting of a macrocell and multiple small cell access points (SCAs). The SCAs compete for serving the macrocell base station (MBS) users (MUs). The corresponding user association problem is solved by the proposed bid-wait auction method. The authors considered two scenarios. In the first scenario, the MBS initially admits the largest possible set of MUs that it can serve simultaneously and then auctions off the remaining MUs to the SCAs, who are willing to admit guest users in addition to their commitments to serve their own host users. This problem is solved by the proposed forward bid-wait auction. In the second scenario, the MBS aims to offload as many MUs as possible to the SCAs and then admits the largest possible set of remaining MUs. This is solved by the proposed backward bid-wait auction. The proposed algorithms provide a solution that is very close to the optimum solution obtained by using a centralised global optimisation. © The Institution of Engineering and Technology.
Original languageEnglish
Pages (from-to)695-703
Number of pages9
JournalIET Signal Processing
Volume11
Issue number6
DOIs
Publication statusPublished - 2017

Fingerprint

Base stations
Global optimization
Beamforming
Wireless networks

Cite this

@article{9c691c95c06a4623bdbded36fe444435,
title = "Auction-based competition of hybrid small cells for dropped macrocell users",
abstract = "We propose an auction-based beamforming and user association algorithm for a wireless network consisting of a macrocell and multiple small cell access points (SCAs). The SCAs compete for serving the macrocell base station (MBS) users (MUs). The corresponding user association problem is solved by the proposed bid-wait auction method. The authors considered two scenarios. In the first scenario, the MBS initially admits the largest possible set of MUs that it can serve simultaneously and then auctions off the remaining MUs to the SCAs, who are willing to admit guest users in addition to their commitments to serve their own host users. This problem is solved by the proposed forward bid-wait auction. In the second scenario, the MBS aims to offload as many MUs as possible to the SCAs and then admits the largest possible set of remaining MUs. This is solved by the proposed backward bid-wait auction. The proposed algorithms provide a solution that is very close to the optimum solution obtained by using a centralised global optimisation. {\circledC} The Institution of Engineering and Technology.",
author = "B. Basutli and S. Lambotharan",
note = "Export Date: 18 June 2018",
year = "2017",
doi = "10.1049/iet-spr.2016.0168",
language = "English",
volume = "11",
pages = "695--703",
journal = "IET Signal Processing",
issn = "1751-9675",
publisher = "Institution of Engineering and Technology",
number = "6",

}

Auction-based competition of hybrid small cells for dropped macrocell users. / Basutli, B.; Lambotharan, S.

In: IET Signal Processing, Vol. 11, No. 6, 2017, p. 695-703.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Auction-based competition of hybrid small cells for dropped macrocell users

AU - Basutli, B.

AU - Lambotharan, S.

N1 - Export Date: 18 June 2018

PY - 2017

Y1 - 2017

N2 - We propose an auction-based beamforming and user association algorithm for a wireless network consisting of a macrocell and multiple small cell access points (SCAs). The SCAs compete for serving the macrocell base station (MBS) users (MUs). The corresponding user association problem is solved by the proposed bid-wait auction method. The authors considered two scenarios. In the first scenario, the MBS initially admits the largest possible set of MUs that it can serve simultaneously and then auctions off the remaining MUs to the SCAs, who are willing to admit guest users in addition to their commitments to serve their own host users. This problem is solved by the proposed forward bid-wait auction. In the second scenario, the MBS aims to offload as many MUs as possible to the SCAs and then admits the largest possible set of remaining MUs. This is solved by the proposed backward bid-wait auction. The proposed algorithms provide a solution that is very close to the optimum solution obtained by using a centralised global optimisation. © The Institution of Engineering and Technology.

AB - We propose an auction-based beamforming and user association algorithm for a wireless network consisting of a macrocell and multiple small cell access points (SCAs). The SCAs compete for serving the macrocell base station (MBS) users (MUs). The corresponding user association problem is solved by the proposed bid-wait auction method. The authors considered two scenarios. In the first scenario, the MBS initially admits the largest possible set of MUs that it can serve simultaneously and then auctions off the remaining MUs to the SCAs, who are willing to admit guest users in addition to their commitments to serve their own host users. This problem is solved by the proposed forward bid-wait auction. In the second scenario, the MBS aims to offload as many MUs as possible to the SCAs and then admits the largest possible set of remaining MUs. This is solved by the proposed backward bid-wait auction. The proposed algorithms provide a solution that is very close to the optimum solution obtained by using a centralised global optimisation. © The Institution of Engineering and Technology.

U2 - 10.1049/iet-spr.2016.0168

DO - 10.1049/iet-spr.2016.0168

M3 - Article

VL - 11

SP - 695

EP - 703

JO - IET Signal Processing

JF - IET Signal Processing

SN - 1751-9675

IS - 6

ER -