{"title":"Minimum-Energy and Error-Rate for URLLC Networks over Nakagami-m Channels: A Finite-Blocklength Analysis","authors":"Xi Zhang, Qixuan Zhu, H. Poor","doi":"10.1109/GLOBECOM38437.2019.9014251","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9014251","url":null,"abstract":"The fifth generation (5G) wireless networks aim at providing a wide range of time-sensitive multimedia services and applications to satisfy users’ stringent requirements on delay-bounded quality of service (QoS). One of the important requirements for 5G multimedia wireless networks is to efficiently support the ultra-reliable and low- latency communications (URLLC). Finite blocklength coding (FBC) is a promising candidate technique to support URLLC services, where mobile users transmit short packets to upper-bound the transmission delay of multimedia traffic. In this paper, we model and analyze the packet-block error rate for URLLC under the Nakagamim fading channel in the finite blocklength regime. Then, we derive the minimum energy per bit for data transmissions in the Nakagami-m fading channel under the constraint of block error rate. To derive closed-form expressions for the minimum energy per bit, we obtain achievability and converse bounds on the minimum energy per bit, and show that these two bounds are equal to each other. Finally, we evaluate our derived minimum energy per bit in the finite blocklength regime through numerical analyses, and compare it with those under the Rayleigh fading channel and the wideband approximation, validating our derived analytical results.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"23 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87617265","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}
Safa Zouaoui, Malek Souilem, W. Dghais, A. Radwan, S. Barmada, M. Tucci
{"title":"Wireless Power Transfer and Data Communication Cognitive Radio through Two-Coil Inductive Channel","authors":"Safa Zouaoui, Malek Souilem, W. Dghais, A. Radwan, S. Barmada, M. Tucci","doi":"10.1109/GLOBECOM38437.2019.9013290","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9013290","url":null,"abstract":"This paper investigates two-coil inductive channel for an efficient Wireless Power Transfer (WPT), while intelligently enabling high-data rate communication. The analysis is based on the power efficiency and channel capacity performance, which are determined based on the multiport scattering (S)-parameters numerical simulation results, using a lumped equivalent circuit model. Different access points and configuration scenarios, along with the decoupling filters design consideration of power and data links, were compared in order to cognitively share the two-coil inductive channel, for handling both high-power signal and low-power modulated high- frequency data signal. The performance of the transmission and isolation between the power and data link is evaluated. The theoretical channel capacity of the proposed two-coil circuit is calculated, as a function of the coupling coefficient k12, as well as in the presence of an additive white Gaussian noise and signal to noise ratio. This paper adds to the intelligence and cognition of the radio, to efficiently use the limited available spectrum for broadband communications, in addition to power transmission, simultaneously.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"25 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88252230","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optimal Power Encoding of OFDM Signals in All-Digital Transmitters","authors":"Omer Tanovic, R. Ma, P. Orlik, A. Megretski","doi":"10.1109/GLOBECOM38437.2019.9014289","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9014289","url":null,"abstract":"In this paper, we propose a power encoding method for converting a high-resolution OFDM baseband signal into a signal that assumes only a finite number of values. This is achieved by the series interconnection of, optimally (co)designed, delta- sigma (/spl Delta/ /Spl Sigma/M) and digital pulse-width modulators (DPWM). Given an input signal class with a known mplitude distribution (e.g., OFDM), parameters of the multilevel DPWM are designed such that the mean squared error of the inherent DPWM quantization noise is inimized. Parameters of the /spl Delta/ /Spl Sigma/M are then chosen with respect to the designed DPWM, so to optimally shape the inherent quantization noise out of the spectral band of interest. The superior performance of the proposed novel power encoding scheme is demonstrated by Matlab simulations on several standardized LTE test signals.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"78 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86181651","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Address Protection-as-a-Service an Inter-AS Framework for IP Spoofing Resilience","authors":"YiHao Jia, Y. Liu, Gang Ren","doi":"10.1109/GLOBECOM38437.2019.9013151","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9013151","url":null,"abstract":"IP spoofing, which is generally used for anonymity and amplification, constantly leads to pervasive distributed denial-of-service (DDoS) attacks. To mitigate IP spoofing, source address validation is divided into access network, intra-autonomous system (AS), and inter-AS levels. However, because of ambiguous incentives, heterogeneous demands, and fragile trust, techniques for the inter-AS level fail in practice, and thus, IP spoofing is still considered as an almost open vulnerability of the entire Internet. In this study, we aim to transform the inter-AS source address validation into an \"address protection\" service, and we mitigate IP spoofing through an economics-driven framework - apf ('a'ddress 'p'rotection 'f'ramework). In such a protection, the addresses belonging to one AS can be prevented from being spoofed by others. Behind the framework, such a service will be consolidated by a unified trust anchor with a uniform interface, and deployer ASes will be free to select their preferred techniques and invoke the service when needed. Based on the empirical data and theoretical analysis, we prove that the service is acceptable for triggering economics-driven implementation under the guidance of the apf framework.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"42 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86510941","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}
Nesrine Cherif, Mohamed Alzenad, H. Yanikomeroglu, A. Yongaçoğlu
{"title":"Downlink Coverage Analysis of an Aerial User in Vertical Heterogeneous Networks","authors":"Nesrine Cherif, Mohamed Alzenad, H. Yanikomeroglu, A. Yongaçoğlu","doi":"10.1109/GLOBECOM38437.2019.9013981","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9013981","url":null,"abstract":"Ubiquitous wireless connectivity is critical for the operation of aerial users. In this paper, we investigate the downlink coverage probability of a typical aerial user served by a network of terrestrial-BSs and aerial-BSs, which we refer to as the vertical HetNet (VHetNet). We model the terrestrial- BSs as an infinite 2-D Poisson point process (PPP) and aerial-BSs as a finite 2-D Binomial point process (BPP). A typical aerial user is assumed to be associated with the BS that provides the strongest biased average received signal power. Closed-form expressions for the association probabilities to a terrestrial-BS and an aerial-BS are derived. Under the assumption of an interference-limited network, we derive an expression for the coverage probability in terms of the Laplace transform of the aggregate interference power. Several design insights are presented, showing that the coverage probability does not have a steady behavior with the aerial user height; and a denser aerial-BS network improves the overall coverage probability. Moreover, the results reveal that the coverage probability under unbiased aerial user association always outperforms its biased counterpart","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"62 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86065162","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}
Zhengdi Hu, Guangquan Xu, Xi Zheng, Jiang Liu, Xiaojiang Du
{"title":"SSL-STR: Semi-Supervised Learning for Sparse Trust Recommendation","authors":"Zhengdi Hu, Guangquan Xu, Xi Zheng, Jiang Liu, Xiaojiang Du","doi":"10.1109/GLOBECOM38437.2019.9014085","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9014085","url":null,"abstract":"Trust is widely applied in recommender systems to improve recommendation performance by alleviating well-known problems, such as cold start, data sparsity, and so on. However, trust data itself also faces sparse problems. To solve these problems, we propose a novel sparse trust recommendation model, SSL-STR. Specifically, we decompose the aspects influencing trust-building into finer-grained factors, and combine these factors to mine the implicit sparse trust relationships among users by employing the Transductive Support Vector Machine algorithm. Then we extend SVD++ model with social trust and sparse trust information for rating prediction in the recommendation system. Experiments show that our SSL-STR improves the recommendation accuracy by up to 4.3%.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"20 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86306273","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Joint Estimation for Channel and I/Q Imbalance in Massive MIMO via Two-Timescale Optimization","authors":"Li Jia, Yinglei Teng, An Liu, V. Lau","doi":"10.1109/GLOBECOM38437.2019.9013388","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9013388","url":null,"abstract":"In this paper, joint estimation for channel and Inphase/Quadrature imbalance (IQI) is investigated in the downlink Frequency Division Duplexing (FDD) massive multiple-input multiple-output (MIMO) systems. First, exploiting the sparsity of massive MIMO channels and the timescale separation of channels and IQI, we derive a two-timescale sparse maximum a posterior (MAP) formulation for the joint estimation, where the IQI parameter is the long- term variable and the sparse channel is the short- term variable. Then we propose a two-timescale online joint sparse estimation (TOJSE) algorithm to solve the problem, which can converge to the stationary solutions of the original two-timescale non-convex stochastic optimization problem over time. Finally, simulations show that our proposed TOJSE algorithm can achieve significant gain over various baselines.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"49 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86536238","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}
Bangzhao Zhai, Wenda Tang, Aimin Tang, Mingzeng Dai, Xudong Wang
{"title":"AnalogMUSIC: A Concurrent Beam Training Scheme for Multiple Users in mmWave Systems","authors":"Bangzhao Zhai, Wenda Tang, Aimin Tang, Mingzeng Dai, Xudong Wang","doi":"10.1109/GLOBECOM38437.2019.9014086","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9014086","url":null,"abstract":"In this paper, a multi-user concurrent beam training scheme, named AnalogMUSIC, is designed for mmWave systems with a single radio frequency (RF) chain. In AnalogMUSIC, a one-RF chain based multiple signal classification (MUSIC) algorithm is developed for accurate direction estimation, where the training beams are switched in a time-division manner. To pursue a short training time, the training beams are switched at rough directions predefined by a coarse- resolution codebook. We prove that the traditional MUSIC algorithm can be achieved in the frequency domain. For orthogonal frequency division multiple access (OFDMA) systems, the multi-user training signals can be decoupled in the frequency domain. Thus, AnalogMUSIC achieves the concurrent beam training for multiple users by allocating different subcarriers to different users. To further adapt the number of switched training beams to various channel conditions, two coarse-resolution codebooks and a beam mapping mechanism are designed. Extensive simulations show that AnalogMUSIC can effectively improve beam training accuracy and substantially reduce delay overhead, compared with the existing schemes.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"81 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83878807","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Impact of Traffic Information Age on Congestion Mitigation","authors":"M. Dedeoglu, Te-Chuan Chiu, Junshan Zhang","doi":"10.1109/GLOBECOM38437.2019.9013165","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9013165","url":null,"abstract":"In a dynamic network environment, the applicability of traffic engineering techniques requires fresh traffic measurements, fast routing solvers and frequent network reconfigurations. However, the ages of traffic measurements exhibit significant variation due to asynchronization and random communication delays between routers and controllers. Besides, frequent reconfigurations may incur routing instability, and hence impair network utilization. We devise a controller-assisted distributed routing scheme with recursive link weight reconfigurations, accounting for the impact of measurement ages and routing instability. In particular, the controller estimates the current traffic conditions using an autoregressive model to account for the uncertainty of the age of measurements. A fast load-sensitive link weight update algorithm swiftly computes a new set of OSPF weights by using the estimated link loads. To reduce complexity, a myopic policy is used to determine link weight reconfiguration, which takes into consideration congestion, measurement ages, and possible instability. Since distributed routing offers stronger robustness against link failures compared to centralized routing, the proposed adaptive routing approach offers desirable robustness and further benefits from the controller assistance via iterative search of better OSPF weights.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"1 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82888306","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}