A belief propagation approach for distributed user association in heterogeneous networks

Chen, Y; Li, J; Chen, HH; Lin, Z; Mao, G; Cai, J

A belief propagation approach for distributed user association in heterogeneous networks

Chen, Y Li, J Chen, HH Lin, Z Mao, G

Cai, J

Permalink

Publication Type:: Conference Proceeding
Citation:: IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC, 2014, 2014-June pp. 1793 - 1797
Issue Date:: 2014-06-25

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Accepted Manuscript VersionAdobe PDF (273.21 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Chen, Y	en_US
dc.contributor.author	Li, J	en_US
dc.contributor.author	Chen, HH	en_US
dc.contributor.author	Lin, Z	en_US
dc.contributor.author	Mao, G https://orcid.org/0000-0002-3598-4949	en_US
dc.contributor.author	Cai, J	en_US
dc.date.issued	2014-06-25	en_US
dc.identifier.citation	IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC, 2014, 2014-June pp. 1793 - 1797	en_US
dc.identifier.isbn	9781479949120	en_US
dc.identifier.uri	http://hdl.handle.net/10453/41072
dc.description.abstract	© 2014 IEEE. In heterogeneous networks (HetNets), the load between macro-cell base stations (MBSs) and small-cell BSs (SBSs) is imbalanced due to transmit power disparities and ad-hoc deployment of SBSs. This significantly impacts the system performance and user experience. Associating more users to the SBSs is an effective way to solve this problem. In this paper, we formulate the user-BS association problem as a distributed optimization problem with proportional fairness as the objective. Specifically, we propose a novel distribute algorithm based on the belief propagation (BP) method to solve the user-BS association problem via iteratively message passing between the users and BSs. Also, we develop an approximation calculation in the BP method to reduce the computational complexity and transmission overhead of message passing. Simulation results show that the proposed algorithm well approaches the optimal system performance (by exhausting search) with low complexity and fast convergence.	en_US
dc.relation.ispartof	IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC	en_US
dc.relation.isbasedon	10.1109/PIMRC.2014.7136460	en_US
dc.title	A belief propagation approach for distributed user association in heterogeneous networks	en_US
dc.type	Conference Proceeding
utslib.citation.volume	2014-June	en_US
utslib.for	080501 Distributed and Grid Systems	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney/Strength - CRIN - Realtime Information Networks
utslib.copyright.status	open_access
pubs.publication-status	Published	en_US
pubs.volume	2014-June	en_US

Abstract:

© 2014 IEEE. In heterogeneous networks (HetNets), the load between macro-cell base stations (MBSs) and small-cell BSs (SBSs) is imbalanced due to transmit power disparities and ad-hoc deployment of SBSs. This significantly impacts the system performance and user experience. Associating more users to the SBSs is an effective way to solve this problem. In this paper, we formulate the user-BS association problem as a distributed optimization problem with proportional fairness as the objective. Specifically, we propose a novel distribute algorithm based on the belief propagation (BP) method to solve the user-BS association problem via iteratively message passing between the users and BSs. Also, we develop an approximation calculation in the BP method to reduce the computational complexity and transmission overhead of message passing. Simulation results show that the proposed algorithm well approaches the optimal system performance (by exhausting search) with low complexity and fast convergence.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/41072