{"title":"Joint Fronthaul and Multicast Beamforming for Ultra-Dense C-RANs","authors":"Fangqing Tan, Peiran Wu, M. Jiang, Minghua Xia","doi":"10.1109/iccc52777.2021.9580223","DOIUrl":"https://doi.org/10.1109/iccc52777.2021.9580223","url":null,"abstract":"This work investigates multicast transmission in ultra-dense cloud radio access networks (C-RANs) with wireless fronthaul. To maximize the weighted sum rate (WSR) of multicast services, joint beamforming for fronthaul and access links are designed, subject to the constraints of fronthaul capacity and transmit powers of small base stations and central processor. The formulated optimization problem is however neither smooth nor convex. For ease of mathematical tractability, the smooth and successive convex approximations are exploited to transform the original problem into a sequence of convex problems, and then a first-order algorithm with low computational complexity is developed to find the optimal solution. Numerical results demonstrate that the proposed first-order algorithm can achieve almost the same WSR as that of traditional second-order approaches yet with much lower computational complexity.","PeriodicalId":425118,"journal":{"name":"2021 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128704301","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}
Ruoxuan Wu, Yuanyuan Wang, Chi Zhang, Chengjie Gu, M. Pan
{"title":"Satellite-Guided Non-uniformed Beamforming for Direct Air-to-Ground Communications","authors":"Ruoxuan Wu, Yuanyuan Wang, Chi Zhang, Chengjie Gu, M. Pan","doi":"10.1109/iccc52777.2021.9580234","DOIUrl":"https://doi.org/10.1109/iccc52777.2021.9580234","url":null,"abstract":"The global airline is experiencing exceptional growth, and passengers onboard request Internet access to utilize their valuable in-flight time. Direct air-to-ground communication (DA2GC) attracts considerable attention for its low latency, high capacity, and low cost. In order to compensate for the high path loss and efficiently use the spectrum resources, beamforming technique has been introduced to DA2GC systems. However, directional communication causes inherent blindness problem, and the high mobility in the DA2GC scenario leads to frequent beam-realignment. Therefore, feedback overheads and risks of outages increase significantly with traditional beamforming schemes in the DA2GC scenario. Different from traditional receiving ends, airplanes have already been equipped with satellite antennas to keep a global connection, and have enough space and power to carry massive antenna arrays and computing processors to perform adaptive receiver (RX) beam adjustment. Based on this observation, we propose a satellite-guided DA2GC network architecture where the mobility management of airplanes is separated to relatively stable satellite links, and data streaming is carried by DA2GC links. Under the guidance of satellites, a wide transmitter (TX) beamforming scheme and corresponding adaptive RX beamforming scheme are proposed. In the wide TX beamforming, the widest TX beam satisfying basic receiving sensibility is used to extend each TX beam's service time. Within the TX beam, the RX beam autonomously adjusts its direction and beamwidth to keep the final received SNR at a high and stable level. Finally, simulations are performed to validate the proposed scheme.","PeriodicalId":425118,"journal":{"name":"2021 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128269508","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":"On-Grid 3D Dynamic Channel Tracking for Space-Air Communications with Multiple UAVs","authors":"Jiadong Yu, Xiaolan Liu, Yue Gao","doi":"10.1109/iccc52777.2021.9580297","DOIUrl":"https://doi.org/10.1109/iccc52777.2021.9580297","url":null,"abstract":"The space-air-ground integrated network (SAGIN) has drawn increasing attention for its potential to support ubiquitous wireless communications. As one of the link segments, it is non-trivial to track the 3D dynamic channel information in space-air links with multiple unmanned aerial vehicles (UAVs) and Ka-band orbiting low earth orbit (LEO) satellite. In this paper, we proposed a multi-dimensional Markov model (MD-MM) which investigates spatial and temporal probabilistic relationships of multi-user (MU) hidden support vector, single-user (SU) joint hidden support vector, and SU hidden value vector to represent the 3D dynamic channel. Moreover, we developed a novel multidimensional dynamic turbo approximate message passing (MD-DTAMP) algorithm to track the 3D dynamic on-grid channel with multiple UAVs in the system. Numerical results prove that the proposed algorithm shows superior channel tracking performance with smaller pilot overheads.","PeriodicalId":425118,"journal":{"name":"2021 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123186644","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}
Jianhao Wang, Wensheng Zhang, Jian Sun, Chengxiang Wang
{"title":"Tensor-Based Channel Estimation for 3D mmWave Massive MIMO Systems","authors":"Jianhao Wang, Wensheng Zhang, Jian Sun, Chengxiang Wang","doi":"10.1109/iccc52777.2021.9580338","DOIUrl":"https://doi.org/10.1109/iccc52777.2021.9580338","url":null,"abstract":"In this paper, we investigate the channel estimation problem for three-dimensional (3D) massive multiple-input multiple-output (MIMO) system, where the base station (BS) employs a uniform cuboid array (UCA) and the mobile station (MS) is equipped with a uniform linear array (ULA). The channel between MS and BS can be formulated as a fourth-order tensor. By exploring the geometric parameter channel model, we simplify the problem to a third-order tensor decomposition problem. We further exploit the vandermonde structure of the factor matrices and introduce the Multi-mode Vandermonde Constrains Canonical Polyadic Decomposition (MVC-CPD) based channel estimation algorithm. The sufficient condition of uniqueness is analyzed. Under the uniqueness condition, the angle information can be recovered from the columns of the factor matrices. Since all the factor matrices share the same permutation ambiguity, the operation of angle pairing is not required. Then the complex gains can be obtained by Least Square (LS) method. Simulation results show that the proposed method outperforms the compressed sensing (CS) based method and the iteration based method in terms of accuracy, robustness, and stability.","PeriodicalId":425118,"journal":{"name":"2021 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127105088","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}
Zihan Lin, Pengmin Li, Yilin Xiao, Liang Xiao, Fucai Luo
{"title":"Learning Based Efficient Federated Learning for Object Detection in MEC Against Jamming","authors":"Zihan Lin, Pengmin Li, Yilin Xiao, Liang Xiao, Fucai Luo","doi":"10.1109/iccc52777.2021.9580318","DOIUrl":"https://doi.org/10.1109/iccc52777.2021.9580318","url":null,"abstract":"Federated learning enables mobile edge computing (MEC) to train the object detection model with privacy protection and reduced communication overhead. However, the selection of the mobile devices and the training dataset that determines the energy consumption of the mobile devices and the detection accuracy and latency has to be optimized without relying on the known channel and jamming model against jamming attacks that aim to degrade the model training performance. In this paper, we propose a reinforcement learning (RL) based efficient federated learning training scheme against jamming. This scheme designs a fast RL algorithm with shared parameters to choose the training policy of the object detection model at the mobile devices based on the channel gain, the previous training, transmission and computation performance. The edge server uses a shared Q-table to determine the policy for each mobile device to accelerate the learning process. Simulation results show that this scheme can effectively improve the object detection accuracy, decrease the energy consumption and reduce the latency compared with the benchmark scheme.","PeriodicalId":425118,"journal":{"name":"2021 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"184 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122085072","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}
Fugang Wang, Shushi Gu, Qinyu Zhang, Ning Zhang, W. Xiang
{"title":"Cost Optimal Regenerating Codes Design for Satellite Clustered Distributed Storage System","authors":"Fugang Wang, Shushi Gu, Qinyu Zhang, Ning Zhang, W. Xiang","doi":"10.1109/iccc52777.2021.9580435","DOIUrl":"https://doi.org/10.1109/iccc52777.2021.9580435","url":null,"abstract":"Satellite clustered distributed storage system (SCDSS) is a space-ground integrated network architecture which can provide global wide-coverage and inter-connections among data centers around world. Some soft errors caused by single event upsets (SEUs) in outer space make many failures of on-orbit storage devices, which causes stored data lost. In consequence, effective storage codes, e.g., regenerating codes(RCs) and generalized regenerating codes(GRCs), are crucial to ensure the availability of data with the objective of minimizing transmission cost when repairing the failure nodes. However, heterogeneity is an inevitable problem that result in high cost, due to the diversity of communication links with different transmit powers, link bandwidths and communication distances. Existing coding strategies can not provide an effective solution to deal with the heterogeneity of bandwidth costs among different satellite clusters. In this paper, we propose an asymmetric repair strategy of RCs and GRCs, and derive the upper bound of achievable capacity for data storage in heterogeneous clusters. Then, based on the satellite link analysis, we define cost coefficient, and give the expression of data repair cost, which can be optimized by solving a linear programming problem. Finally, numerical results demonstrate that, compared with the repair cost of typical coding strategies of RCs and GRCs, our asymmetric repair strategy performs better performance in reducing the repair cost, as an effective solution for data availability maintenance in SCDSS.","PeriodicalId":425118,"journal":{"name":"2021 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122628846","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 Aided Task Partitioning and Computation Offloading in Mobile Edge Computing","authors":"Laha Ale, Scott A. King, Ning Zhang, A. Sattar","doi":"10.1109/iccc52777.2021.9580392","DOIUrl":"https://doi.org/10.1109/iccc52777.2021.9580392","url":null,"abstract":"With the wave of the Internet of Things (IoT), a vast number of IoT devices are connected to wireless networks. To better support the Quality of Service of IoT devices with constrained resources, mobile edge computing (MEC) provisions computing resources at the network edge to process their tasks in proximity. In this work, we investigate task partitioning and computation offloading in collaborative MEC. Specifically, we propose a novel Deep Reinforcement Learning called Deep Deterministic with Dirichlet Policy Gradient (D3PG), which builds on Deep Deterministic Policy Gradient to partition tasks and perform task offloading efficiently. The developed model can learn to optimize multiple objectives, including maximizing the number of tasks processed before their deadlines and minimizing the energy cost. Simulation results are provided and demonstrate that the proposed D3PG scheme outperforms existing approaches.","PeriodicalId":425118,"journal":{"name":"2021 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125829052","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":"Enabling Plug-and-Play SLAM in Wireless Communication Systems","authors":"Jie Yang, Chao-Kai Wen, Shi Jin, Xiao Li","doi":"10.1109/iccc52777.2021.9580246","DOIUrl":"https://doi.org/10.1109/iccc52777.2021.9580246","url":null,"abstract":"Simultaneous localization and mapping (SLAM) during communication is emerging, which promises to provide information on propagation environments and the position of transmitters and receivers and create new services and applications for environment-aware communication. However, when fusing multi-domain measurements collected from RF signals and sensors, the unknown measurement biases may generate serious errors. In this study, we consider the practical measurement bias and develop a robust plug-and-play SLAM method. Specifically, we classify measurements into three categories according to their unknown biases. Next, we establish a Bayesian mechanism to fuse different categories of biased measurements, called the measurement plug-and-play mechanism. Finally, the corresponding unknown biases, such as clock and orientation biases, and RSS model parameters can be estimated during SLAM. Numerical results show that the proposed method can flexibly fuse different categories of measurements. Moreover, compared with the state-of-the-art method, under large bias levels, the proposed method can achieve 68% and 76% performance gain in localization and mapping, respectively.","PeriodicalId":425118,"journal":{"name":"2021 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134052223","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":"Service Caching Based Task Offloading and Resource Allocation in Multi-UAV Assisted MEC Networks","authors":"Guangyuan Zheng, Chen Xu, Hao Long, Yun Sheng","doi":"10.1109/iccc52777.2021.9580248","DOIUrl":"https://doi.org/10.1109/iccc52777.2021.9580248","url":null,"abstract":"Service caching refers to caching the necessary programs or the related databases for executing computational tasks at edge servers, which has been considered to save both computation and communication resources in mobile edge computing (MEC) systems. In this paper, we investigate computation service caching in a multi-unmanned aerial vehicle (UAV) assisted MEC system, where each UAV equipped with an edge server can cache some programs in advance to execute the tasks offloaded from the ground devices. Aiming at minimizing the total latency of all devices, we formulate a joint service caching, task offloading, resource allocation and UAV placement optimization problem, while guaranteeing the task delay requirement and the energy budget of all devices and UAVs. The problem is a mixed integer non-linear programming problem, and we decouple it into two sub-problems, i.e., a joint service caching, offloading decision and resource allocation problem and a UAV placement problem, and then propose an iterative algorithm to obtain the joint solution. Simulation results reveal that our proposed algorithm can achieve higher performance compared with other baselines in terms of reducing system latency.","PeriodicalId":425118,"journal":{"name":"2021 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"248 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133361915","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 Novel Group-oriented Handover Authentication Scheme in MEC-Enabled 5G Networks","authors":"Chengzhe Lai, Yixiao Ma","doi":"10.1109/iccc52777.2021.9580296","DOIUrl":"https://doi.org/10.1109/iccc52777.2021.9580296","url":null,"abstract":"With the rapid development of 5G, ultra-dense base station deployment will result in frequent handovers during user movement, increasing authentication delay. Moreover, a large number of users competing for a limited number of wireless channels will increase the probability of signaling collisions and cause network congestion. In this paper, based on the 5G network integrated by mobile edge computing (MEC) and software defined network (SDN), we propose an anonymous handover authentication scheme which supports multi-user access. Particularly, it provides lightweight user grouping and internal group authentication. In addition, by utilizing the aggregation message authentication code with detection function (AMAD) technique, multiple users can be authenticated simultaneously to reduce the number of signaling, and the identity list corresponding to the malicious MAC can be accurately identified and output, which can effectively resist to DoS attack. The security analysis proves that the scheme can provide robust security protection, and it is suitable for intra-domain handover and inter-domain handover. Compared with the existing group-based handover authentication schemes, the proposed scheme has moderate computational and communication overhead while its functions are superior to other schemes.","PeriodicalId":425118,"journal":{"name":"2021 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"85 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113958568","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}