{"title":"Quantized Non-Bayesian Quickest Change Detection with Energy Harvesting","authors":"Sinchan Biswas, S. Knorn, S. Dey, A. Ahlén","doi":"10.1109/GLOCOM.2018.8647715","DOIUrl":"https://doi.org/10.1109/GLOCOM.2018.8647715","url":null,"abstract":"This paper focuses on the analysis of an optimal sensing and quantization strategy in a multi-sensor network where each individual sensor sends its quantized log-likelihood information to the fusion center (FC) for non-Bayesian quickest change detection. It is assumed that the sensors are equipped with a battery/energy storage device of finite capacity, capable of harvesting energy from the environment. The FC is assumed to have access to either non-causal or causal channel state information (CSI) and energy state information (ESI) from all the sensors while performing the quickest change detection. The primary observations are assumed to be generated from a sequence of random variables whose probability distribution function changes at an unknown time point. The objective of the detection problem is to minimize the average detection delay of the change point with respect to a lower bound on the rate of false alarm. In this framework, the optimal sensing decision and number of quantization bits for information transmission can be determined with the constraint of limited available energy due to finite battery capacity. This optimization is formulated as a stochastic control problem and is solved using dynamic programming algorithms for both non-causal and causal CSI and ESI scenario. A set of non-linear equations is also derived to determine the optimal quantization thresholds for the sensor log-likelihood ratios, by maximizing an appropriate Kullback-Leibler (KL) divergence measure between the distributions before and after the change. A uniform threshold quantization strategy is also proposed as a simple sub-optimal policy. The simulation results indicate that the optimal quantization is preferable when the number of quantization bits is low as its performance is significantly better compared to its uniform counterpart in terms of average detection delay. For the case of a large number of quantization bits, the performance benefits of using the optimal quantization as compared to its uniform counterpart diminish, as expected.","PeriodicalId":201848,"journal":{"name":"2018 IEEE Global Communications Conference (GLOBECOM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130958731","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":"Game-Based Power Control for Downlink Non-Orthogonal Multiple Access in HetNets","authors":"Yueyue Zhang, Yaping Zhu, Weiwei Xia, Fei Shen, Xuzhou Zuo, Feng Yan, Lianfeng Shen","doi":"10.1109/GLOCOM.2018.8647230","DOIUrl":"https://doi.org/10.1109/GLOCOM.2018.8647230","url":null,"abstract":"In this paper, we propose an energy-efficient power control algorithm (EPCA) using a game theory approach, which can be exploited for non-orthogonal multiple access (NOMA) in heterogeneous networks (HetNets). Firstly, we formulate the energy efficiency (EE) maximization problems for users in the macrocell and femtocell, respectively. Then, to reduce information exchanged between the base stations and users, we present a centralized implementation of the EPCA based on a noncooperative game. By studying the properties of the derived game, we develop convex optimization problems to deduce the unique Nash equilibrium (NE). Simulation results show that the proposed EPCA could converge to the equilibrium with higher system-level EE and spectrum efficiency.","PeriodicalId":201848,"journal":{"name":"2018 IEEE Global Communications Conference (GLOBECOM)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132849012","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}
Xiaoling Hu, C. Zhong, Xiaoming Chen, Weiqiang Xu, Zhaoyang Zhang
{"title":"Rate Analysis and ADC Bits Allocation for Cell-Free Massive MIMO Systems with Low Resolution ADCs","authors":"Xiaoling Hu, C. Zhong, Xiaoming Chen, Weiqiang Xu, Zhaoyang Zhang","doi":"10.1109/GLOCOM.2018.8647412","DOIUrl":"https://doi.org/10.1109/GLOCOM.2018.8647412","url":null,"abstract":"We study the effects of low resolution analog-to-digital converters (ADCs) on cell-free massive multiple-input multiple-output (MIMO) systems. We first derive a closed-form expression for the achievable rate, which enables efficient evaluation of the impact of key parameters on system performance. Then, we give a simple approximate closed-form expression for the individual user rate, which indicates that the ADC resolution at the user is the main constraining factor for the user rate. Furthermore, we study the allocation of ADC resolution bits among different access points (APs) with fixed total resolution bits. It has been shown that our proposed ADC resolution bits allocation scheme is substantially superior to the equal ADC resolution bits allocation scheme. Finally, we provide simulation results to verify our analytical results.","PeriodicalId":201848,"journal":{"name":"2018 IEEE Global Communications Conference (GLOBECOM)","volume":"2 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132865133","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}
Jean-Alain Lucciardi, G. Mesnager, N. Thomas, C. Poulliat, M. Boucheret, G. Buscarlet
{"title":"Piecewise Volterra Series Approximation for Improved Non-Linear Channel Modelization and Detection","authors":"Jean-Alain Lucciardi, G. Mesnager, N. Thomas, C. Poulliat, M. Boucheret, G. Buscarlet","doi":"10.1109/GLOCOM.2018.8647907","DOIUrl":"https://doi.org/10.1109/GLOCOM.2018.8647907","url":null,"abstract":"In satellite communications, the non-linear distortions introduced by the amplifier in the payload have to be overcome. When advanced mitigation techniques are considered at the receiver side, the current channel model is often based on Volterra series derived from an approximation of the non linear transfer function of the on-board amplifier. This nonlinear model is conditioning the performance at the receiver side. In this paper, a new non-linear model is proposed, leading to improved receiver performances. The polynomial approximation is improved considering both the usual model truncation to the $3^{rd}$ order and the signal fluctuation at the input of the amplifier. First, the impact of the polynomial order of the AM/AM and AM/PM curve approximation is studied. Then, a non-linear model is derived based on a piecewise polynomial approximation of the amplifier response. Based on this refined nonlinear model, significant detection performance improvements are shown for both Nyquist and Faster-than-Nyquist rates.","PeriodicalId":201848,"journal":{"name":"2018 IEEE Global Communications Conference (GLOBECOM)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133025301","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":"Maximizing Profit of Network InP by Cross-Priority Traffic Engineering","authors":"Yi Xu, Du Xu","doi":"10.1109/GLOCOM.2018.8647722","DOIUrl":"https://doi.org/10.1109/GLOCOM.2018.8647722","url":null,"abstract":"Traffic engineering (TE) plays an important role in determining the network performance and reliability, which has been studied thoroughly in past decades. However, due to the advances in cloud and mobile computing, the confliction of bandwidth provision and consumption in network becomes more and more complicated. A major challenge of the Infrastructure Provider (InP) is how to guarantee the high-priority user demands, select valuable and appropriate low-priority user demands, and keep maximum profit simultaneously. This kind of optimal problems related with cross- priority TE was studied in this paper. We first analyzed the relationship between network resources, multi-priority user demand and provider's revenue. And then constructed an event- driven SDN-like control system that could support multiple priority TE. Based on the parameters of network topology, SLA and system measurement, an optimal model for InP's profit was given. By building a genetic-based algorithm called global resource allocating (GRA) algorithm, we exploited the near optimal profit that satisfied partial low-priority demands after satisfying all high- priority demands. Moreover, a dual GRA (DGRA) algorithm which can find out optimal mixture deployment patterns was also studied. With numerical results, we show that both GRA and DGRA could always obtain better result compared to a two-step greedy.","PeriodicalId":201848,"journal":{"name":"2018 IEEE Global Communications Conference (GLOBECOM)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133575295","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}
J. Leithon, Luis Suarez, D. Jayakody, Muhammad Moiz Anis
{"title":"A Task Scheduling Strategy for Utility Maximization in a Renewable-Powered IoT Node","authors":"J. Leithon, Luis Suarez, D. Jayakody, Muhammad Moiz Anis","doi":"10.1109/GLOCOM.2018.8647691","DOIUrl":"https://doi.org/10.1109/GLOCOM.2018.8647691","url":null,"abstract":"In this paper, we propose a task scheduling strategy for an Internet of Things (IoT) node powered by renewable energy (RE). The node is assumed to have a rechargeable battery and an RE harvester. Moreover, the node is requested to perform M tasks over a planning period of N ≥ M time slots. Each task is assigned a priority rating and a reward. With these considerations we develop a mathematical framework to optimize the utility of the node, defined as the sum of rewards over the specified planning horizon. Using the proposed framework, we derive a genie-aided strategy, which serves as a performance benchmark for online algorithms. We then propose an online task scheduling strategy, which uses existing forecasting methods to estimate future RE production. We finally evaluate the performance of the proposed strategy and its robustness to forecasting errors through extensive simulations. The impact of system parameters such as battery size and RE harvesting capacity are also examined numerically.","PeriodicalId":201848,"journal":{"name":"2018 IEEE Global Communications Conference (GLOBECOM)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133711635","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":"Enhanced CSMA/CA Protocol Design for Integrated Data and Energy Transfer in WLANs","authors":"Yizhe Zhao, Jie Hu, Ran Guo, Kun Yang, S. Leng","doi":"10.1109/GLOCOM.2018.8647766","DOIUrl":"https://doi.org/10.1109/GLOCOM.2018.8647766","url":null,"abstract":"We study a distributed coordination function (DCF) aided WLAN system, where the user stations (STAs) are capable of harvesting energy either from the AP's downlink data transmission or from the AP's dedicated downlink energy transfer. The energy harvested by the STAs is then exploited for powering their own uplink data transmission. Based on the classic carrier-sense-multiple-access with collision avoidance (CSMA/CA) protocol, a pair of enhanced versions are proposed for the sake of incorporating the active energy request of the STAs and the dedicated energy transfer of the AP. The first one is the energy-backoff-interval aided CSMA/CA (EBI-CSMA/CA) protocol. The other is the energy-packet aided CSMA/CA protocol (EP-CSMA/CA). According to our simulation results, both of the protocols are capable of substantially increasing the uplink throughput, when compared to their counterpart without the dedicated energy transfer. Furthermore, the EP-CSMA/CA protocol is more energy-efficient than the EBI-CSMA/CA protocol, since it does not require frequent control signalling exchange for the energy requests and responses.","PeriodicalId":201848,"journal":{"name":"2018 IEEE Global Communications Conference (GLOBECOM)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133604784","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}
Zhe Wang, Yu Zheng, Michael Jigo, Taosheng Liu, Jian Ren, Zhi Tian, Tongtong Li
{"title":"Decoding Behavioral Accuracy in an Attention Task Using Brain fMRI Data","authors":"Zhe Wang, Yu Zheng, Michael Jigo, Taosheng Liu, Jian Ren, Zhi Tian, Tongtong Li","doi":"10.1109/GLOCOM.2018.8647356","DOIUrl":"https://doi.org/10.1109/GLOCOM.2018.8647356","url":null,"abstract":"In this paper, we investigate whether we can distinguish that a subject is making a correct or incorrect behavioral response by analyzing the fMRI data of localized brain regions, obtained from a feature-based attention experiment. For each subject, we first construct the feature vectors for each region of interest (including V1, MT or IPS1) from the fMRI signals. Second, we project the feature vectors onto a lower dimensional subspace using Linear Discriminant Analysis (LDA), where the difference between two classes (correct vs. incorrect response) is maximized. Finally, we apply the Bayesian classifier to the projected data, and find that the classification accuracies corresponding to V1, MT and IPS1 are $87.2%$, $90.8%$ and $81.7%$, respectively, when all the trials are considered. Our analysis indicates that: when people make correct or incorrect responses, significant difference exists in the fMRI signals, especially in V1 and MT regions, and the difference can be effectively captured by the LDA-Bayesian classifier. We also prove that: when the original data are normally distributed, LDA, which aims to maximize the difference between different classes, is equivalent to the optimal Maximum Likelihood (ML) based classification method.","PeriodicalId":201848,"journal":{"name":"2018 IEEE Global Communications Conference (GLOBECOM)","volume":"25 1-3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133106162","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}
Jingxian Liu, Ke Xiong, Yang Lu, Pingyi Fan, Duohua Wang, Z. Zhong
{"title":"SWIPT-Enabled NOMA Networks with Full-Duplex Relaying","authors":"Jingxian Liu, Ke Xiong, Yang Lu, Pingyi Fan, Duohua Wang, Z. Zhong","doi":"10.1109/GLOCOM.2018.8647987","DOIUrl":"https://doi.org/10.1109/GLOCOM.2018.8647987","url":null,"abstract":"This paper investigates a simultaneous wireless information and power transfer (SWIPT)-enabled non- orthogonal multiple access (NOMA) network with full- duplex (FD) relaying, where a multi-antenna source transmits information to two users. The nearby user is with multiple antennas, which receives its own information and harvests energy from the signals transmitted by the source and also help forward information to the far-end user. For such a system, an optimization problem is formulated to minimize the required transmit power by jointly optimizing beamforming vectors and power splitting (PS) ratio under the energy harvesting and users' data rate constraints of both users. As the problem is non- convex with unknown solution, a bilevel- optimization method is proposed to solve it via semidefinite relaxation (SDR) and the global optimal solution is achieved with perfect self- interference cancellation. However, since self- interference may not be cancelled perfectly in practice, a successive convex approximation (SCA) based algorithm with low complexity is proposed to obtain a near optimal solution. Numerical results show that integrating NOMA, FD relaying and SWIPT in a single communication system is able to greatly reduce the required transmit power. Besides, the effects of the parameters including the data rate threshold and the energy storage amounts, on the system performance are also discussed.","PeriodicalId":201848,"journal":{"name":"2018 IEEE Global Communications Conference (GLOBECOM)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126583189","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}
Abdallah Moubayed, M. Injadat, A. Shami, H. Lutfiyya
{"title":"DNS Typo-Squatting Domain Detection: A Data Analytics & Machine Learning Based Approach","authors":"Abdallah Moubayed, M. Injadat, A. Shami, H. Lutfiyya","doi":"10.1109/GLOCOM.2018.8647679","DOIUrl":"https://doi.org/10.1109/GLOCOM.2018.8647679","url":null,"abstract":"Domain Name System (DNS) is a crucial component of current IP-based networks as it is the standard mechanism for name to IP resolution. However, due to its lack of data integrity and origin authentication processes, it is vulnerable to a variety of attacks. One such attack is Typosquatting. Detecting this attack is particularly important as it can be a threat to corporate secrets and can be used to steal information or commit fraud. In this paper, a machine learning-based approach is proposed to tackle the typosquatting vulnerability. To that end, exploratory data analytics is first used to better understand the trends observed in eight domain name-based extracted features. Furthermore, a majority voting-based ensemble learning classifier built using five classification algorithms is proposed that can detect suspicious domains with high accuracy. Moreover, the observed trends are validated by studying the same features in an unlabeled dataset using K-means clustering algorithm and through applying the developed ensemble learning classifier. Results show that legitimate domains have a smaller domain name length and fewer unique characters. Moreover, the developed ensemble learning classifier performs better in terms of accuracy, precision, and F-score. Furthermore, it is shown that similar trends are observed when clustering is used. However, the number of domains identified as potentially suspicious is high. Hence, the ensemble learning classifier is applied with results showing that the number of domains identified as potentially suspicious is reduced by almost a factor of five while still maintaining the same trends in terms of features' statistics.","PeriodicalId":201848,"journal":{"name":"2018 IEEE Global Communications Conference (GLOBECOM)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128899503","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}