{"title":"Beam Selection for Beam Refinement Procedure in Multi-cell Millimeter-Wave Massive MIMO Systems","authors":"Leiqin Yan, Hongwen Yang, Yushu Zhang","doi":"10.1109/ICCChinaW.2018.8674503","DOIUrl":"https://doi.org/10.1109/ICCChinaW.2018.8674503","url":null,"abstract":"The millimeter wave (mmWave) communications have gained increasing attention to satisfy the high data-rate requirements in the fifth generation (5G) cellular systems. To overcome the severe path loss, multiple narrow beamforming vectors are configured at both the next generation NodeB (gNB) and the user equipment (UE), thus it is critical to select the best beam pair for maximum beamforming gain. This paper focuses on the beam selection problem for beam refinement procedure, where selection occurs between each UE with its serving gNB. A hybrid approach is proposed where the beam pair is selected either with the max-signal-to-noise (Max-SNR) criteria or with the max-signal-to-interference-plus-noise ratio (Max-SINR) criteria, depends on the highest reference signal received power (RSRP) measured by UE. Simulation results indicate that the proposed hybrid approach can achieve a good tradeoff between the beam selection delay and the SINR performance","PeriodicalId":201746,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115140105","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Matching Game Approach for Joint Resource Allocation and User Association in Fog Radio Access Networks","authors":"Xueyan Cao, Chunjing Hu, Shi Yan","doi":"10.1109/ICCChinaW.2018.8674520","DOIUrl":"https://doi.org/10.1109/ICCChinaW.2018.8674520","url":null,"abstract":"Fog computing based radio access network (F-RAN) has been regarded as a paradigm with great promise to provide high spectral and energy efficiency with edge devices, and has recently attracted lots of attention. In this paper, we focus on joint user association and resource allocation to optimize the user average file download delay in a device-to-device (D2D) enabled F-RAN. The optimization problem is formulated as a mixed-integer nonlinear programming problem, which can be proved as a NP-hard problem. To solve the problem efficiently, a matching game based algorithm is proposed, where D2D users and fog access points (F-APs) can adjust wireless resource allocation autonomously according to the condition of swap matching. Simulation results verify the accuracy of our analysis and show that the proposed algorithm can achieve a near optimal performance with a fast convergence speed. Meanwhile, the impacts of the cache size of F-APs, the number of users, and the fairness are demonstrated as well.","PeriodicalId":201746,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129004301","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Edge Computing Sever Selection in Fog Radio Access Networks","authors":"Xile Shen, Xiaoshi Song, Xiangbo Meng, Chao Jia","doi":"10.1109/ICCChinaW.2018.8674471","DOIUrl":"https://doi.org/10.1109/ICCChinaW.2018.8674471","url":null,"abstract":"In this paper, we consider a fog radio access (F-RAN) network formed by two different kinds of node, namely the user and calculator (i.e., the edge computing sever), respectively. It is assumed that the users and calculators follows two independent homogeneous Poisson point processes (HPPPs). Further, it is assumed that the arrival of the computing tasks at each user and the departure of the computing tasks at each calculator follow two Poisson processes with rate ηu and ηc, respectively. That is, the time between successive arrivals at each user or departures at each calculator are independent exponential random variables with mean given by $frac{1}{{{eta _u}}}$ or $frac{1}{{{eta _c}}}$. Time is divided into slots. At the beginning each time slot, each user is designed to offload the computing tasks generated in the last time slot to their nearby calculators within a distance of Rd for data processing. Different from the random-chosen based calculator selection schemes studied in the previous works, in this paper, we consider a prediction based calculator selection strategy to enhance the delay performance of the F-RAN. Particularly, under the proposed prediction based calculator selection strategy, we estimate the network status in the next time slot, and use which as the criterion for computing server selection and tasks offloading. It is shown through both the analysis and simulations that the proposed prediction based calculator selection strategy outperforms the random-chosen based calculator selection protocol in terms of the successful offloading probability.","PeriodicalId":201746,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126012647","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Judgement-based Joint SLM and PTS Algorithm for PAPR Suppression of Radar Communication Integrated System","authors":"Hong Zhao, Wei-xia Zou","doi":"10.1109/ICCChinaW.2018.8674505","DOIUrl":"https://doi.org/10.1109/ICCChinaW.2018.8674505","url":null,"abstract":"In radar communication integrated (RCI) systems, multi-carrier shared signals based on OFDM-LFM have been widely used. However, in the OFDM-LFM-RCI multi-carrier system, there is a severe problem that the peak-to-average power ratio (PAPR) is too high. Although applying the conventional selective mapping (SLM) algorithm or partial transmit sequence (PTS) algorithm to the OFDM-LFM-RCI system can reduce the probability of high PAPR, the computational complexity of both algorithms is too high. In order to reduce the computational complexity and improve the PAPR suppression effect, a judgment-based joint SLM and PTS algorithm (J-SLM-PTS) is proposed in this paper. In the proposed J-SLM-PTS algorithm, there are two levels of PAPR suppression processing, the first is SLM algorithm and the other is PTS algorithm. Besides a judgment mechanism is introduced between the two levels. For the judgment mechanism, if the PAPR of the first level output sequence is less than the threshold PAPRth, then the sequence is directly used as the transmit sequence, otherwise it will be transferred to the second level for PTS algorithm processing. The simulation results show that the J-SLM-PTS algorithm can not only greatly reduce the computational complexity, but also have better PAPR suppression effect without reducing the communication and radar performance of OFDM-LFM-RCI systems.","PeriodicalId":201746,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134411611","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Deep Reinforcement Learning Based Coded Caching Scheme in Fog Radio Access Networks","authors":"Yangcheng Zhou, M. Peng, Shi Yan, Yaohua Sun","doi":"10.1109/ICCChinaW.2018.8674478","DOIUrl":"https://doi.org/10.1109/ICCChinaW.2018.8674478","url":null,"abstract":"Fog radio access networks (F-RANs) have been presented as promising architectures for the future wireless system to provide high spectral and energy efficiency. With the help of the new designed fog access points (F-APs), F-RANs can take the full advantage of local caching capabilities, which relieves the load of fronthaul and reduces transmission delay. However, the cache resource optimization is a challenging task due to the uncertainty and dynamics of user file requests. Considering the high utilization of cache space and file diversity by coded caching, a deep reinforcement learning (DRL) based algorithm is developed for coded caching enabled F-RANs. The core idea of the proposal is that the network controller intelligently allocates the limited cache spaces of F-APs to different coded files based on the historical requests of the user. While the successful transmission probability of user requests is maximized during the learning process. Through numerical simulations, the convergence of the DRL based caching scheme is demonstrated, and the superiority of the proposal is verified by comparing with other baselines.","PeriodicalId":201746,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"418 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132637784","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Weiwei Dong, Tiankui Zhang, Zhirui Hu, Yuanwei Liu, Xiao Han
{"title":"Energy-Efficient Hybrid Precoding for mmWave Massive MIMO Systems","authors":"Weiwei Dong, Tiankui Zhang, Zhirui Hu, Yuanwei Liu, Xiao Han","doi":"10.1109/ICCChinaW.2018.8674523","DOIUrl":"https://doi.org/10.1109/ICCChinaW.2018.8674523","url":null,"abstract":"In millimeter Wave (mmWave) massive multi-input multi-output (MIMO) systems, the novel sub-connected architecture has been introduced which can further reduce power consumption compared with the fully-connected architecture. In this paper, we propose an energy-efficient hybrid precoding design with quality of service (QoS) constraints for sub-connected architecture. Firstly, the total energy efficiency optimization problem with nonconvex constraints is decomposed into two separate optimization sub-problems whose solution is a optimal single precoder respectively. Then, the first optimization sub-problem analog domain concerned is solved by a cross-entropy-based algorithm according to the machine learning theory. Finally, the second optimization sub-problem digital domain concerned is solved by an iterative optimization algorithm from fractional programming theory. Simulation results demonstrate that the performance of the proposed precoding algorithm. The performance of the proposed algorithm is capable of achieving near optimal solution. It is also demonstrated that the proposed algorithm can enhance the energy efficiency of networks while guaranteeing the QoS of users.","PeriodicalId":201746,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131357386","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Distance-Sensitive Distributed Repulsive Sleeping Strategy for Densely-Deployed Small Cells in Green Cities","authors":"Yanhua He, Liangrui Tang, Zhenyu Zhou","doi":"10.1109/ICCChinaW.2018.8674480","DOIUrl":"https://doi.org/10.1109/ICCChinaW.2018.8674480","url":null,"abstract":"With the ultra-dense deployment of small cells, Base Station (BS) sleeping technology will play a critical role in future 5G green communications. However, conventional centralized BS sleeping strategies generate a large amount of communication overhead, which grows enormously with the number of BSs. Moreover, the coverage holes incurred by BS sleeping will also degrade the Quality of Service (QoS) performance of User Equipment (UE). To tackle this problem, we propose a Distance-Sensitive Distributed Repulsive Sleeping Strategy (DSDRSS) inspired by Hard Core Point Process (HCPP). DSDRSS realizes sleeping operations through the cooperation between SBSs in a Sleeping Cluster (SC), and does not rely on the feedback links between Small Base Stations (SBSs) and the control center. As a result, DSDRSS can not only enable flexible perception of traffic changes in sleeping area but also produce less communication overhead. Furthermore, we derive the coverage probability of UEs under the proposed scheme in terms of bandwidth resource and transmission rate constraints. Simulation results show that the proposed scheme can achieve equivalent coverage compared with the classic Random Sleep Strategy (RSS) and the General Repulsive Sleep Strategy (GRSS) with a much lower overhead cost.","PeriodicalId":201746,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114557698","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yi Gu, Mingfeng Xu, Zhendong Mao, Y. Ai, Shuqing Bu
{"title":"Performance Analysis of Outage and Average Sum Rate of Sparse Code Division Multiple Access in Fog Radio Access Networks","authors":"Yi Gu, Mingfeng Xu, Zhendong Mao, Y. Ai, Shuqing Bu","doi":"10.1109/ICCChinaW.2018.8674502","DOIUrl":"https://doi.org/10.1109/ICCChinaW.2018.8674502","url":null,"abstract":"Fog radio access networks (F-RAN) is used to meet high requirements of the fifth-generation (5G) mobile communication. With scale of terminals expanded, frequency spectrum becomes a bottleneck of developing F-RANs, and traditional orthogonal multiple access (OMA) is not highly effective on resource utilization. To improve spectrum efficiency, sparse code division multiple access (SCMA) is presented as a promising technique. In this paper, the performance of a SCMA-based scheme in F-RANs is evaluated. In particular, a lower bound of the average outage probability of a typical user is provided based on stochastic geometry, which can give some insights on how to improve the transmission reliability of SCMA. Meanwhile, a lower bound of capacity on a subcarrier is derived. Simulation results are provided to validate the accuracy of analysis and show the performance gain of SCMA compared with OMA.","PeriodicalId":201746,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123566671","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Blind Source Separation Approach Based on Normalized Convex Perimeter","authors":"Liu Yang, Hang Zhang, Yang Cai, Liming Hu","doi":"10.1109/ICCChinaW.2018.8674470","DOIUrl":"https://doi.org/10.1109/ICCChinaW.2018.8674470","url":null,"abstract":"This paper addresses the problem of blind source separation for both independent and dependent sources. Signals in wireless communication system usually own a bounded nature, in view of this observation, a method based on bounded component analysis (BCA) for communication signals separation is proposed. The normalized convex perimeter is adopted as the contrast function and the algorithm is further optimized by a gradient decent algorithm. Experimental results show that the proposed algorithm outperforms the existent BCA algorithms and obtains superior performance over the state of art independent component analysis (ICA)-based algorithms for a small number of samples in high SNR scenarios.","PeriodicalId":201746,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133142154","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}