Pub Date : 2020-12-01DOI: 10.1109/GLOBECOM42002.2020.9322170
Beixiong Zheng, K. Yen, Xiaoming Peng, Rui Zhang
As an important role in achieving seamless world-wide coverage for the maritime communication, the VDE satellite component (VDE-SAT) aims to provide efficient services to a large number of ship terminals each with only a limited satellite coverage time, which requires efficient resource allocation strategies. In this paper, we investigate the downlink VDE-SAT system consisting of a low-earth orbiting (LEO) satellite communicating with multiple randomly distributed ship terminals. As the LEO satellite orbits the Earth at a fixed altitude and speed, ship terminals are served in a periodic manner with known but periodically time-varying channel gains from the satellite. By exploiting the periodic channel gain variations in the line-of-sight (LoS) dominant satellite-ship channels, we propose an angle partitionbased time division multiple access (TDMA) scheme to schedule downlink communications from the satellite to ship terminals based on the moving satellite’s real-time position. Specifically, time resources allocated to different ship terminals are optimized via the partition of the satellite’s azimuth angle range to maximize their minimum/common throughput. Simulation results verify the effectiveness of the proposed angle partition-based TDMA scheme and show its performance improvement over benchmark schemes.
{"title":"Angle Partition-Based TDMA for VDES Satellite Multiuser Downlink Communications","authors":"Beixiong Zheng, K. Yen, Xiaoming Peng, Rui Zhang","doi":"10.1109/GLOBECOM42002.2020.9322170","DOIUrl":"https://doi.org/10.1109/GLOBECOM42002.2020.9322170","url":null,"abstract":"As an important role in achieving seamless world-wide coverage for the maritime communication, the VDE satellite component (VDE-SAT) aims to provide efficient services to a large number of ship terminals each with only a limited satellite coverage time, which requires efficient resource allocation strategies. In this paper, we investigate the downlink VDE-SAT system consisting of a low-earth orbiting (LEO) satellite communicating with multiple randomly distributed ship terminals. As the LEO satellite orbits the Earth at a fixed altitude and speed, ship terminals are served in a periodic manner with known but periodically time-varying channel gains from the satellite. By exploiting the periodic channel gain variations in the line-of-sight (LoS) dominant satellite-ship channels, we propose an angle partitionbased time division multiple access (TDMA) scheme to schedule downlink communications from the satellite to ship terminals based on the moving satellite’s real-time position. Specifically, time resources allocated to different ship terminals are optimized via the partition of the satellite’s azimuth angle range to maximize their minimum/common throughput. Simulation results verify the effectiveness of the proposed angle partition-based TDMA scheme and show its performance improvement over benchmark schemes.","PeriodicalId":12759,"journal":{"name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","volume":"52 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83878768","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 : 2020-12-01DOI: 10.1109/GLOBECOM42002.2020.9322610
W. Yuan, Jinhong Yuan, D. W. K. Ng
Location awareness becomes an essential requirement for numerous applications and services in the future wireless communications. This paper addresses the problem of joint localization and synchronization in a network with cooperative nodes. The focus of this work is on the design of a low-complexity yet near-optimal message-passing implementations. To avoid the high-complexity of applying particle filtering-based approaches, we suitably augment the factor graph by introducing auxiliary variables. Then we propose a hybrid method that combines belief propagation (BP) and mean field (MF) message passing, which are used for message updating in the synchronization and localization parts of the factor graph, respectively. As a result, all messages on factor graph can be represented in parametric forms such that the proposed algorithm features a significantly low complexity while achieving near-optimal positioning performance.
{"title":"Parametric Message-passing for Joint Localization and Synchronization in Cooperative Networks","authors":"W. Yuan, Jinhong Yuan, D. W. K. Ng","doi":"10.1109/GLOBECOM42002.2020.9322610","DOIUrl":"https://doi.org/10.1109/GLOBECOM42002.2020.9322610","url":null,"abstract":"Location awareness becomes an essential requirement for numerous applications and services in the future wireless communications. This paper addresses the problem of joint localization and synchronization in a network with cooperative nodes. The focus of this work is on the design of a low-complexity yet near-optimal message-passing implementations. To avoid the high-complexity of applying particle filtering-based approaches, we suitably augment the factor graph by introducing auxiliary variables. Then we propose a hybrid method that combines belief propagation (BP) and mean field (MF) message passing, which are used for message updating in the synchronization and localization parts of the factor graph, respectively. As a result, all messages on factor graph can be represented in parametric forms such that the proposed algorithm features a significantly low complexity while achieving near-optimal positioning performance.","PeriodicalId":12759,"journal":{"name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","volume":"41 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82700445","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 : 2020-12-01DOI: 10.1109/GLOBECOM42002.2020.9322361
Youjun Luo, Andy Sun, Feng Wang, R. Shea, Jiangchuan Liu
While advancements in computing algorithms and hardware have enabled real-time stream analytics in videos, the information-rich audio bonded with video is still usually dropped and wasted. Processing both audio and video stream is not trivial as synchronizing multiple data streams creates much more difficulties than processing only one stream. In this paper, we designed and implemented a lightweight multimodal stream processing system that keeps both streams synchronized in processing and tested in a typical use case profanity filter. While it is inevitable to slow down certain processors to keep the steams synchronized, by careful butter setting, the overall latency is not affected (still 400-500ms). Besides achieving real-time processing, we located a core problem causing bursty audio latency and gave directions for further latency improvements.
{"title":"RealSync: A Synchronous Multimodality Media Stream Analytic Framework for Real-Time Communications Applications","authors":"Youjun Luo, Andy Sun, Feng Wang, R. Shea, Jiangchuan Liu","doi":"10.1109/GLOBECOM42002.2020.9322361","DOIUrl":"https://doi.org/10.1109/GLOBECOM42002.2020.9322361","url":null,"abstract":"While advancements in computing algorithms and hardware have enabled real-time stream analytics in videos, the information-rich audio bonded with video is still usually dropped and wasted. Processing both audio and video stream is not trivial as synchronizing multiple data streams creates much more difficulties than processing only one stream. In this paper, we designed and implemented a lightweight multimodal stream processing system that keeps both streams synchronized in processing and tested in a typical use case profanity filter. While it is inevitable to slow down certain processors to keep the steams synchronized, by careful butter setting, the overall latency is not affected (still 400-500ms). Besides achieving real-time processing, we located a core problem causing bursty audio latency and gave directions for further latency improvements.","PeriodicalId":12759,"journal":{"name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","volume":"44 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82857302","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 : 2020-12-01DOI: 10.1109/GLOBECOM42002.2020.9322582
Yajuan Wu, Deli Qiao, Hai-feng Qian
In this paper, a multi-user system adopting finite blocklength (FBL) channel codes for downlink (DL) transmissions under quality-of-service (QoS) constraints is considered. A framework for minimizing the total bandwidth to ensure ultrareliable and low-latency communications (URLLC) between a transmitter and multiple users is established. Frequency-selective fading channels are considered. It is assumed that channel state information (CSI) is perfectly known at the receiver. Effective capacity framework is employed to characterize the throughput under delay constraints with FBL channel codes. The relationship between the throughput and the bandwidth is studied. The optimization problem to minimize the total bandwidth under different QoS and minimum throughput limits is formulated. Furthermore, an efficient algorithm to obtain the optimal bandwidth allocation scheme is proposed. Overall, the impact of delay exponents, decoding error probability and minimum throughput on URLLC is characterized.
{"title":"Efficient Bandwidth Allocation for URLLC in Frequency-Selective Fading Channels","authors":"Yajuan Wu, Deli Qiao, Hai-feng Qian","doi":"10.1109/GLOBECOM42002.2020.9322582","DOIUrl":"https://doi.org/10.1109/GLOBECOM42002.2020.9322582","url":null,"abstract":"In this paper, a multi-user system adopting finite blocklength (FBL) channel codes for downlink (DL) transmissions under quality-of-service (QoS) constraints is considered. A framework for minimizing the total bandwidth to ensure ultrareliable and low-latency communications (URLLC) between a transmitter and multiple users is established. Frequency-selective fading channels are considered. It is assumed that channel state information (CSI) is perfectly known at the receiver. Effective capacity framework is employed to characterize the throughput under delay constraints with FBL channel codes. The relationship between the throughput and the bandwidth is studied. The optimization problem to minimize the total bandwidth under different QoS and minimum throughput limits is formulated. Furthermore, an efficient algorithm to obtain the optimal bandwidth allocation scheme is proposed. Overall, the impact of delay exponents, decoding error probability and minimum throughput on URLLC is characterized.","PeriodicalId":12759,"journal":{"name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","volume":"10 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88985965","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 : 2020-12-01DOI: 10.1109/GLOBECOM42002.2020.9322389
Zheng Zhang, Jian Chen, Lu Lv, Qiang Ye
In this paper, we propose an innovative framework to improve the physical layer security of cognitive radio nonorthogonal multiple access (CR-NOMA) networks. Specifically, we consider a cooperative spectrum-sharing mechanism, where a cognitive transmitter serves as a relay and assists primary/cognitive transmissions using the NOMA principle in the presence of a passive eavesdropper. Technically, we propose a new cooperative jamming scheme, where the primary/cognitive receivers and the primary transmitter are recruited as jammers to transmit artificial noise in order to intentionally confuse eavesdropper. Under a practical assumption that only the statistical channel state information of eavesdropper is available, the secrecy outage probability (SOP) is used as the performance metric. An optimization problem of maximizing the minimum confidential information rate among the primary and cognitive receivers is formulated. We devise a successive convex approximation based power allocation algorithm to efficiently solve the non-convex optimization problem. Our simulation results indicate that the proposed scheme outperforms the orthogonal multiple access based schemes in terms of minimum confidential information rate.
{"title":"Utilizing Cooperative Jamming to Secure Cognitive Radio NOMA Networks","authors":"Zheng Zhang, Jian Chen, Lu Lv, Qiang Ye","doi":"10.1109/GLOBECOM42002.2020.9322389","DOIUrl":"https://doi.org/10.1109/GLOBECOM42002.2020.9322389","url":null,"abstract":"In this paper, we propose an innovative framework to improve the physical layer security of cognitive radio nonorthogonal multiple access (CR-NOMA) networks. Specifically, we consider a cooperative spectrum-sharing mechanism, where a cognitive transmitter serves as a relay and assists primary/cognitive transmissions using the NOMA principle in the presence of a passive eavesdropper. Technically, we propose a new cooperative jamming scheme, where the primary/cognitive receivers and the primary transmitter are recruited as jammers to transmit artificial noise in order to intentionally confuse eavesdropper. Under a practical assumption that only the statistical channel state information of eavesdropper is available, the secrecy outage probability (SOP) is used as the performance metric. An optimization problem of maximizing the minimum confidential information rate among the primary and cognitive receivers is formulated. We devise a successive convex approximation based power allocation algorithm to efficiently solve the non-convex optimization problem. Our simulation results indicate that the proposed scheme outperforms the orthogonal multiple access based schemes in terms of minimum confidential information rate.","PeriodicalId":12759,"journal":{"name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","volume":"49 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89074394","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 : 2020-12-01DOI: 10.1109/GLOBECOM42002.2020.9322413
S. Gupta, Abhishek K. Gupta
Past literature on the analysis of mmWave cellular network’s performance in the presence of random blockages has assumed independent blocking of each link. In reality, a large blockage can block multiple links resulting in a correlation in blocking of these links. This paper focuses on deriving the impact of this correlation on the SINR performance of a mmWave cellular system. In particular, we consider the conditional probability of having line-of-sight (LoS) and non-LoS (NLoS) interferers conditioned on serving link being LOS or NLoS. We derive the distribution of the serving base-station (BS) distance from a typical user. We characterize the sum interference at the user by considering the correlation between blockage of serving and interfering links and derive the SINR coverage probability. Via numerical simulations, we show that including blockage correlation in the analysis is required in accurate characterization of the system performance, in particular when the blockages tend to be large.
{"title":"Does Blockage Correlation Matter in the Performance of mmWave Cellular Networks?","authors":"S. Gupta, Abhishek K. Gupta","doi":"10.1109/GLOBECOM42002.2020.9322413","DOIUrl":"https://doi.org/10.1109/GLOBECOM42002.2020.9322413","url":null,"abstract":"Past literature on the analysis of mmWave cellular network’s performance in the presence of random blockages has assumed independent blocking of each link. In reality, a large blockage can block multiple links resulting in a correlation in blocking of these links. This paper focuses on deriving the impact of this correlation on the SINR performance of a mmWave cellular system. In particular, we consider the conditional probability of having line-of-sight (LoS) and non-LoS (NLoS) interferers conditioned on serving link being LOS or NLoS. We derive the distribution of the serving base-station (BS) distance from a typical user. We characterize the sum interference at the user by considering the correlation between blockage of serving and interfering links and derive the SINR coverage probability. Via numerical simulations, we show that including blockage correlation in the analysis is required in accurate characterization of the system performance, in particular when the blockages tend to be large.","PeriodicalId":12759,"journal":{"name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","volume":"93 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89084636","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 : 2020-12-01DOI: 10.1109/GLOBECOM42002.2020.9322357
Qiang Gao, Fan Zhou, Goce Trajcevski, Fengli Zhang, Xucheng Luo
The ubiquity of mobile devices use has generated huge volumes of location-aware contextual data, providing opportunities enriching various location-based social network (LBSN) applications – e.g., trip recommendation, ride-sharing allocation and taxi demand prediction etc. Trajectory-based social circle inference (TSCI), which aims at inferring the social relationships among users based on the human mobility data, has received great attention in recent years due to its importance in many LBSN applications. However, existing solutions suffer from three key challenges, including (1) lack of modeling contextual feature in user check-ins; (2) cannot capture the structural information in user motion patterns; (3) and fail to consider the underlying mobility distribution. In this paper, we propose a novel framework ASCI-CAM (Adversity-based Social Circles Inference via Context-Aware Mobility) to address the above challenges. ASCI-CAM is a graph-based model taking into account the contextual information associated with check-ins which, combined with an attentive auto-encoder, allows for semantic trajectory representation. We regularize the learned trajectory embedding with an adversarial learning procedure, which allows us to better understand the user mobility patterns and personalized trajectory distribution. Our extensive experiments on real-world mobility datasets demonstrate that our model achieves significant improvement over the state-of-the-art baselines.
{"title":"Adversity-based Social Circles Inference via Context-Aware Mobility","authors":"Qiang Gao, Fan Zhou, Goce Trajcevski, Fengli Zhang, Xucheng Luo","doi":"10.1109/GLOBECOM42002.2020.9322357","DOIUrl":"https://doi.org/10.1109/GLOBECOM42002.2020.9322357","url":null,"abstract":"The ubiquity of mobile devices use has generated huge volumes of location-aware contextual data, providing opportunities enriching various location-based social network (LBSN) applications – e.g., trip recommendation, ride-sharing allocation and taxi demand prediction etc. Trajectory-based social circle inference (TSCI), which aims at inferring the social relationships among users based on the human mobility data, has received great attention in recent years due to its importance in many LBSN applications. However, existing solutions suffer from three key challenges, including (1) lack of modeling contextual feature in user check-ins; (2) cannot capture the structural information in user motion patterns; (3) and fail to consider the underlying mobility distribution. In this paper, we propose a novel framework ASCI-CAM (Adversity-based Social Circles Inference via Context-Aware Mobility) to address the above challenges. ASCI-CAM is a graph-based model taking into account the contextual information associated with check-ins which, combined with an attentive auto-encoder, allows for semantic trajectory representation. We regularize the learned trajectory embedding with an adversarial learning procedure, which allows us to better understand the user mobility patterns and personalized trajectory distribution. Our extensive experiments on real-world mobility datasets demonstrate that our model achieves significant improvement over the state-of-the-art baselines.","PeriodicalId":12759,"journal":{"name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","volume":"46 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90350587","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 : 2020-12-01DOI: 10.1109/GLOBECOM42002.2020.9348001
Xiangyu Ren, Hamed Mosavat-Jahromi, Lin X. Cai, D. Kidston
Radio spectrum is a limited and increasingly scarce resource, which motivates alternative usage methods such as dynamic spectrum allocation (DSA). DSA of a frequency band requires an accurate prediction of spectrum usage in both the time and spatial domains with minimal sensing cost. In this paper, we address challenge in two steps. First, in order to make the best use of the limited sensors in the region, we deploy a deep learning prediction model based on convolutional neural networks (CNNs) and residual networks (ResNets), to predict spatio-temporal spectrum usage at the sensors' locations. Second, given an area enclosed by a few sensors, a Bayesian estimation model is proposed to first derive the location distribution of a transmitter, and then obtain the interference power distribution within the area. Simulation results show the efficacy and efficiency of the proposed prediction models.
{"title":"Spatio-temporal Spectrum Load Prediction using Convolutional Neural Network and Bayesian Estimation","authors":"Xiangyu Ren, Hamed Mosavat-Jahromi, Lin X. Cai, D. Kidston","doi":"10.1109/GLOBECOM42002.2020.9348001","DOIUrl":"https://doi.org/10.1109/GLOBECOM42002.2020.9348001","url":null,"abstract":"Radio spectrum is a limited and increasingly scarce resource, which motivates alternative usage methods such as dynamic spectrum allocation (DSA). DSA of a frequency band requires an accurate prediction of spectrum usage in both the time and spatial domains with minimal sensing cost. In this paper, we address challenge in two steps. First, in order to make the best use of the limited sensors in the region, we deploy a deep learning prediction model based on convolutional neural networks (CNNs) and residual networks (ResNets), to predict spatio-temporal spectrum usage at the sensors' locations. Second, given an area enclosed by a few sensors, a Bayesian estimation model is proposed to first derive the location distribution of a transmitter, and then obtain the interference power distribution within the area. Simulation results show the efficacy and efficiency of the proposed prediction models.","PeriodicalId":12759,"journal":{"name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","volume":"1 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88941863","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 : 2020-12-01DOI: 10.1109/GLOBECOM42002.2020.9348261
Guillem Reus Muns, Dheryta Jaisinghani, K. Sankhe, K. Chowdhury
5G and open radio access networks (Open RANs) will result in vendor-neutral hardware deployment that will require additional diligence towards managing security risks. This new paradigm will allow the same network infrastructure to support virtual network slices for transmit different waveforms, such as 5G New Radio, LTE, WiFi, at different times. In this multivendor, multi-protocol/waveform setting, we propose an additional physical layer authentication method that detects a specific emitter through a technique called as RF fingerprinting. Our deep learning approach uses convolutional neural networks augmented with triplet loss, where examples of similar/dissimilar signal samples are shown to the classifier over the training duration. We demonstrate the feasibility of RF fingerprinting base stations over the large-scale over-the-air experimental POWDER platform in Salt Lake City, Utah, USA. Using real world datasets, we show how our approach overcomes the challenges posed by changing channel conditions and protocol choices with 99.86% detection accuracy for different training and testing days.
5G和开放式无线接入网络(open ran)将导致供应商中立的硬件部署，这将需要额外的尽职调查来管理安全风险。这种新模式将允许相同的网络基础设施在不同时间支持传输不同波形的虚拟网络切片，例如5G new Radio、LTE、WiFi。在这种多供应商、多协议/波形设置中，我们提出了一种额外的物理层身份验证方法，该方法通过一种称为射频指纹的技术检测特定的发射器。我们的深度学习方法使用带有三重损失增强的卷积神经网络，其中在训练期间向分类器显示相似/不相似信号样本的示例。我们在美国犹他州盐湖城的大规模空中实验POWDER平台上演示了射频指纹基站的可行性。使用真实世界的数据集，我们展示了我们的方法如何克服改变信道条件和协议选择所带来的挑战，在不同的训练和测试日具有99.86%的检测准确率。
{"title":"Trust in 5G Open RANs through Machine Learning: RF Fingerprinting on the POWDER PAWR Platform","authors":"Guillem Reus Muns, Dheryta Jaisinghani, K. Sankhe, K. Chowdhury","doi":"10.1109/GLOBECOM42002.2020.9348261","DOIUrl":"https://doi.org/10.1109/GLOBECOM42002.2020.9348261","url":null,"abstract":"5G and open radio access networks (Open RANs) will result in vendor-neutral hardware deployment that will require additional diligence towards managing security risks. This new paradigm will allow the same network infrastructure to support virtual network slices for transmit different waveforms, such as 5G New Radio, LTE, WiFi, at different times. In this multivendor, multi-protocol/waveform setting, we propose an additional physical layer authentication method that detects a specific emitter through a technique called as RF fingerprinting. Our deep learning approach uses convolutional neural networks augmented with triplet loss, where examples of similar/dissimilar signal samples are shown to the classifier over the training duration. We demonstrate the feasibility of RF fingerprinting base stations over the large-scale over-the-air experimental POWDER platform in Salt Lake City, Utah, USA. Using real world datasets, we show how our approach overcomes the challenges posed by changing channel conditions and protocol choices with 99.86% detection accuracy for different training and testing days.","PeriodicalId":12759,"journal":{"name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","volume":"43 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91385781","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 : 2020-12-01DOI: 10.1109/GLOBECOM42002.2020.9322604
Yi-Han Chiang, Hai-Hsing Lin, Yusheng Ji, W. Liao
Energy saving in cellular systems has attracted the extensive attention of various studies due to ever-deteriorating global warming. In addition to network greenness, various emerging mobile applications (e.g., mixed reality and automated vehicles) further necessitate timely service provision. Recently, the age of information (AoI) has been regarded as a promising performance metric for quantifying the freshness (i.e., timeliness) of information updates in communication systems. Despite the existing works devoted to energy saving in cellular systems, how to leverage information freshness to ensure timely information updates while achieving network greenness is rarely investigated. In this paper, we investigate the problem of freshness-aware energy saving in cellular systems, where active base stations (BSs) can cooperatively update information to target devices (TDs). To address this problem, we formulate a mixed-integer nonlinear program (MINLP) to minimize average power consumption. Due to its intractability, we propose decomposing the MINLP into two subproblems by means of constraint reinterpretation and spatiotemporal decoupling. Then, we propose a two-stage solution that leverages LP techniques to sequentially determine update scheduling and BS activeness. Our simulation results show that the proposed solution can adequately perform update scheduling and BS activeness control, thereby effectively saving energy for cellular systems under various parameter settings.
{"title":"Freshness-aware Energy Saving in Cellular Systems with Cooperative Information Updates","authors":"Yi-Han Chiang, Hai-Hsing Lin, Yusheng Ji, W. Liao","doi":"10.1109/GLOBECOM42002.2020.9322604","DOIUrl":"https://doi.org/10.1109/GLOBECOM42002.2020.9322604","url":null,"abstract":"Energy saving in cellular systems has attracted the extensive attention of various studies due to ever-deteriorating global warming. In addition to network greenness, various emerging mobile applications (e.g., mixed reality and automated vehicles) further necessitate timely service provision. Recently, the age of information (AoI) has been regarded as a promising performance metric for quantifying the freshness (i.e., timeliness) of information updates in communication systems. Despite the existing works devoted to energy saving in cellular systems, how to leverage information freshness to ensure timely information updates while achieving network greenness is rarely investigated. In this paper, we investigate the problem of freshness-aware energy saving in cellular systems, where active base stations (BSs) can cooperatively update information to target devices (TDs). To address this problem, we formulate a mixed-integer nonlinear program (MINLP) to minimize average power consumption. Due to its intractability, we propose decomposing the MINLP into two subproblems by means of constraint reinterpretation and spatiotemporal decoupling. Then, we propose a two-stage solution that leverages LP techniques to sequentially determine update scheduling and BS activeness. Our simulation results show that the proposed solution can adequately perform update scheduling and BS activeness control, thereby effectively saving energy for cellular systems under various parameter settings.","PeriodicalId":12759,"journal":{"name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","volume":"30 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83100549","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
扫码关注我们
求助内容：
应助结果提醒方式：