[vc_empty_space][vc_empty_space]
Tabu-Search-Based Pilot Assignment for Cell-Free Massive MIMO Systems
Liu H.a, Zhang J.a, Zhang X.b, Kurniawan A.c, Juhana T.d, Ai B.a,e
a School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing, 100044, China
b State Key Laboratory of Integrated Services Networks, Xidian University, Xi’an, 710071, China
c School of Management, Shenzhen Institute of Information Technology, Shenzhen, China
d School of Electrical Engineering and Informatics, Institut Teknologi Bandung, Baandung, Indonesia
e School of Information Engineering, Zhengzhou University, Zhengzhou, 450001, China
[vc_row][vc_column][vc_row_inner][vc_column_inner][vc_separator css=”.vc_custom_1624529070653{padding-top: 30px !important;padding-bottom: 30px !important;}”][/vc_column_inner][/vc_row_inner][vc_row_inner layout=”boxed”][vc_column_inner width=”3/4″ css=”.vc_custom_1624695412187{border-right-width: 1px !important;border-right-color: #dddddd !important;border-right-style: solid !important;border-radius: 1px !important;}”][vc_empty_space][megatron_heading title=”Abstract” size=”size-sm” text_align=”text-left”][vc_column_text]© 1967-2012 IEEE.In this correspondence, an efficient pilot assignment scheme based on tabu search (TS) is proposed to mitigate the severe pilot contamination effect caused by pilot reuse in cell-free massive multiple-input multiple-output systems. By exploiting the local neighborhood search, we first define the neighborhood and search objective function. Then, the tabu list is introduced to record the prohibited solutions and to avoid being trapped in the local optimum. In addition, we consider a fair policy for the pilot reused times to further improve the system performance. We propose a TS-based pilot assignment iterative algorithm to search the suboptimal pilot assignment result with low complexity. Numerical results verify that the proposed TS-based pilot assignment scheme can significantly improve the 95$\%$-likely per-user throughput with similar complexity compared to the conventional random and greedy schemes.[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Author keywords” size=”size-sm” text_align=”text-left”][vc_column_text]Cell-free,Iterative algorithm,Local neighborhood searches,Multiple input multiple output system,Numerical results,Objective functions,pilot assignment,Pilot contaminations[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Indexed keywords” size=”size-sm” text_align=”text-left”][vc_column_text]Cell-free massive multiple-input multiple-output,pilot assignment,pilot contamination,tabu search[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Funding details” size=”size-sm” text_align=”text-left”][vc_column_text]Manuscript received July 21, 2019; revised October 27, 2019; accepted November 24, 2019. Date of publication November 27, 2019; date of current version February 12, 2020. This work was supported in part by the National Key Research and Development Program under Grant 2016YFE0200900, in part by the Royal Society Newton Advanced Fellowship under Grant NA191006, in part by State Key Lab of Rail Traffic Control and Safety under Grants RCS2018ZZ007 and RCS2019ZZ007, in part by National Natural Science Foundation of China under Grants 61971027, U1834210, 61961130391, 61625106, and 61725101, in part by Beijing Natural Science Foundation under Grants 4182049 and L171005, in part by the Open Research Fund of the State Key Laboratory of Integrated Services Networks under Grant ISN20-04, in part by the Engineering Research Center of Mobile Communications, Ministry of Education under Grant CQUPT-MCT-201804, in part by Science and Technology Key Project of Guangdong Province China under Grant 2019B010157001, and in part by the ZTE Corporation. The review of this article was coordinated by Prof. G. Gui. (Corresponding authors: Jiayi Zhang; Xiaodan Zhang.) H. Liu and J. Zhang are with the School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing 100044, China, and also with the State Key Laboratory of Integrated Services Networks, Xidian University, Xi’an 710071, China (e-mail: 15212073@bjtu.edu.cn; jiayizhang@bjtu.edu.cn).[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”DOI” size=”size-sm” text_align=”text-left”][vc_column_text]https://doi.org/10.1109/TVT.2019.2956217[/vc_column_text][/vc_column_inner][vc_column_inner width=”1/4″][vc_column_text]Widget Plumx[/vc_column_text][/vc_column_inner][/vc_row_inner][/vc_column][/vc_row][vc_row][vc_column][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][/vc_column][/vc_row]