2019 IEEE Global Communications Conference (GLOBECOM)最新文献_第10页

Cloud Database Encryption Technology Based on Combinatorial Encryption 基于组合加密的云数据库加密技术

2019 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2019-12-01 DOI: 10.1109/GLOBECOM38437.2019.9013204

Meng-yue Chen, Xiao Fu, B. Luo, Xiaojiang Du, M. Guizani

引用次数: 1

Max-Min Secrecy Rate for NOMA-Based UAV-Assisted Communications with Protected Zone 带保护区域的基于noma的无人机辅助通信的最大最小保密率

2019 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2019-12-01 DOI: 10.1109/GLOBECOM38437.2019.9013815

Zhisheng Yin, Min Jia, Wei Wang, Nan Cheng, Feng Lyu, Xuemin Shen

{"title":"Max-Min Secrecy Rate for NOMA-Based UAV-Assisted Communications with Protected Zone","authors":"Zhisheng Yin, Min Jia, Wei Wang, Nan Cheng, Feng Lyu, Xuemin Shen","doi":"10.1109/GLOBECOM38437.2019.9013815","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9013815","url":null,"abstract":"In this paper, we study the secrecy provisioning downlink transmission in an aerial-assisted network, where the unmanned aerial vehicle (UAV) serves as an aerial platform to provide secure transmission for the mobile users (MUs) with coexist of Internet of Things (IoT) nodes (INs). Specifically, secure transmission is required for MUs to combat eavesdropping attacks and a desired successful transmission probability should be ensured for INs to receive the public instruction massages. To improve the secrecy rates (SRs) for MUs, we consider an eavesdropper-free area, i.e., protected zone, surrounding the UAV. With non-orthogonal multiple access (NOMA) for MUs, the power allocation to each MU is optimized to maximize the minimum secrecy rate of MUs within the protected zone, under the constraints of successful receiving probability requirements for INs. To solve this problem, we first prove that the max-min SR can be obtained when SRs of all users are equal, and then a dichotomy-based successive power allocation policy is proposed. Numerical results show that higher max-min secrecy rate can be achieved by our proposed power allocation policy than the traditional policy.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"16 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":"91104600","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}

引用次数: 7

Physical Layer Security in Multiuser VLC Systems with a Randomly Located Eavesdropper 具有随机窃听器的多用户VLC系统的物理层安全性

2019 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2019-12-01 DOI: 10.1109/GLOBECOM38437.2019.9013592

Sunghwan Cho, Gaojie Chen, J. Coon

引用次数: 5

A Robust Network Traffic Modeling Approach to Software Defined Networking 软件定义网络的鲁棒网络流量建模方法

2019 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2019-12-01 DOI: 10.1109/GLOBECOM38437.2019.9013538

Liuwei Huo, Dingde Jiang, H. Song

