2018 IEEE Globecom Workshops (GC Wkshps)最新文献

筛选
英文 中文
Joint User Access and Resource Association in Multicast Terrestrial-Satellite Cooperation Network 多播地星合作网络中的联合用户接入与资源关联
2018 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2018-12-01 DOI: 10.1109/GLOCOMW.2018.8644238
Yuandong Zhang, Xiangming Zhu, Chunxiao Jiang, L. Yin
{"title":"Joint User Access and Resource Association in Multicast Terrestrial-Satellite Cooperation Network","authors":"Yuandong Zhang, Xiangming Zhu, Chunxiao Jiang, L. Yin","doi":"10.1109/GLOCOMW.2018.8644238","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2018.8644238","url":null,"abstract":"In this paper, we investigate the problem of joint user access and resource allocation in the cooperative multicast terrestrial-satellite network. Considering the wide coverage of the satellite, hot spots are transmitted by the satellite using multicasting, while base stations mainly provide less-popular information for other users. For both the satellite and base stations, users that need the same content are divided into one group, and users can access both of the two networks according to their requirements. To maximize the network capacity, we formulate the joint user access and resource allocation problem under the scheduling and power constraints. By means of the successive convex approximation method, we finally obtain the optimal solution of the system. Simulation results show that our algorithm can increase the system capacity by more than 13 percent compared with the previous work.","PeriodicalId":348924,"journal":{"name":"2018 IEEE Globecom Workshops (GC Wkshps)","volume":"131 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":"116067689","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}
引用次数: 9
Experimental Evaluation of Multi-Antenna Receivers for UAV Communication in Live LTE Networks 实时LTE网络中无人机通信多天线接收机的实验评估
2018 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2018-12-01 DOI: 10.1109/GLOCOMW.2018.8644068
T. Izydorczyk, M. Bucur, Fernando M. L. Tavares, Gilberto Berardinelli, P. Mogensen
{"title":"Experimental Evaluation of Multi-Antenna Receivers for UAV Communication in Live LTE Networks","authors":"T. Izydorczyk, M. Bucur, Fernando M. L. Tavares, Gilberto Berardinelli, P. Mogensen","doi":"10.1109/GLOCOMW.2018.8644068","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2018.8644068","url":null,"abstract":"Unmanned Aerial Vehicle (UAV) communication is known to suffer from significant interference due to the clearance of the radio paths with ground base stations. Multi-antenna receive combining has the promise of alleviating the impact of interference, translating to improved connectivity performance. In this paper, we evaluate the performance of Conventional Beamforming (CB) and Maximum Ratio Combining (MRC) receivers for UAV communication based on live Long Term Evolution (LTE) networks. Our measurement setup consists of nine Universal Software Radio Peripheral (USRP) boards and a circular antenna array with sixteen elements. The LTE signals are recorded at different UAV flight heights in urban environments, and processed offline. Results show similar Signal-to-Interference-plus-Noise Ratio (SINR) performance by MRC and CB, with CB slightly outperforming MRC provided knowledge of LTE signal structure is used for the beam selection. No significant dependency from the flight height has been observed. The outage probability analysis further emphasizes the benefits of using CB in the studied scenarios.","PeriodicalId":348924,"journal":{"name":"2018 IEEE Globecom Workshops (GC Wkshps)","volume":"174 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":"116126787","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}
引用次数: 14
Energy-Efficient UAV Trajectory Planning for Data Collection and Computation in mMTC Networks 基于mMTC网络数据采集与计算的高能效无人机轨迹规划
2018 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2018-12-01 DOI: 10.1109/GLOCOMW.2018.8644379
Kaiyu Zhu, Xiaodong Xu, Shujun Han
{"title":"Energy-Efficient UAV Trajectory Planning for Data Collection and Computation in mMTC Networks","authors":"Kaiyu Zhu, Xiaodong Xu, Shujun Han","doi":"10.1109/GLOCOMW.2018.8644379","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2018.8644379","url":null,"abstract":"As one of the three main scenarios of 5G, massive machine-type communications (mMTC) is expected to play an essential role within future 5G system. Unmanned aerial vehicles (UAVs) also attracts more attentions these years. However, the limited battery of both MTC devices (MTCDs) and UAVs constrains the deployment. Besides, the limited computation capacity of MTCDs also impacts the network optimization in mMTC networks. In this paper, UAV-based aerial base station is deployed to collect data and provide computing service for MTCDs. We introduce a non-service-tolerant parameter and propose a hybrid hovering positions selection (HHPS) algorithm. The hovering positions of UAV with the minimum power consumption of MTCDs are selected. Furthermore, We propose a trajectory planning method based on Cuckoo Search (CS) algorithm. The energy consumption and the throughput of UAV, the latency of MTCD tasks and collecting and computing efficiency with different priorities are optimized. Simulations are carried out to illustrate that the proposed HHPS algorithm and trajectory planning algorithm have superior performances compared with existing works.","PeriodicalId":348924,"journal":{"name":"2018 IEEE Globecom Workshops (GC Wkshps)","volume":"75 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":"114993448","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}
引用次数: 24
Optimizing Geometry Compression Using Quantum Annealing 利用量子退火优化几何压缩
2018 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2018-12-01 DOI: 10.1109/GLOCOMW.2018.8644358
Sebastian Feld, Markus Friedrich, Claudia Linnhoff-Popien
{"title":"Optimizing Geometry Compression Using Quantum Annealing","authors":"Sebastian Feld, Markus Friedrich, Claudia Linnhoff-Popien","doi":"10.1109/GLOCOMW.2018.8644358","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2018.8644358","url":null,"abstract":"The compression of geometry data is an important aspect of bandwidth-efficient data transfer for distributed 3d computer vision applications. We propose a quantum-enabled lossy 3d point cloud compression pipeline based on the constructive solid geometry (CSG) model representation. Key parts of the pipeline are mapped to NP-complete problems for which an efficient Ising formulation suitable for the execution on a Quantum Annealer exists. We describe existing Ising formulations for the maximum clique search problem and the smallest exact cover problem, both of which are important building blocks of the proposed compression pipeline. Additionally, we discuss the properties of the overall pipeline regarding result optimality and described Ising formulations.","PeriodicalId":348924,"journal":{"name":"2018 IEEE Globecom Workshops (GC Wkshps)","volume":"2 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":"123439678","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}
引用次数: 6
How to Break IOTA Heart by Replaying? 如何通过重玩让IOTA心碎?
2018 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2018-12-01 DOI: 10.1109/GLOCOMW.2018.8644437
Gerard De Roode, Ikram Ullah, P. Havinga
{"title":"How to Break IOTA Heart by Replaying?","authors":"Gerard De Roode, Ikram Ullah, P. Havinga","doi":"10.1109/GLOCOMW.2018.8644437","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2018.8644437","url":null,"abstract":"IOTA is a novel cryptocurrency that uses distributed ledger technology based on directed acyclic graph data structure. Security of cryptocurrencies ought to be scrutinized in order to acquire esteemed security, attain trust, and accomplish indelible adoption. Although IOTA proffer resilient security controls, IOTA security is not yet well explored. Among all the propounded IOTA vulnerabilities that have been identified, we pragmatically exploit replay attack against IOTA. We further analyze the attack to perceive its impact. Attack methodology and proof of concept for the replay attack is presented. Our proposed exploitation methodology is based upon address reuse, while IOTA in default mode does not reuse addresses. Distrust, and privation of balance can be some of the severe impacts of this vulnerability.","PeriodicalId":348924,"journal":{"name":"2018 IEEE Globecom Workshops (GC Wkshps)","volume":"163 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":"123462789","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}
引用次数: 20
Machine Learning-Based Occupancy Estimation Using Multivariate Sensor Nodes 基于机器学习的多变量传感器节点占用估计
2018 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2018-12-01 DOI: 10.1109/GLOCOMW.2018.8644432
A. Singh, Vivek Jain, S. Chaudhari, F. Kraemer, Stefan Werner, V. Garg
{"title":"Machine Learning-Based Occupancy Estimation Using Multivariate Sensor Nodes","authors":"A. Singh, Vivek Jain, S. Chaudhari, F. Kraemer, Stefan Werner, V. Garg","doi":"10.1109/GLOCOMW.2018.8644432","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2018.8644432","url":null,"abstract":"In buildings, a large chunk of energy is spent on heating, ventilation and air conditioning systems. One way to optimize their usage is to make them demand-driven depending on human occupancy. This paper focuses on accurately estimating the number of occupants in a room by leveraging multiple heterogeneous sensor nodes and machine learning models. For this purpose, low-cost and non-intrusive sensors such as CO2, temperature, illumination, sound and motion were used. The sensor nodes were deployed in a room in a star configuration and measurements were recorded for a period of four days. A regression based method is proposed for calculating the slope of CO2, a new feature derived from real-time CO2 values. Supervised learning algorithms such as linear discriminant analysis (LDA), quadratic discriminant analysis (QDA), support vector machine (SVM) and random forest (RF) were used on several different combinations of feature sets. Moreover, multiple performance metrics such as accuracy, F1 score and confusion matrix were used to evaluate the performance of our models. Experimental results demonstrate a maximum accuracy of 98.4% and a high F1 score of 0.953 for estimating the number of occupants in the room. Principal component analysis (PCA) was also applied to evaluate the performance of a dataset with reduced dimensionality.","PeriodicalId":348924,"journal":{"name":"2018 IEEE Globecom Workshops (GC Wkshps)","volume":"9 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":"123738337","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}
引用次数: 16
Maximum Reuse Distance Scheduling for Cellular-V2X Sidelink Mode 3 基于蜂窝v2x副链路模式的最大复用距离调度
2018 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2018-12-01 DOI: 10.1109/GLOCOMW.2018.8644360
Giammarco Cecchini, A. Bazzi, Michele Menarini, B. Masini, A. Zanella
{"title":"Maximum Reuse Distance Scheduling for Cellular-V2X Sidelink Mode 3","authors":"Giammarco Cecchini, A. Bazzi, Michele Menarini, B. Masini, A. Zanella","doi":"10.1109/GLOCOMW.2018.8644360","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2018.8644360","url":null,"abstract":"Vehicle-to-everything (V2X) communication will be the key technology to improve safety on the road. In particular, the cooperative awareness service will give vehicles the capacity of being aware of the neighborhood through the periodic dissemination of beacon messages, carrying mobility information. Applications like these need a wireless technology able to provide high reliability and low latency. In this context, Cellular-V2X based on long term evolution (LTE) Release 14 is a promising candidate. Objective of this work is to focus on LTE Sidelink mode 3, where resources reserved to direct links are managed by the network and to propose a resource scheduling algorithm based on the knowledge, with different levels of accuracy, of the positions of the vehicles at the network side. Through simulations, carried out in realistic highway and urban scenarios, we compare the proposed solution with a benchmark algorithm based on the concept of reuse distance and we demonstrate that the new solution, other than always offering the highest performance in terms of packet reception ratio and latency, does not require the fine tuning of any parameter.","PeriodicalId":348924,"journal":{"name":"2018 IEEE Globecom Workshops (GC Wkshps)","volume":"41 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":"122938890","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}
引用次数: 11
A Secure Remote Healthcare System for Hospital Using Blockchain Smart Contract 基于区块链智能合约的医院安全远程医疗系统
2018 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2018-12-01 DOI: 10.1109/GLOCOMW.2018.8644164
H. Pham, T. Tran, Y. Nakashima
{"title":"A Secure Remote Healthcare System for Hospital Using Blockchain Smart Contract","authors":"H. Pham, T. Tran, Y. Nakashima","doi":"10.1109/GLOCOMW.2018.8644164","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2018.8644164","url":null,"abstract":"Nowadays, a combination between Internet of Things (IoT) technology and remote healthcare system is extensively researched due to its efficiency and convenience for human life. When the number of IoT devices in health care system is increased exponentially, the privacy and security issues of patients are becoming a concern. In order to protect personal and device-generated information, we propose to use blockchain-based smart contracts for managing patients' information and medical devices. In detail, using blockchain based on the Ethereum protocol, we create a remote healthcare system including healthcare provider (such as hospital), healthcare professionals (doctors) and patients. Health condition of patients is measured by sensors and such information is written into blockchain automatically. In addition, we propose a processing mechanism to store the medical device information efficiently and sparingly in accordance with health situation of patient. Concretely, we filter the data from sensors before deciding whether to write data into blockchain or not. Doing so we can reduce the size of blockchain as well as save amount of coins for transaction efficiently. However, the abnormal data from sensors will be written to blockchain immediately and trigger an emergency contact to doctor and hospital for on-time treatment. We have verified the proposed smart contract on Ethereum test environment called TESTRPC and implemented the system on an experimental environment with real devices. This system works well at small scale.","PeriodicalId":348924,"journal":{"name":"2018 IEEE Globecom Workshops (GC Wkshps)","volume":"47 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":"125399719","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}
引用次数: 67
Monte-Carlo Tree Search Aided Contextual Online Learning Approach for Wireless Caching 蒙特卡罗树搜索辅助无线缓存上下文在线学习方法
2018 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2018-12-01 DOI: 10.1109/GLOCOMW.2018.8644489
Yang Du, Pengyu Gao, Xiaodong Wang, Binhong Dong, Zhi Chen, Shaoqian Li
{"title":"Monte-Carlo Tree Search Aided Contextual Online Learning Approach for Wireless Caching","authors":"Yang Du, Pengyu Gao, Xiaodong Wang, Binhong Dong, Zhi Chen, Shaoqian Li","doi":"10.1109/GLOCOMW.2018.8644489","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2018.8644489","url":null,"abstract":"Caching popular contents at the edge of wireless networks has recently emerged as a promising technique to offload mobile data traffic and improve the quality of service for users. In the big-data era, the size of the content space is essentially infinite. Moreover, users with common features typically share similar content preference. In order to address these issues, we model the wireless caching problem as a contextual multi-armed bandit (CMAB) problem that considers the infinitely arms, and propose a Monte-Carlo tree search aided contextual upper confidence bound (MCTS-CUCB) algorithm, to make accurate content caching with low complexity. Specifically, we introduce a tree-based search method to analyze the content subspace instead of a single content, thereby reducing the computing load. In the search process, a cover tree is built in an incremental and asymmetric manner, which can reflect the users' content preference. Besides, contextualization allows to learn content preferences for groups of users having similar contexts, which significantly accelerates the learning process and improve the cache hit rate. Our simulation results on a real-world data set (MovieLens 1M Dataset) demonstrate that the proposed MCTS-CUCB algorithm is capable of achieving a considerable reduction in complexity compared with the existing related algorithms with a superior cache hit rate performance.","PeriodicalId":348924,"journal":{"name":"2018 IEEE Globecom Workshops (GC Wkshps)","volume":"30 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":"125550429","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}
引用次数: 6
Securing M2M Transmissions Using Nonreconciled Secret Keys Generated from Wireless Channels 使用无线信道生成的不协调密钥保护M2M传输
2018 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2018-12-01 DOI: 10.1109/GLOCOMW.2018.8644401
Linning Peng, Guyue Li, Junqing Zhang, A. Hu
{"title":"Securing M2M Transmissions Using Nonreconciled Secret Keys Generated from Wireless Channels","authors":"Linning Peng, Guyue Li, Junqing Zhang, A. Hu","doi":"10.1109/GLOCOMW.2018.8644401","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2018.8644401","url":null,"abstract":"Wireless secret key generation exploits unpredictable multi-path features from wireless channel to achieve high secure key bits. Most of the existing wireless secret key generation methods require information reconciliation process to correct discrepant key bits between the keying parties, which reveals information to the eavesdroppers and increases the system complexity. This paper introduces an integrated wireless secret key based transmission (WSKT) scheme for machine to machine (M2M) communications, using nonreconciled key bits generated from wireless channels without information reconciliation but sharing the error correction capability of channel coding. Polar code and stream encryption are employed to achieve secure communication. Extensive numerical simulations demonstrate that the proposed WSKT can achieve secure M2M communications which only causes a slight degradation on the system performance.","PeriodicalId":348924,"journal":{"name":"2018 IEEE Globecom Workshops (GC Wkshps)","volume":"9 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":"126312797","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}
引用次数: 10
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信