2019 IEEE Global Communications Conference (GLOBECOM)最新文献

{"title":"Converged Analog Fiber-Wireless Point-to-Multipoint Architecture for eCPRI 5G Fronthaul Networks","authors":"G. Kalfas, N. Pleros, M. Agus, A. Pagano, L. Neto, A. Mesodiakaki, C. Vagionas, J. Vardakas, Eftychia G. Datsika, C. Verikoukis","doi":"10.1109/GLOBECOM38437.2019.9013123","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9013123","url":null,"abstract":"5G New Radio's (NR) spectrum expansion towards higher bands, although critical towards achieving the envisioned 5G capacity requirements, creates the need for installing a very large number of Access Points (APs), which asserts tremendous capital burden on the Mobile Network Operators. Current centralization solutions such as the Cloud Radio Access Network (C-RAN) alleviate partially the costs of densification by moving the majority of radio processing functionalities from the Remote Radio Heads (RRHs) to the central Base Band Unit (BBU), but still require very high-speed Point-to-Point links between the BBU and each RRH mainly due to the digitized Common Public Radio Interface (CPRI) that is excessively inefficient for hauling broadband signals. In this article, we present a novel architecture that employs an analog converged Fiber-Wireless scheme in order to create a very spectrally efficient Point-to-Multipoint network capable of interconnecting a large number of APs, while allowing compatibility with mature Ethernet-based low-cost equipment. Preliminary simulation results show very low end-to-end Ethernet packet delay, well below eCPRI's 100 μs mark, even for fiber lengths up to 10 km, indicating the suitability of our solution for employment in 5G NR large-scale fronthaul networks.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"5 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":"74247411","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":"Model-Free Based Automated Trajectory Optimization for UAVs toward Data Transmission","authors":"Jingjing Cui, Z. Ding, Yansha Deng, A. Nallanathan","doi":"10.1109/GLOBECOM38437.2019.9013644","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9013644","url":null,"abstract":"In this paper, we consider an unmanned aerial vehicle (UAV) enabled wireless network with a set of ground devices that are randomly distributed in an area and each having a certain amount of data for transmission. The UAV flies over this region from a starting point to a destination. During its flight, the UAV wants to communicate to the ground devices for maximizing the cumulative collected data by optimizing the trajectory of the UAV subject to its flight time constraint. Due to uncertainty in the locations of the ground devices and the communication dynamics, an accurate system model is difficult to acquire and maintain. With the help of stochastic modelling, we present a reinforcement learning based automated trajectory optimization algorithm. By dividing the considered region into small grids with finite state space and action space, we apply the Q-learning based automated trajectory optimization approach for maximizing the cumulative collected data during its flight time. Simulation results demonstrate that the reinforcement learning approach can find an optimal strategy under the flight time constraint.","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":"78597097","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":"A Key Management Protocol for Secure Device-to-Device Communication in the Internet of Things","authors":"Mohamed Ali Kandi, Hicham Lakhlef, A. Bouabdallah, Y. Challal","doi":"10.1109/GLOBECOM38437.2019.9013595","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9013595","url":null,"abstract":"The Internet of Things (IoT) is a network made up of a large number of devices which are able to automatically communicate in a Peer-to-Peer manner. The aim is to provide various services for the benefit of society. One of the main challenges facing the IoT is how to secure this Device-to-Device communication. Among all the security issues, the Key Management is one of the most difficult. This is mainly due to the fact that most of these devices have limited resources in terms of storage, calculation, communication and energy. Although different approaches have been proposed to deal with this problem, each of them presents its own limitations and weaknesses. In this paper, we propose a novel Key Management protocol for Device-to-Device communication in the Internet of Things. Compared to the existing Peer-to- Peer schemes, our solution provides the best compromise between the IoT requirements: resilience, connectivity, efficiency, scalability and flexibility. To achieve this balance, the network members are uniformly distributed into logical sets. A device shares then a distinct pairwise key with each member of its set and a unique pairwise set key with the members of each of the other sets. We then prove that our solution is resilient as the capture of a member compromises a negligible part of a large network. Moreover, we show that our scheme has a good network connectivity. It is then efficient as it does not require additional calculation or communication costs on the network members. We also demonstrate that our protocol is scalable as storage cost on the network members does not significantly increase when the network gets larger. We finally show that our solution is flexible.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"47 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":"78220906","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":"Optimum Energy Efficiency and Area Spectral Efficiency Tradeoff in User-Centric Ultra-Dense Networks","authors":"D. Hu, Jingxian Wu","doi":"10.1109/GLOBECOM38437.2019.9013416","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9013416","url":null,"abstract":"The objective of this paper is to theoretically identify the optimum tradeoff between energy efficiency (EE) and area spectral efficiency (ASE) of a user-centric ultra-dense network (UC-UDN). In a UC-UDN, there are more remote access points (RAPs) than user equipments (UEs). Each UE is served by its closest RAP, and the RAPs that are not associated with any UE are put in sleeping mode. The RAPs and UEs are assumed to form independent homogeneous Poisson point process (PPP). Increasing RAP density can in general improve ASE due to shorter transmission distance, but usually at the cost of EE due to stronger mutual interference and higher energy consumption. Thus it is critical to identify the optimum RAP density that can achieve the optimum EE-ASE tradeoff. We tackle this problem by analytically solving an optimization problem that aims at maximizing the EE under the constraint of minimum achievable ASE. The solution to the problem provides a closed-form expression of the RAP density that can achieve the optimum EE-ASE tradeoff.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"50 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78413045","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":"Exploiting CSI-MIMO for Accurate and Efficient Device Identification","authors":"Laxima Niure Kandel, Zhuosheng Zhang, Shucheng Yu","doi":"10.1109/GLOBECOM38437.2019.9014191","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9014191","url":null,"abstract":"Due to the inherent broadcast nature of the wireless medium, Wireless Local Area Networks (WLANs) are targets of a variety of malicious attacks, for example, MAC identity spoofing, rogue AP attack, and network freeloading. These attacks invite security and privacy threats and hinder the worry-free deployment of WLAN networks. To thwart these attacks, existing research has proposed to use hardware-specific imperfections as a unique unforgeable fingerprint for the APs and/or clients. Unfortunately, existing solutions are limited to static and stable environments or use customized hardware preventing their wide-scale adoption. To overcome the limitations, in this work, we propose to use the distribution of relative phase differences between MIMO-radio transmitter oscillators as a distinguishing trait or fingerprint. More specifically, we show that the nonidealities of the multiple RF chains on a single MIMO-OFDM (Multiple Input Multiple Output-Orthogonal Frequency Division Multiplexing) transmitter can be extracted and utilized as a reliable device fingerprint. Each transmitter RF chain has a random initial phase offset, and their difference relative to one another is stable over time, differs uniquely for each transmitter device and cannot be altered by the adversary without significant effort and cost. Our functional prototype measures these unknown phase differences using PHY-layer Channel State Information (CSI) of the in-band channel obtained from off-the-shelf hardware. Our design eliminates expensive custom-built hardware, is invariant to environmental variations and supports device mobility making it practical and deployable in real indoor settings. Experimental evaluation using 17 Intel Network Interface Cards (NICs) resulted in 97 % and 92 % device identification accuracy for static and mobile device states respectively. Such promising results with identical model and manufacturer devices wherein underlying manufacturing variations are typically low showcase the effectiveness of our design and suggest even higher accuracy across multi-model and multi-manufacturer cards because of the higher manufacturing variations.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"53 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":"75957663","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":"Blockchain-Enabled Dynamic Spectrum Access: Cooperative Spectrum Sensing, Access and Mining","authors":"Yiyang Pei, Shisheng Hu, Feng Zhong, D. Niyato, Ying-Chang Liang","doi":"10.1109/GLOBECOM38437.2019.9013210","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9013210","url":null,"abstract":"Traditionally, dynamic spectrum access (DSA) based on cooperative spectrum sensing relies on a centralized fusion centre to fuse and store the sensing results, which is vulnerable to single point of failure. In this paper, we propose a sensing-based DSA framework which is enabled by blockchain. The proposed DSA framework includes a protocol that specifies a time-slotted-based five-phase operations. In the proposed framework, each secondary user (SU) acts as both a sensing node for cooperatively sensing the spectrum and a node, i.e., a miner and a verifier, in the blockchain network for mining and updating the sensing and access results in a distributed and secure manner without the need for a fusion centre. In order to incentivize SUs for participating in such energy-consuming operations of the blockchain network, we reward them with tokens for sensing and mining, which can be used to bid for the access to the spectrum opportunities. The sensing and mining policies which they use to determine when to sense and mine affect the number of tokens they can obtain and subsequently how they bid for the spectrum. Hence, the performance of the system depends on their sensing-access-mining policy. Therefore, we consider a heuristic sensing- access-mining policy that determines whether to participate in sensing and mining in a probabilistic manner and that determines how much to bid based on its buffer occupancy and the number of available tokens. Simulation results show that although increasing sensing and mining probabilities can increase average transmission rate, it also leads to higher energy consumption. Moreover, there exists an optimal set of sensing and mining probabilities that maximize the system energy efficiency.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"28 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":"75088380","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":"Stackelberg Differential Game Based Resource Sharing in Hierarchical Fog-Cloud Computing","authors":"Jun Du, Chunxiao Jiang, A. Benslimane, Song Guo, Yong Ren","doi":"10.1109/GLOBECOM38437.2019.9013966","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9013966","url":null,"abstract":"The tremendous increase of computation-heavy applications has posed great challenges in terms of enhanced service coverage and high-speed data processing in the Fifth Generation (5G) networks. As responding, the integrated fog and cloud computing (FCC) system has been expected as an efficient approach to support low-latency and on-demand computing services. This work considers the computing resource market in an FCC system operated by one cloud computing service provider (CCP) and multiple fog computing service providers (FCPs), in which the CCP shares its cloud computing resource among FCPs and itself to serve users with computational tasks. To facilitate the resource trading between the CCP and FCPs, a Stackelberg differential game based resource sharing mechanism is proposed. In this mechanism, performance discrepancy is introduced as a penalty factor to denote the mismatch between the resource supply and demand, which will encourage all computing providers (CPs) to make their trading decisions that can truthfully reflect their resource capacity and requirements. In addition, an evolutionary game based replicator dynamics is established to analyze the users' service selection among CPs. Based on the established hierarchical game framework, interactions between user selection and computing resource sharing are investigated. The performance of the designed resource sharing mechanism is validated in the simulations, which also reveal the convergence and equilibrium states of user selection, resource pricing and resource allocation.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"354 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":"76485656","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":"Long-Term Contract Design for Traffic Off-Loading in Heterogeneous Cloud Radio Access Networks","authors":"Min Wang, Biling Zhang, Jung-Lang Yu, Zhu Han","doi":"10.1109/GLOBECOM38437.2019.9013414","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9013414","url":null,"abstract":"In order to improve the energy efficiency of the heterogeneous cloud radio access networks (H-CRANs), it is a promising approach to shutting off the small base stations (SBSs) with low traffic load and offload the traffic to the active SBSs nearby. Due to the selfish nature of the SBSs, the nearby SBSs may not cooperate if there is not appropriate incentive. On the other hand, since a user will be served by a SBS for a period of time, during which the SBS's offloading ability, i.e., its own traffic load and the offloading channel conditions, may vary dramatically. In such a case, how to provide proper long-term incentives for the potential SBSs to take over the traffic is an essential issue, especially when these SBSs belong to different service providers. Considering the SBS's offloading ability is the privat information that is unknown to the shutting off SBS, in this paper, the SBSs' cooperation stimulation problem is formulated as a long-term contract design problem, where the shutting off SBS acts as the principal and the offloading SBSs are the agents. A contract-theoretic framework based on the Markov decision process is formulated to study the long-term utilities of both parties. Through theoretical analysis, the feasible conditions for the optimal solution are described. Finally, the optimal contract is obtained through the proposed algorithm, and simulation results validate the effectiveness of our proposed long-term contract-based incentive mechanism for traffic offloading in H-CRANs.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"138 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":"78034279","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":"On the Capacity of Block Fading Optical Wireless Channels","authors":"Longguang Li, S. M. Moser, Ligong Wang, M. Wigger","doi":"10.1109/GLOBECOM38437.2019.9013614","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9013614","url":null,"abstract":"This paper investigates the capacity of block fading optical intensity channels with more transmit than receive antennas under different assumptions on the transmitter’s channel state information (CSI). Lower and upper bounds on the capacities are derived using the entropy power inequality (EPI) and a dual expression for capacity. Our lower bounds for perfect and partial CSI utilize a transmit-antenna cooperation strategy based on minimum-energy signaling, which we proposed recently. For perfect CSI, this lower bound matches the upper bound asymptotically in the high signal-to-noise ratio (SNR) regime. For imperfect CSI, our lower bound is close to its perfect-CSI counterpart.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"4577 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":"78172445","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":"Secure Semantic Interoperability for IoT Applications with Linked Data","authors":"George Hatzivasilis, Lukasz Ciechomski, Othonas Soultatos, Darko Anicic, A. Bröring, Konstantinos Fysarakis, G. Spanoudakis, Eftychia Lakka, S. Ioannidis, M. Falchetto","doi":"10.1109/GLOBECOM38437.2019.9013147","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9013147","url":null,"abstract":"Interoperability stands for the capacity of a system to interact with the units of another entity. Although it is quite easy to accomplish this within the products of the same brand, it is not facile to provide compatibility for the whole spectrum of the Internet-of-Things (IoT) and the Linked Data (LD) world. Currently, the different applications and devices operate in their own cloud/platform, without supporting sufficient interaction with different vendor-products. As it concerns the meaning of data, which is the main focus of this paper, semantics can settle commonly agreed information models and ontologies for the used terms. However, as there are several ontologies for describing each distinct 'Thing', we need Semantic Mediators (SMs) in order to perform common data mapping across the various utilized formats (i.e. XML or JSON) and ontology alignment (e.g. resolve conflicts). Our goal is to enable end-to-end vertical compatibility and horizontal cooperation at all levels (field/network/backend). Moreover, the implication of security must be taken into consideration as the unsafe adoption of semantic technologies exposes the linking data and the user's privacy, issues that are neglected by the majority of the semantic-web studies. A motivating example of smart sensing is described along with a preliminary implementation on real heterogeneous devices. Two different IoT platforms are integrating in the case study, detailing the main SM features. The proposed setting is secure, scalable, and the overall overhead is sufficient for runtime operation, while providing significant advances over state-of-the-art solutions.","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":"79751238","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}