{"title":"A Robust Network Traffic Modeling Approach to Software Defined Networking","authors":"Liuwei Huo, Dingde Jiang, H. Song","doi":"10.1109/GLOBECOM38437.2019.9013538","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9013538","url":null,"abstract":"Software Defined Networking (SDN) architecture satisfies the flexibility and scalability requirements of Internet of Things (IoT) network. A large amounts of IoT data is transmitted and exchanged through IoT network. However, many of services of IoT are sensitive to latency and bandwidth, so the network traffic model and measurement in IoT are different legacy networks. In this paper, we propose a robust network traffic modeling approach and use it to estimate network traffic in IoT. To obtain the measurement results with low overhead and high accuracy, we model the network traffic as liner function with noise. Then, we collect the statistics of coarse-grained traffic of flows and fine-grained traffic of links, and use the robust network traffic model to forecast the network traffic with the coarse-grained measurement of flows. In order to optimize the estimation results, we propose an optimization function to decrease the estimation errors. Since the optimization function is NP-hard problem, then we use a heuristic algorithm to obtain the optimal solution of the fine-grained measurement. Finally, we conduct some simulations to verify the proposed measurement scheme. Simulation results show that our approach is feasible and effective.","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":"89828179","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}

引用次数: 0

Multi-Agent Deep Reinforcement Learning Based User Association for Dense mmWave Networks 基于多智能体深度强化学习的密集毫米波网络用户关联

2019 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2019-12-01 DOI: 10.1109/GLOBECOM38437.2019.9013751

Mohamed Sana, A. Domenico, E. Strinati

引用次数: 12

Cooperative Detection for Ambient Backscatter Assisted Generalized Spatial Modulation 环境后向散射辅助广义空间调制的协同检测

2019 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2019-12-01 DOI: 10.1109/GLOBECOM38437.2019.9014316

Zhe Ma, F. Gao, Jing Jiang, Ying-Chang Liang

引用次数: 5

AZUPT: Adaptive Zero Velocity Update Based on Neural Networks for Pedestrian Tracking 基于神经网络的行人跟踪自适应零速度更新

2019 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2019-12-01 DOI: 10.1109/GLOBECOM38437.2019.9014070

Xinguo Yu, Ben Liu, Xinyue Lan, Zhuoling Xiao, Shuisheng Lin, Bo Yan, Liang Zhou

引用次数: 11

An Efficient Method to Monitor Downlink Traffic for 4G and 5G Networks 一种监控4G和5G网络下行流量的有效方法

2019 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2019-12-01 DOI: 10.1109/GLOBECOM38437.2019.9013377

T. Ban, Alankrita Bhatt, Young-Han Kim

{"title":"An Efficient Method to Monitor Downlink Traffic for 4G and 5G Networks","authors":"T. Ban, Alankrita Bhatt, Young-Han Kim","doi":"10.1109/GLOBECOM38437.2019.9013377","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9013377","url":null,"abstract":"This paper proposes a new scheme that allows the measurement of traffic loads of radio networks by decoding some information about the cell, such as downlink control information (DCI) broadcast on the physical downlink control channel (PDCCH). In the proposed scheme, a client decodes the entire DCI for all user equipments (UEs) with ongoing connections in a cell and extracts some information about the cell, such as the number of active UEs, the number of radio resources occupied, as well as the modulation and coding scheme used by each UE. Based on this information, mobile network carriers can measure exact traffic loads of cells preemptively without affecting ongoing connections. Contrary to an exhaustive searching scheme that attempts to decode DCI with all radio network temporary identifiers (RNTIs), the proposed scheme derives a small set of valid RNTIs by using an inverse function and attempts to decode DCI only with the valid RNTIs instead of the entire set of RNTIs. This reduction enables the client to recover the correct DCI with marginal computational complexity, which allows for real-time decoding of DCI. The simulation results show that the proposed scheme can significantly reduce the complexity required to decode the entire DCI in a cell, compared to the exhaustive searching scheme.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"5 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":"90879242","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}

引用次数: 0

Rate Maximization with Reinforcement Learning for Time-Varying Energy Harvesting Broadcast Channels 时变能量采集广播信道的强化学习速率最大化

2019 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2019-12-01 DOI: 10.1109/GLOBECOM38437.2019.9013583

Heasung Kim, W. Shin, Heecheol Yang, Nayoung Lee, Jungwoo Lee

{"title":"Rate Maximization with Reinforcement Learning for Time-Varying Energy Harvesting Broadcast Channels","authors":"Heasung Kim, W. Shin, Heecheol Yang, Nayoung Lee, Jungwoo Lee","doi":"10.1109/GLOBECOM38437.2019.9013583","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9013583","url":null,"abstract":"In this paper, we consider a power allocation optimization technique for a time-varying fading broadcast channel in energy harvesting communication systems, in which a transmitter with a rechargeable battery transmits messages to receivers using the harvested energy. We first prove that the optimal online power allocation policy for the sum rate maximization of the transmitter is an increasing function of harvested energy, remaining battery, and each user's channel gain. We then construct an appropriate neural network by relying on increasing behavior of the optimal policy. This two-step approach, by using an effective function approximation as well as providing a fundamental guideline for neural network design, can prevent us from wasting the representational capacity of neural networks. On the basis of the neural network, we apply the policy gradient method to solve the power allocation problem. To validate the performance of our approach, we compare it with the closed-form the optimal policy in a partially observable Markov problem. Through further experiments, it is observed that our online solution achieves a performance close to the theoretical upper bound of the performance in a time-varying fading broadcast channel.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"45 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":"90962364","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}

引用次数: 5

Incentive Mechanism and Relay Selection for D2D Relaying in Cellular Networks 蜂窝网络中D2D中继的激励机制与中继选择

2019 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2019-12-01 DOI: 10.1109/GLOBECOM38437.2019.9013205

P. Mach, Zdenek Becvar, T. Spyropoulos

引用次数: 5