{"title":"UAV-Assisted Data Dissemination with Proactive Caching and File Sharing in V2X Networks","authors":"Rui Lu, Rongqing Zhang, Xiang Cheng, Liuqing Yang","doi":"10.1109/GLOBECOM38437.2019.9013226","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9013226","url":null,"abstract":"Vehicle-to-Everything (V2X) communications refers to an intelligent and connected vehicular network where all vehicles and infrastructure systems are interconnected with each other. Data dissemination is playing an increasingly significant role in enhancing the network connectivity and data transmission performance. However, conventional scenarios and protocols cannot satisfy the growing pluralistic and superior quality of services (QoS) requirements of included vehicles. Therefore, in this paper, we propose a novel unmanned aerial vehicle (UAV)-assisted data dissemination protocol with proactive caching at the vehicles and an advanced file sharing strategy for revolutionizing communications. Specifically, in the proactive caching phase, we employ UAVs to act as flying base stations (BSs) for information interactions. Considering the time-variant network topology, we further propose a spatial scheduling (SS) algorithm for the trajectory optimization of each UAV, which can expedite the caching process and boost the system throughput. Then in the file sharing phase, based on the previous caching status, we provide a relay ordering algorithm to enhance the network transmission performance. Numerical results verify that our proposed UAV-assisted data transmission protocol can achieve a desirable system performance in terms of the downloading process, network throughput, and average data delivery delay.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"41 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":"78790174","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}
Safae Lhazmir, Omar Ait Oualhaj, A. Kobbane, J. Ben-othman
{"title":"UAV for Energy-Efficient IoT Communications: Matching Game Approach","authors":"Safae Lhazmir, Omar Ait Oualhaj, A. Kobbane, J. Ben-othman","doi":"10.1109/GLOBECOM38437.2019.9013200","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9013200","url":null,"abstract":"Unmanned aerial vehicles (UAVs) are a promising technology to provide an energy-efficient and cost-effective solution for data collection from the ground Internet of Things (IoT) devices. In this paper, the optimal associations that provide reliable connections between UAVs and IoT devices are investigated. We aim at maximizing the IoT devices' benefits, by assigning them to most suitable UAVs. We formulate the problem as a many-to-one matching game where UAVs and IoT devices are the players. In this game, the players rank one another based on individual utility functions that capture their needs. Each IoT device aims to minimize its transmitting energy while meeting its SNR requirements and each UAV aims to maximize the number of served IoT devices while respecting its energy constraints. Simulation results show that the proposed approach provides a low average total transmit power, ensures fast data transmission and optimal utilization of the UAVs' bandwidth.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"94 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":"76318722","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}
Lu Cao, Zhiyao Tang, Liang Sun, Zhenni Pan, S. Shimamoto, Yong Feng
{"title":"Secrecy Performance Analysis for An-Aided Linear ZFBF in MU-MIMO Systems with Limited Feedback","authors":"Lu Cao, Zhiyao Tang, Liang Sun, Zhenni Pan, S. Shimamoto, Yong Feng","doi":"10.1109/GLOBECOM38437.2019.9014215","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9014215","url":null,"abstract":"Although there have been extensive works on artificial-noise-aided (AN-aided) secure transmission schemes for multi-antenna systems, there is still lack of study on the AN-aided scheme employing the widely used linear zero-forcing beamforming (ZFBF) for systems with multiple distributed users. Particularly, there is no analytical secrecy performance for general system settings with neither perfect nor imperfect channel state information of the legitimate users at the transmitter (CSIT). This paper considers the AN-aided ZFBF based on the quantized CSIT for secure communication in the downlink multiuser multi-antenna systems with an external multi-antenna eavesdropper. We develop an approximated closed-form lower bound on the ergodic rate of each legitimate user (LU), and also a closed-form upper bound on the maximum achievable ergodic rate for each LU's messages over the eavesdropper's channel without assuming any asymptotes for system parameters. Then, an approximated closed-form lower bound on the ergodic secrecy rate of each LU follows. Simulation results validate our analytical secrecy performance results and also the effectiveness of AN in enhancing the secrecy performance of linear ZFBF.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"580 2 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":"76319333","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":"Sentiment Analysis Using Naive Bayes Approach with Weighted Reviews - A Case Study","authors":"Brandon Joyce, Jing Deng","doi":"10.1109/GLOBECOM38437.2019.9013588","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9013588","url":null,"abstract":"Online reviews are critical in many aspects, for business as well as customers. Yet the accuracy and trustworthiness of these reviews are usually unsubstantiated and little research has been performed to investigate them. In this work, we use a set of Yelp reviews on various topics (food, hotel, etc.) as an example to perform sentiment analysis and investigate the correlation between review comment sentiment and its numeric rating. We use feature selection techniques to statistically remove redundant words from reviews, thus improving run time and accuracy. Our method gives higher weight to those terms/words appearing in reviews with more useful votes. These techniques combined with Naive Bayes approach achieves an overall accuracy of 75%. More interestingly, our method is shown to perform well in 1-star and 5-star reviews, with a 92% accuracy for the latter. With such a strong accuracy, we argue that the proposed sentiment analysis technique can be used to shed light on all online comments, especially those without numerical ratings.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"30 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":"76551207","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":"EM-Based ML Estimation of Fast Time-Varying Multipath Channels for SIMO OFDM Systems","authors":"Souheib Ben Amor, S. Affes, F. Bellili","doi":"10.1109/GLOBECOM38437.2019.9014338","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9014338","url":null,"abstract":"This paper investigates the problem of fast time-varying multipath channel estimation over single-input multiple-output orthogonal frequency-division multiplexing (SIMO OFDM)-type transmissions. We do so by tracking the variations of each complex gain coefficient using a polynomial-in-time expansion. To that end, we derive the log-likelihood function (LLF) in both the data-aided (DA) and non-data-aided (NDA) case. The DA ML estimates are found in closed-form expressions and then used to initialize the expectation maximization (EM) algorithm that is used to iteratively maximize the LLF in the NDA case. We also introduce an alternative initialization procedure that requires less pilot symbols as compared to the DA ML-based solution without incurring a significant performance loss. Simulation results show that the proposed EM-based estimator converges within few iterations providing accurate estimates for all multipath gains, thereby resulting in significant BER gain as compared to the DA least square (LS) technique.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"2 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":"76566560","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":"Channel Model for Spiking Neural Networks Inspired by Impulse Radio MIMO Transmission","authors":"Y. Katayama","doi":"10.1109/GLOBECOM38437.2019.9013114","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9013114","url":null,"abstract":"In analogy with impulse radio counterpart in wireless communication, a channel model for spiking neural networks (SNNs) is proposed. The neuron channel model includes fanout and fanin with weighted sum in axons, synapses, and dendrites. It is based on a wireless channel model with multiple-input-multiple-output (MIMO) air and digital interfaces, but is orders of magnitude scaled down in size and the group velocity of signaling waves for broadcasting and superposition. The neuron channel matrix can flexibly encode weights and delays per synaptic connection to facilitate native processing of temporal SNNs by wave passive propagation dynamics over the physical media.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"66 3 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":"76035637","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":"Early-Late Protocol for Coordinated Beam Scheduling in mmWave Cellular Networks","authors":"Ziyuan Sha, Zhaocheng Wang, Sheng Chen, L. Hanzo","doi":"10.1109/GLOBECOM38437.2019.9013827","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9013827","url":null,"abstract":"As a benefit of using highly directional beams in millimeter wave systems, the downlink inter-cell interference (ICI) imposed on the users can be avoided, provided that the beams of neighbor cells do not point towards the user. We exploit this by designing a protocol for network-coordinated time- domain beam scheduling. Specifically, every pair of two neighbor cells maintains a beam collision table for recording the beam pairs that may inflict ICI upon each other. Then, to avoid beam-collision, the two neighbor cells exchange the necessary information to avoid the simultaneous activation of two beams recorded in one pair. More explicitly, our protocol supports a distributed cell coordination method without requiring any information exchanged between the user and the base station, once the beam collision table has been established. Furthermore, our theoretical analysis and numerical simulations demonstrate that the proposed protocol is capable of efficiently mitigating the ICI between the adjacent cells and hence improves the overall network performance.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"3 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":"87703114","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":"Loss-Aware Efficient Energy Balancing in Mobile Opportunistic Networks","authors":"Aashish Dhungana, E. Bulut","doi":"10.1109/GLOBECOM38437.2019.9014073","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9014073","url":null,"abstract":"Energy management is a challenging issue to be addressed in networks consisting of battery-powered devices. With the recently emerging wireless power transfer technology, many studies have utilized wireless charging to address this problem and provide energy ubiquitously to these devices for making them functional continuously. Besides the well- studied problems such as optimal scheduling of mobile chargers, recently an interesting problem of energy balancing among a population of mobile nodes has been considered to prolong the lifetime of the network through the opportunistic energy exchanges between the nodes. The state-of-the-art solutions target an energy balance among the devices as fast as possible but they waste energy due to the loss during peer-to-peer energy transfer. In this paper, we study the energy balancing problem that aims to minimize both the energy difference between nodes and the energy loss during this process. To this end, we propose three different energy sharing protocols between nodes based on different heuristics. Through simulations, we show that all the proposed algorithms show better performance than the state-of-the-art. The third proposed algorithm achieves the best performance by reaching an energy balance between nodes while keeping the maximum possible energy in the network (i.e., minimum loss).","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"14 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":"87831171","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":"Online Downlink MIMO Wireless Network Virtualization in Fading Environments","authors":"Juncheng Wang, Min Dong, B. Liang, G. Boudreau","doi":"10.1109/GLOBECOM38437.2019.9013124","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9013124","url":null,"abstract":"We consider downlink multiple-input multiple-output (MIMO) wireless network virtualization (WNV) in a fading environment, via a base station (BS) precoding design. The BS is owned by an infrastructure provider (InP) and is shared by several service providers (SPs) who are oblivious to each other. The SPs realize their virtual-cell transmissions via MIMO precoding provided by the InP. We aim to minimize the time-averaged expected deviation of the precoding provided by the InP from the SPs' virtualization demands, considering both long-term and short-term transmit power limits at the BS. We propose an online MIMO WNV algorithm to provide a precoding solution through Lyapunov optimization. Our online precoding solution only requires the current channel state information, and it has a semi-closed form with low computational complexity. We provide an upper bound on the performance of the proposed algorithm, showing that it can be arbitrarily close to the optimum over any given time horizon. Simulation results validate the performance of our proposed algorithm under typical urban micro-cell settings.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"40 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":"87885222","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}
Mohammed Anis Benblidia, B. Brik, M. Esseghir, L. Merghem
{"title":"Power Dispatching in Cloud Data Centers Using Smart Microgrids: A Game Theory Approach","authors":"Mohammed Anis Benblidia, B. Brik, M. Esseghir, L. Merghem","doi":"10.1109/GLOBECOM38437.2019.9013640","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9013640","url":null,"abstract":"The proliferation of cloud-based applications in smart systems has made the cloud data center a vital and critical part for ensuring a connected world. Due to their energy-hungry servers and huge power facilities, cloud data centers tend to consume a lot of power. In fact, the data centers use about 1.4% of all the power generated on the planet. On one hand, this has a negative impact on the power grid and may cause blackouts. On the other hand, it has a negative impact on the environment and it is mainly involved in global warming. Thus, one of the most important challenges in cloud data centers is power consumption minimization. In this paper, we propose a microgrid-cloud based architecture and study the grid power dispatching problem to cloud data centers. At first, we model the power quantity demand between the data centers and smart microgrids as a non-cooperative game, due to their non-cooperative power demands behavior. Then, we try to allocate the optimal quantity of power to each data center according to its green power consumption, network bandwidth usage and its network equipment power usage. Second, we formulate the game payoff function as a non-linear optimization problem and solve it using Lagrange multipliers and KarushKuhnTucker (KKT) conditions. Finally, we compare the performance of our approach with two power allocation algorithms and showed that our game is more effective and reduces power load with a rate of 40.5%. Furthermore, our scheme incites data centers to use green energy and significantly reduces dioxide carbon emission.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"13 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":"86994966","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}