Energy and latency are important metrics for performance evaluation in ultra-reliable and low-latency communication-enabled wireless virtual reality networks. However, these two metrics often conflict with each other. Therefore, in order to strike a balance between energy efficiency and latency, a novel model is proposed for the energy and latency optimization of reconfigurable intelligent surface-assisted networks. To investigate the tradeoff between energy and latency, the meta-learning-based multi-objective soft actor-critic (MO-SAC) algorithm is proposed. The algorithm assigns dynamic weights to the objectives during training and the trained model is able to achieve a fast adaptation to the new tasks. The numerical results verify the efficiency of meta-learning-based MO-SAC, where the trained model is able to quickly adapt to new tasks.
{"title":"Multi-objective Optimization of Energy and Latency in URLLC-enabled Wireless VR Networks","authors":"Xinyu Gao, Yixuan Zou, Wenqiang Yi, Jiaqi Xu, Ruiqi Liu, Yuanwei Liu","doi":"10.1109/ISWCS56560.2022.9940418","DOIUrl":"https://doi.org/10.1109/ISWCS56560.2022.9940418","url":null,"abstract":"Energy and latency are important metrics for performance evaluation in ultra-reliable and low-latency communication-enabled wireless virtual reality networks. However, these two metrics often conflict with each other. Therefore, in order to strike a balance between energy efficiency and latency, a novel model is proposed for the energy and latency optimization of reconfigurable intelligent surface-assisted networks. To investigate the tradeoff between energy and latency, the meta-learning-based multi-objective soft actor-critic (MO-SAC) algorithm is proposed. The algorithm assigns dynamic weights to the objectives during training and the trained model is able to achieve a fast adaptation to the new tasks. The numerical results verify the efficiency of meta-learning-based MO-SAC, where the trained model is able to quickly adapt to new tasks.","PeriodicalId":141258,"journal":{"name":"2022 International Symposium on Wireless Communication Systems (ISWCS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115513129","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 : 2022-10-19DOI: 10.1109/ISWCS56560.2022.9940257
Qiankun Wang, M. Lei, Ming-Min Zhao, Min-Jian Zhao
Orthogonal time frequency space (OTFS) is a new emerging modulation scheme that performs better than orthogonal frequency division multiplexing (OFDM) in high mobility scenarios. In this paper, we consider the delay-Doppler (DD) channel estimation problem in an OTFS system. By exploiting the inherent sparse nature of the DD channel, the channel estimation problem is modeled as a sparse signal recovery problem. Next, we build a two-layer graphical model with the Laplacian scale mixture (LSM) prior utilized to model the sparse channel. Then, a variational Bayesian inference (VBI) based algorithm is proposed to solve this problem. Simulation results are presented to show that the proposed algorithm can achieve better performance than other existing channel estimation algorithms.
{"title":"Variational Bayesian Inference Based Channel Estimation for OTFS System with LSM Prior","authors":"Qiankun Wang, M. Lei, Ming-Min Zhao, Min-Jian Zhao","doi":"10.1109/ISWCS56560.2022.9940257","DOIUrl":"https://doi.org/10.1109/ISWCS56560.2022.9940257","url":null,"abstract":"Orthogonal time frequency space (OTFS) is a new emerging modulation scheme that performs better than orthogonal frequency division multiplexing (OFDM) in high mobility scenarios. In this paper, we consider the delay-Doppler (DD) channel estimation problem in an OTFS system. By exploiting the inherent sparse nature of the DD channel, the channel estimation problem is modeled as a sparse signal recovery problem. Next, we build a two-layer graphical model with the Laplacian scale mixture (LSM) prior utilized to model the sparse channel. Then, a variational Bayesian inference (VBI) based algorithm is proposed to solve this problem. Simulation results are presented to show that the proposed algorithm can achieve better performance than other existing channel estimation algorithms.","PeriodicalId":141258,"journal":{"name":"2022 International Symposium on Wireless Communication Systems (ISWCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115617415","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 : 2022-10-19DOI: 10.1109/ISWCS56560.2022.9940349
Mengchun Yan, Yingyang Chen, Miaowen Wen, Shancheng Zhao, Zhetao Li
Non-orthogonal multiple access (NOMA) plays a significant role in improving bandwidth efficiency through sharing the spectrum among multiple users. However, the weaker users in the NOMA system will suffer from interference caused by stronger users when decoding their own symbols. In this paper, we design constructive interference precoding for downlink NOMA to make the interference experienced by weaker users beneficial and further improve their communication quality. Specifically, the transmit power optimization problem under symbol level precoding (SLP) constraints at weaker users is formulated to reduce the power consumption while guaranteeing the quality of service of all users and successful successive interference cancellation (SIC). Afterward, by utilizing some approximate methods, an iterative algorithm is proposed to handle the non-convex problem. Simulation results show that the proposed scheme significantly saves the power consumption compared to the conventional NOMA. Furthermore, compared to the classical SLP scheme, the proposed scheme maintains its feasibility in an overloaded deployment, and shows its superiority for receivers with a low signal-to-interference-plus-noise ratio (SINR) target and a relatively large disparity in channel strengths.
{"title":"Constructive Interference Precoding for Downlink NOMA","authors":"Mengchun Yan, Yingyang Chen, Miaowen Wen, Shancheng Zhao, Zhetao Li","doi":"10.1109/ISWCS56560.2022.9940349","DOIUrl":"https://doi.org/10.1109/ISWCS56560.2022.9940349","url":null,"abstract":"Non-orthogonal multiple access (NOMA) plays a significant role in improving bandwidth efficiency through sharing the spectrum among multiple users. However, the weaker users in the NOMA system will suffer from interference caused by stronger users when decoding their own symbols. In this paper, we design constructive interference precoding for downlink NOMA to make the interference experienced by weaker users beneficial and further improve their communication quality. Specifically, the transmit power optimization problem under symbol level precoding (SLP) constraints at weaker users is formulated to reduce the power consumption while guaranteeing the quality of service of all users and successful successive interference cancellation (SIC). Afterward, by utilizing some approximate methods, an iterative algorithm is proposed to handle the non-convex problem. Simulation results show that the proposed scheme significantly saves the power consumption compared to the conventional NOMA. Furthermore, compared to the classical SLP scheme, the proposed scheme maintains its feasibility in an overloaded deployment, and shows its superiority for receivers with a low signal-to-interference-plus-noise ratio (SINR) target and a relatively large disparity in channel strengths.","PeriodicalId":141258,"journal":{"name":"2022 International Symposium on Wireless Communication Systems (ISWCS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114948431","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 : 2022-10-19DOI: 10.1109/ISWCS56560.2022.9940344
Wenrui Zhang, Ming Jiang, Chunming Zhao
In this paper, an Internet of things(IoTs) scenario with short packet coding is studied in which a large number of sensors transmit short packets to the edge server through a sink node using a product code. Two main requirements are considered in this scenario which focuses on lower AoI and higher reliability (lower packet error rate, PER). In previous works, short packets are usually encoded into a long packet to improve reliability, which leads to large AoI. In this paper, a product coded packet scheme is considered because the joint packet encoding scheme using product code can be decoded by two ways, decoding of each row/column component code and joint iterative decoding of all component codes. Both of them may lead to a successfully decoding which greatly improves the AoI performance under the same PER conditions. The expression of the average AoI in this IoT system is derived, and the theoretical and numerical results show the relationships between packet length, the number of sensors and AoI performance. Furthermore, the optimal number of jointly-coded packets to minimize the AoI performance also are discussed and illustrated.
{"title":"Age of Information With Product Coded $text{IoT}$ Systems","authors":"Wenrui Zhang, Ming Jiang, Chunming Zhao","doi":"10.1109/ISWCS56560.2022.9940344","DOIUrl":"https://doi.org/10.1109/ISWCS56560.2022.9940344","url":null,"abstract":"In this paper, an Internet of things(IoTs) scenario with short packet coding is studied in which a large number of sensors transmit short packets to the edge server through a sink node using a product code. Two main requirements are considered in this scenario which focuses on lower AoI and higher reliability (lower packet error rate, PER). In previous works, short packets are usually encoded into a long packet to improve reliability, which leads to large AoI. In this paper, a product coded packet scheme is considered because the joint packet encoding scheme using product code can be decoded by two ways, decoding of each row/column component code and joint iterative decoding of all component codes. Both of them may lead to a successfully decoding which greatly improves the AoI performance under the same PER conditions. The expression of the average AoI in this IoT system is derived, and the theoretical and numerical results show the relationships between packet length, the number of sensors and AoI performance. Furthermore, the optimal number of jointly-coded packets to minimize the AoI performance also are discussed and illustrated.","PeriodicalId":141258,"journal":{"name":"2022 International Symposium on Wireless Communication Systems (ISWCS)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129731434","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 : 2022-10-19DOI: 10.1109/ISWCS56560.2022.9940327
Yang Yang, M. C. Gursoy
In this paper, energy efficiency is analyzed in a reconfigurable intelligent surface (RIS) aided mobile edge computing (MEC) network. The offloading decisions at the user equipments (UEs), computational resource allocation strategies at the MEC server, and the choice of RIS reflecting coefficients are jointly taken into consideration. To address the latency requirements, the use of finite blocklength (FBL) codes is considered in the uplink transmission, which also utilizes non-orthogonal multiple access (NOMA) for improved efficiency in resource usage. A UE-grouping scheme is introduced to group the UEs for NOMA transmission, and a dynamic CPU frequency allocation algorithm at the MEC server is developed. The primary objective is to maximize the overall energy efficiency of the RIS-aided MEC network under both decoding error rate and latency constraints. For this purpose, a four-step algorithm is devised to optimize RIS reflecting coefficients, offloaded data bits, offloading blocklength, and MEC frequency allocations. Simulation results illustrate the effectiveness of our proposed algorithm and the importance of UE scheduling with NOMA transmission.
{"title":"Energy-Efficient Scheduling in RIS-aided MEC Networks with NOMA and Finite Blocklength Codes","authors":"Yang Yang, M. C. Gursoy","doi":"10.1109/ISWCS56560.2022.9940327","DOIUrl":"https://doi.org/10.1109/ISWCS56560.2022.9940327","url":null,"abstract":"In this paper, energy efficiency is analyzed in a reconfigurable intelligent surface (RIS) aided mobile edge computing (MEC) network. The offloading decisions at the user equipments (UEs), computational resource allocation strategies at the MEC server, and the choice of RIS reflecting coefficients are jointly taken into consideration. To address the latency requirements, the use of finite blocklength (FBL) codes is considered in the uplink transmission, which also utilizes non-orthogonal multiple access (NOMA) for improved efficiency in resource usage. A UE-grouping scheme is introduced to group the UEs for NOMA transmission, and a dynamic CPU frequency allocation algorithm at the MEC server is developed. The primary objective is to maximize the overall energy efficiency of the RIS-aided MEC network under both decoding error rate and latency constraints. For this purpose, a four-step algorithm is devised to optimize RIS reflecting coefficients, offloaded data bits, offloading blocklength, and MEC frequency allocations. Simulation results illustrate the effectiveness of our proposed algorithm and the importance of UE scheduling with NOMA transmission.","PeriodicalId":141258,"journal":{"name":"2022 International Symposium on Wireless Communication Systems (ISWCS)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134633757","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 : 2022-10-19DOI: 10.1109/ISWCS56560.2022.9940430
Pengcheng He, Siyuan Lu, Xin Guan, Yibin Kang, Qingjiang Shi
This paper considers a performance optimization problem in a cellular network. The objective is to optimize the network performance measured by reference signal received powers (RSRPs) and signal to interference plus noise ratios (SINRs) through the jointly configuration of the antenna angles (both tilt and azimuth), height, and transmit power of base stations. The problem is challenging in two aspects: 1) there is a lack of explicit expressions for both RSRPs and SINRs; and 2) huge amount of decision variables makes the problem highly complex. To address these issues, we formulate it as a soft coverage maximization problem and propose a zeroth-order block coordinate projected gradient descent (ZO-BCPGD) method, which only relies on the calculation of objective function values. The proposed ZO-BCPGD is proven to converge to stationary points under mild assumptions. The performance of the proposed algorithm is validated by numerical experiments.
{"title":"A Zeroth-Order Block Coordinate Gradient Descent Method For Cellular Network Optimization","authors":"Pengcheng He, Siyuan Lu, Xin Guan, Yibin Kang, Qingjiang Shi","doi":"10.1109/ISWCS56560.2022.9940430","DOIUrl":"https://doi.org/10.1109/ISWCS56560.2022.9940430","url":null,"abstract":"This paper considers a performance optimization problem in a cellular network. The objective is to optimize the network performance measured by reference signal received powers (RSRPs) and signal to interference plus noise ratios (SINRs) through the jointly configuration of the antenna angles (both tilt and azimuth), height, and transmit power of base stations. The problem is challenging in two aspects: 1) there is a lack of explicit expressions for both RSRPs and SINRs; and 2) huge amount of decision variables makes the problem highly complex. To address these issues, we formulate it as a soft coverage maximization problem and propose a zeroth-order block coordinate projected gradient descent (ZO-BCPGD) method, which only relies on the calculation of objective function values. The proposed ZO-BCPGD is proven to converge to stationary points under mild assumptions. The performance of the proposed algorithm is validated by numerical experiments.","PeriodicalId":141258,"journal":{"name":"2022 International Symposium on Wireless Communication Systems (ISWCS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131822225","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 : 2022-10-19DOI: 10.1109/ISWCS56560.2022.9940392
Shanshan Zhang, Ying Cui, Wen Chen
With the explosive growth of the number of devices accessing the network, massive access has been a challenging task for the fifth generation (5G) and beyond. The uplink massive access scenario has the feature that only a subset of potential devices is active in each coherence time. In this paper, to serve more devices with lower overhead in massive access scenarios, we adopt a grant-free scheme where devices are allocated unique non-orthogonal pilots. We also design a kind of bilinear generalized approximate message passing (BiGAMP) algorithm which utilizes the row sparse channel matrix structure due to sporadic device access. In this work, the proposed algorithm jointly detects device activities, estimates channels, and detects signals in massive multiple-input multiple-output (MIMO) systems with one phase. The signal observation affords additional information to improve performance compared to other algorithms. In addition, we further analyze state evolution (SE) to characterize the per-formance of the BiGAMP algorithm. The numerical results demonstrate that the proposed algorithm performs better than baselines in device activity detection, channel estimation, and signal detection. And the numerical results of SE can describe the performance of the proposed algorithm.
{"title":"Joint Detection for Massive Grant-free Access via BiGAMP","authors":"Shanshan Zhang, Ying Cui, Wen Chen","doi":"10.1109/ISWCS56560.2022.9940392","DOIUrl":"https://doi.org/10.1109/ISWCS56560.2022.9940392","url":null,"abstract":"With the explosive growth of the number of devices accessing the network, massive access has been a challenging task for the fifth generation (5G) and beyond. The uplink massive access scenario has the feature that only a subset of potential devices is active in each coherence time. In this paper, to serve more devices with lower overhead in massive access scenarios, we adopt a grant-free scheme where devices are allocated unique non-orthogonal pilots. We also design a kind of bilinear generalized approximate message passing (BiGAMP) algorithm which utilizes the row sparse channel matrix structure due to sporadic device access. In this work, the proposed algorithm jointly detects device activities, estimates channels, and detects signals in massive multiple-input multiple-output (MIMO) systems with one phase. The signal observation affords additional information to improve performance compared to other algorithms. In addition, we further analyze state evolution (SE) to characterize the per-formance of the BiGAMP algorithm. The numerical results demonstrate that the proposed algorithm performs better than baselines in device activity detection, channel estimation, and signal detection. And the numerical results of SE can describe the performance of the proposed algorithm.","PeriodicalId":141258,"journal":{"name":"2022 International Symposium on Wireless Communication Systems (ISWCS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115116347","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 : 2022-10-19DOI: 10.1109/ISWCS56560.2022.9940415
A. Flores, R. D. Lamare, K. Mishra
Cell-free (CF) multiple-input multiple-output systems employ distributed access points (APs) to enhance their performance. In the downlink, CF systems resort to precoding techniques to overcome multiuser interference. However, network-wide precoders incur high computational and signaling costs that cannot be afforded by practical systems. Therefore, we develop user-centric precoders that use clusters of APs for downlink transmission. The clusters are formed by employing the large-scale fading coefficients between users and APs. An antenna selection policy is proposed to define the clusters of APs. Different from other techniques, we also employ a user selection matrix to restrict which users are taken into account in the computation of the precoder. Two major benefits emerge from the proposed approach. First, the computational cost is reduced because several channel estimates are unnecessary. Second, the computational complexity of the precoder is reduced by restricting the number of users, which leads to matrices with reduced size. Closed-form expressions to compute the sum-rate of the proposed precoders are derived. Numerical results demonstrate that our approach can attain more than 90% of the network-wide precoders performance, while offering lower costs.
{"title":"Cluster Precoders for Cell-Free MU-MIMO Systems","authors":"A. Flores, R. D. Lamare, K. Mishra","doi":"10.1109/ISWCS56560.2022.9940415","DOIUrl":"https://doi.org/10.1109/ISWCS56560.2022.9940415","url":null,"abstract":"Cell-free (CF) multiple-input multiple-output systems employ distributed access points (APs) to enhance their performance. In the downlink, CF systems resort to precoding techniques to overcome multiuser interference. However, network-wide precoders incur high computational and signaling costs that cannot be afforded by practical systems. Therefore, we develop user-centric precoders that use clusters of APs for downlink transmission. The clusters are formed by employing the large-scale fading coefficients between users and APs. An antenna selection policy is proposed to define the clusters of APs. Different from other techniques, we also employ a user selection matrix to restrict which users are taken into account in the computation of the precoder. Two major benefits emerge from the proposed approach. First, the computational cost is reduced because several channel estimates are unnecessary. Second, the computational complexity of the precoder is reduced by restricting the number of users, which leads to matrices with reduced size. Closed-form expressions to compute the sum-rate of the proposed precoders are derived. Numerical results demonstrate that our approach can attain more than 90% of the network-wide precoders performance, while offering lower costs.","PeriodicalId":141258,"journal":{"name":"2022 International Symposium on Wireless Communication Systems (ISWCS)","volume":"8 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114101866","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}
Localized channel modeling is paramount for 5G cellular network optimization. However, the existing channel models either apply to general scenarios and can not well match the localized geographical structures of physical environment, or have high computational complexity. In this paper, we propose a localized statistical channel modeling (LSCM) based on the radio map, which is aware of the targeted propagation environment. Instead of using channel impulse response, LSCM solely relies on the reference signal receiving power (RSRP), which can be expressed as a linear model of the channel's angular power spectrum (APS). Based on this, we formulate the task of channel modeling as a sparse recovery problem where the non-zero entries of the APS indicate the channel paths' power and angles of departure. In order to achieve good channel modeling performance, we propose a multi-grid-based APS estimation scheme which can make our LSCM more accurate. To exploit the similarities of the channel paths from adjacent grids, construct the radio map by interpolating the RSRP, and cluster the grids in beamspace. A novel regularization term that constrains both sparsity and similarity is also proposed to address the multi-grid-based LSCM problem. At last, extensive simulations based on both synthetic and real RSRP measurements are presented to verify the performance of the proposed channel model.
{"title":"Multi-Grid-Based Localized Statistical Channel Modeling: A Radio Map Approach","authors":"Xinzhi Ning, Shutao Zhang, Xiayu Zheng, Tsung-Hui Chang","doi":"10.1109/ISWCS56560.2022.9940390","DOIUrl":"https://doi.org/10.1109/ISWCS56560.2022.9940390","url":null,"abstract":"Localized channel modeling is paramount for 5G cellular network optimization. However, the existing channel models either apply to general scenarios and can not well match the localized geographical structures of physical environment, or have high computational complexity. In this paper, we propose a localized statistical channel modeling (LSCM) based on the radio map, which is aware of the targeted propagation environment. Instead of using channel impulse response, LSCM solely relies on the reference signal receiving power (RSRP), which can be expressed as a linear model of the channel's angular power spectrum (APS). Based on this, we formulate the task of channel modeling as a sparse recovery problem where the non-zero entries of the APS indicate the channel paths' power and angles of departure. In order to achieve good channel modeling performance, we propose a multi-grid-based APS estimation scheme which can make our LSCM more accurate. To exploit the similarities of the channel paths from adjacent grids, construct the radio map by interpolating the RSRP, and cluster the grids in beamspace. A novel regularization term that constrains both sparsity and similarity is also proposed to address the multi-grid-based LSCM problem. At last, extensive simulations based on both synthetic and real RSRP measurements are presented to verify the performance of the proposed channel model.","PeriodicalId":141258,"journal":{"name":"2022 International Symposium on Wireless Communication Systems (ISWCS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123799202","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 : 2022-10-19DOI: 10.1109/ISWCS56560.2022.9940347
Navaneetha C. Manjappa, L. Wimmer, N. Maletic, E. Grass
Secret key generation based on wireless channel reciprocity is a promising area of research towards ensuring secure wireless communication. In this paper, we propose a method of generating secret keys using channel diversity obtained via millimeter wave (mmWave) beamforming at 60 GHz. The pro-posed method is simulated using the QuaDRiGa channel model considering an industrial nonline of sight (NLOS) environment. We verify the method by conducting experiments using a 60 GHz software-defined-radio (SDR) communication system with a linear phased-array-antenna of 16 dual patch elements. Further, we present a composite key generation method in which both the real and imaginary parts of the channel state information (CSI) are utilised, and several sub-keys obtained from individual beam directions are appended. As a result, we can generate long composite keys with high entropy and secrecy. The keys randomness are assessed employing the National Institute of Standards and Technology (NIST) statistical test suite, showing the generated keys are highly random.
{"title":"Enhanced Physical Layer Secure Key Generation using mm Wave Beamforming","authors":"Navaneetha C. Manjappa, L. Wimmer, N. Maletic, E. Grass","doi":"10.1109/ISWCS56560.2022.9940347","DOIUrl":"https://doi.org/10.1109/ISWCS56560.2022.9940347","url":null,"abstract":"Secret key generation based on wireless channel reciprocity is a promising area of research towards ensuring secure wireless communication. In this paper, we propose a method of generating secret keys using channel diversity obtained via millimeter wave (mmWave) beamforming at 60 GHz. The pro-posed method is simulated using the QuaDRiGa channel model considering an industrial nonline of sight (NLOS) environment. We verify the method by conducting experiments using a 60 GHz software-defined-radio (SDR) communication system with a linear phased-array-antenna of 16 dual patch elements. Further, we present a composite key generation method in which both the real and imaginary parts of the channel state information (CSI) are utilised, and several sub-keys obtained from individual beam directions are appended. As a result, we can generate long composite keys with high entropy and secrecy. The keys randomness are assessed employing the National Institute of Standards and Technology (NIST) statistical test suite, showing the generated keys are highly random.","PeriodicalId":141258,"journal":{"name":"2022 International Symposium on Wireless Communication Systems (ISWCS)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133328325","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
扫码关注我们
求助内容：
应助结果提醒方式：