About | Contact Us | Register | Login
ProceedingsSeriesJournalsSearchEAI
Communications and Networking. 14th EAI International Conference, ChinaCom 2019, Shanghai, China, November 29 – December 1, 2019, Proceedings, Part I

Research Article

A Generic Polynomial-Time Cell Association Scheme in Ultra-Dense Cellular Networks

Download(Requires a free EAI acccount)
5 downloads
Cite
BibTeX Plain Text
  • @INPROCEEDINGS{10.1007/978-3-030-41114-5_31,
        author={Chao Fang and Lusheng Wang and Hai Lin and Min Peng},
        title={A Generic Polynomial-Time Cell Association Scheme in Ultra-Dense Cellular Networks},
        proceedings={Communications and Networking. 14th EAI International Conference, ChinaCom 2019, Shanghai, China, November 29 -- December 1, 2019, Proceedings, Part I},
        proceedings_a={CHINACOM},
        year={2020},
        month={2},
        keywords={Heterogeneous cellular networks Cell association 2-dimensional assignment problem Hungarian algorithm Fairness},
        doi={10.1007/978-3-030-41114-5_31}
    }
    
  • Chao Fang
    Lusheng Wang
    Hai Lin
    Min Peng
    Year: 2020
    A Generic Polynomial-Time Cell Association Scheme in Ultra-Dense Cellular Networks
    CHINACOM
    Springer
    DOI: 10.1007/978-3-030-41114-5_31
Chao Fang1, Lusheng Wang1,*, Hai Lin2, Min Peng1
  • 1: Anhui Province Key Laboratory of Industry Safety and Emergency Technology, School of Computer Science and Information Engineering
  • 2: Key Laboratory of Aerospace Information Security and Trusted Computing, Ministry of Education, School of Cyber Science and Engineering
*Contact email: wanglusheng@hfut.edu.cn

Abstract

Cell association in heterogeneous cellular networks is a significant research issue, but existing schemes mainly optimize a single objective and could not solve such a problem with a generic utility function in polynomial time. This paper proposes a cell association scheme for generic optimization objectives with polynomial-time complexity, which employs a virtual base station method to transform it into a 2-dimensional assignment problem solved by Hungarian algorithm. Based on this scheme, a framework for the tradeoff among multiple optimization objectives is designed. This framework jointly considers spectral efficiency and load balancing, designs a weight factor to adjust their impacts on the optimization, and uses an experience pool to store the relationship between performance demands and corresponding weight factor values. For an instantaneous cell association decision in a given network scenario, the association results are obtained as soon as the corresponding factor value is taken from the pool and the Hungarian algorithm is called for the matching. Compared with existing schemes, our proposal achieves a better tradeoff between system capacity and UE fairness with an extremely low time cost.

Keywords
Heterogeneous cellular networks Cell association 2-dimensional assignment problem Hungarian algorithm Fairness
Published
2020-02-27
Appears in
SpringerLink
http://dx.doi.org/10.1007/978-3-030-41114-5_31
Copyright © 2019–2025 ICST
EBSCOProQuestDBLPDOAJPortico
EAI Logo

About EAI

  • Who We Are
  • Leadership
  • Research Areas
  • Partners
  • Media Center

Community

  • Membership
  • Conference
  • Recognition
  • Sponsor Us

Publish with EAI

  • Publishing
  • Journals
  • Proceedings
  • Books
  • EUDL