Polynomial-Time Assignment-Based Cell Association with Generic Utility Functions  

作　　者：Lusheng Wang Chao Fang Hai Lin Min Peng Caihong Kai 

机构地区：[1]Key Laboratory of Knowledge Engineering with Big Data,Ministry of Education.School of Computer Science and Information Engineering,Hefei University of Technology,Hefei 230601,China [2]Key Laboratory of Aerospace Information Security and Trusted Computing,Ministry of Education.School of Cyber Science and Engineering,Wuhan University,Wuhan 430072,China

出　　处：《China Communications》2022年第9期214-228,共15页中国通信（英文版）

基　　金：the results of the research project funded by the National Natural Science Foundation of China under Grant No.61971176;in part by the Applied Basic Research Program of Wuhan City under grand 2017010201010117。

摘　　要：Cell association is a significant research issue in future mobile communication systems due to the unacceptably large computational time of traditional schemes.This article proposes a polynomial-time cell association scheme which not only completes the association in polynomial time but also fits for a generic optimization objective function.On the one hand,traditional cell association as a non-deterministic polynomial(NP)hard problem with a generic utility function is heuristically transformed into a 2-dimensional assignment optimization and solved by a certain polynomial-time algorithm,which significantly saves computational time.On the other hand,the scheme jointly considers utility maximization and load balancing among multiple base stations(BSs)by maintaining an experience pool storing a set of weighting factor values and their corresponding performances.When an association optimization is required,a suitable weighting factor value is taken from the pool to calculate a long square utility matrix and a certain polynomial-time algorithm will be applied for the association.Comparing with several representative schemes,the proposed scheme achieves large system capacity and high fairness within a relatively short computational time.

关 键 词：mobile communication system 2-dimensional assignment problem hungarian algorithm FAIRNESS cell association 

分 类 号：TN929.5[电子电信—通信与信息系统] TP18[电子电信—信息与通信工程]