Pub Date : 2021-07-28DOI: 10.1109/iccc52777.2021.9580223
Fangqing Tan, Peiran Wu, M. Jiang, Minghua Xia
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.
{"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}
Pub Date : 2021-07-28DOI: 10.1109/iccc52777.2021.9580338
Jianhao Wang, Wensheng Zhang, Jian Sun, Chengxiang Wang
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.
{"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}
Pub Date : 2021-07-28DOI: 10.1109/iccc52777.2021.9580392
Laha Ale, Scott A. King, Ning Zhang, A. Sattar
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.
{"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}
As an emerging framework of distributed learning, federated learning (FL) has been a research focus since it enables clients to train deep learning models collaboratively without exposing their original data. Nevertheless, private information can still be inferred from the communicated model parameters by adversaries. In addition, due to the limited channel bandwidth, the model communication between clients and the server has become a serious bottleneck. In this paper, we consider an FL framework that utilizes local differential privacy, where the client adds artificial Gaussian noise to the local model update before aggregation. To reduce the communication overhead of the differential privacy-protected model, we propose the universal vector quantization for FL with local differential privacy mechanism, which quantizes the model parameters in a universal vector quantization approach. Furthermore, we analyze the privacy performance of the proposed approach and track the privacy loss by accounting the log moments. Experiments show that even if the quantization bit is relatively small, our method can achieve model compression without reducing the accuracy of the global model.
{"title":"Communication Reducing Quantization for Federated Learning with Local Differential Privacy Mechanism","authors":"Huixuan Zong, Qing Wang, Xiaofeng Liu, Yinchuan Li, Yunfeng Shao","doi":"10.1109/iccc52777.2021.9580315","DOIUrl":"https://doi.org/10.1109/iccc52777.2021.9580315","url":null,"abstract":"As an emerging framework of distributed learning, federated learning (FL) has been a research focus since it enables clients to train deep learning models collaboratively without exposing their original data. Nevertheless, private information can still be inferred from the communicated model parameters by adversaries. In addition, due to the limited channel bandwidth, the model communication between clients and the server has become a serious bottleneck. In this paper, we consider an FL framework that utilizes local differential privacy, where the client adds artificial Gaussian noise to the local model update before aggregation. To reduce the communication overhead of the differential privacy-protected model, we propose the universal vector quantization for FL with local differential privacy mechanism, which quantizes the model parameters in a universal vector quantization approach. Furthermore, we analyze the privacy performance of the proposed approach and track the privacy loss by accounting the log moments. Experiments show that even if the quantization bit is relatively small, our method can achieve model compression without reducing the accuracy of the global model.","PeriodicalId":425118,"journal":{"name":"2021 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"13 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":"132544391","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}
Pub Date : 2021-07-28DOI: 10.1109/iccc52777.2021.9580234
Ruoxuan Wu, Yuanyuan Wang, Chi Zhang, Chengjie Gu, M. Pan
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.
{"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}
Pub Date : 2021-07-28DOI: 10.1109/iccc52777.2021.9580246
Jie Yang, Chao-Kai Wen, Shi Jin, Xiao Li
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.
{"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}
Pub Date : 2021-07-28DOI: 10.1109/iccc52777.2021.9580265
Ni Yang, Yinghong Ma, Long Suo, Yijun Lu, Suping Ren, Liwan Lin
Virtualization is the key technology of cloud computing, by which the physical resources in data center can be abstracted as a virtual resource pool for flexible resource allocation. To make full use of the data center resources, efficient virtual network embedding (VNE) is both an efficient and challenging solution. Traditional VNE algorithms focused on the generic topology in the Internet, while the data center network topology is regular and symmetric. In this paper, the most widely used fat-tree topology is considered, and a proximal adaptive VNE algorithm based on multi-dimensional load balancing is proposed. In this VNE algorithm, the bandwidth resource cost is reduced by proximal mapping, and the joint balancing of computation and communication loads is taken into account to achieve multi-dimension resource allocation balance. Simulation results show that the proposed algorithm can increase the resource utilization, and keep both the load balance of each single-dimension resource and the joint balance of different dimensions of resources.
{"title":"Proximal Virtual Network Embedding based on Multi-dimensional Load Balancing in Data Centers","authors":"Ni Yang, Yinghong Ma, Long Suo, Yijun Lu, Suping Ren, Liwan Lin","doi":"10.1109/iccc52777.2021.9580265","DOIUrl":"https://doi.org/10.1109/iccc52777.2021.9580265","url":null,"abstract":"Virtualization is the key technology of cloud computing, by which the physical resources in data center can be abstracted as a virtual resource pool for flexible resource allocation. To make full use of the data center resources, efficient virtual network embedding (VNE) is both an efficient and challenging solution. Traditional VNE algorithms focused on the generic topology in the Internet, while the data center network topology is regular and symmetric. In this paper, the most widely used fat-tree topology is considered, and a proximal adaptive VNE algorithm based on multi-dimensional load balancing is proposed. In this VNE algorithm, the bandwidth resource cost is reduced by proximal mapping, and the joint balancing of computation and communication loads is taken into account to achieve multi-dimension resource allocation balance. Simulation results show that the proposed algorithm can increase the resource utilization, and keep both the load balance of each single-dimension resource and the joint balance of different dimensions of resources.","PeriodicalId":425118,"journal":{"name":"2021 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"131 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":"133020278","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}
Pub Date : 2021-07-28DOI: 10.1109/iccc52777.2021.9580248
Guangyuan Zheng, Chen Xu, Hao Long, Yun Sheng
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.
{"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}
Pub Date : 2021-07-28DOI: 10.1109/iccc52777.2021.9580249
Yibo Li, Junhui Zhao, Hongxue Diao, Lihua Yang
Location based service (LBS) plays an important role in smart city system. However, there is serious non-line of sight (NLOS) phenomenon in high-density urban areas, which affects the localization accuracy significantly. Based on signal detection theory, we propose a two-step localization method to identify NLOS signals and estimate position after mitigating the influence of NLOS. Firstly, depending on the prior probabilities, the NLOS signals are identified by generalized likelihood ratio (GLR) test or Neyman-Pearson (NP) criterion. Moreover, the NLOS signals are mitigated based on identified measurement condition. Finally, selecting residual weighting algorithm (S-RWGH) is used to estimate the target position. Simulation results show that the proposed algorithm can effectively improve the localization accuracy. Average location error is below 15 m when the NLOS rate is below 62.5 % in the urban environment.
{"title":"Signal Detection Theory-Based Localization Method in Urban NLOS Environment","authors":"Yibo Li, Junhui Zhao, Hongxue Diao, Lihua Yang","doi":"10.1109/iccc52777.2021.9580249","DOIUrl":"https://doi.org/10.1109/iccc52777.2021.9580249","url":null,"abstract":"Location based service (LBS) plays an important role in smart city system. However, there is serious non-line of sight (NLOS) phenomenon in high-density urban areas, which affects the localization accuracy significantly. Based on signal detection theory, we propose a two-step localization method to identify NLOS signals and estimate position after mitigating the influence of NLOS. Firstly, depending on the prior probabilities, the NLOS signals are identified by generalized likelihood ratio (GLR) test or Neyman-Pearson (NP) criterion. Moreover, the NLOS signals are mitigated based on identified measurement condition. Finally, selecting residual weighting algorithm (S-RWGH) is used to estimate the target position. Simulation results show that the proposed algorithm can effectively improve the localization accuracy. Average location error is below 15 m when the NLOS rate is below 62.5 % in the urban environment.","PeriodicalId":425118,"journal":{"name":"2021 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"17 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":"133825438","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}
Pub Date : 2021-07-28DOI: 10.1109/iccc52777.2021.9580296
Chengzhe Lai, Yixiao Ma
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.
随着5G的快速发展，超密集的基站部署将导致用户移动过程中频繁切换，增加认证延迟。此外，大量用户竞争有限的无线信道会增加信令冲突的概率，造成网络拥塞。本文基于移动边缘计算(MEC)和软件定义网络(SDN)融合的5G网络，提出了一种支持多用户接入的匿名切换认证方案。特别是，它提供了轻量级的用户分组和内部组身份验证。此外，利用AMAD (aggregation message authentication code with detection function)技术，可以同时对多个用户进行认证，减少信令数量，准确识别并输出恶意MAC对应的身份列表，可以有效抵御DoS攻击。安全性分析表明，该方案能够提供鲁棒性的安全保护，适用于域内切换和域间切换。与现有的基于组的切换认证方案相比，该方案计算量和通信开销适中，功能优于其他方案。
{"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：