2018 IEEE Globecom Workshops (GC Wkshps)最新文献_第9页

Achieving Channel Reciprocity in Multi-Carrier System: SRS Carrier-Based Switching 在多载波系统中实现信道互易:SRS载波交换

2018 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2018-12-01 DOI: 10.1109/GLOCOMW.2018.8644114

Yiyan Zhang, He Wang, Xutao Zhou

{"title":"Achieving Channel Reciprocity in Multi-Carrier System: SRS Carrier-Based Switching","authors":"Yiyan Zhang, He Wang, Xutao Zhou","doi":"10.1109/GLOCOMW.2018.8644114","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2018.8644114","url":null,"abstract":"In the context of approaching next generation cellular network where increasing antennas are installed, link quality largely depends on channel information acquired at transceivers. Sounding Reference Signal (SRS) carrier-based Switching, an emerging technique developed starting from 3GPP Release-14 standards, enables SRS transmitted on non-SRS carriers to provide base station reciprocity-aided channel information; therefore it accomplishes better precoding selection for beamforming and becomes a critical role in multi-carrier aggregation system. In this article, we look into SRS Switching and present a comprehensive analysis for this technique. A standard-compatible and high-efficiency SRS Switching algorithm is proposed, and then implemented into a system-level simulator to evaluate the network performance in terms of downlink throughput. We extract the design principle from analyzing its own characteristics. Also, the rationales behind why the technique works are identified from the numerical results. More than an implementation of standardized technique, out algorithm can serve as precious basis for its practical realization and further evolution of standards. Compared with conventional SRS cases, the remarkable performance enhancement has revealed significant superiority of our proposal which suggests a bright prospect of this technique in next generation mobile wireless network.","PeriodicalId":348924,"journal":{"name":"2018 IEEE Globecom Workshops (GC Wkshps)","volume":"15 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":"127478029","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

Energy Efficient Resource Allocation in Multiuser DF Relay Interference Networks 多用户DF中继干扰网络中的节能资源分配

2018 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2018-12-01 DOI: 10.1109/GLOCOMW.2018.8644258

Bartosz Bossy, P. Kryszkiewicz, H. Bogucka

引用次数: 3

Secrecy Analysis for Spatially Random UAV Systems 空间随机无人机系统的保密性分析

2018 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2018-12-01 DOI: 10.1109/GLOCOMW.2018.8644132

Jia Ye, Chao Zhang, Gaofeng Pan, Yunfei Chen, Z. Ding

引用次数: 6

Finite Horizon Throughput Maximization for a Wirelessly Powered Device Over a Time Varying Channel 时变信道上无线供电设备的有限水平吞吐量最大化

2018 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2018-12-01 DOI: 10.1109/GLOCOMW.2018.8644442

Mehdi Salehi Heydar Abad, Özgür Erçetin

引用次数: 1

Intent-Based Real-Time 5G Cloud Service Provisioning 基于意图的实时5G云业务发放

2018 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2018-12-01 DOI: 10.1109/GLOCOMW.2018.8644457

Fred Aklamanu, S. Randriamasy, É. Renault, I. Latif, A. Hebbar

引用次数: 17

Learning to Schedule Resources in Software-Defined Radio Access Networks 学习软件定义无线接入网中的资源调度

2018 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2018-12-01 DOI: 10.1109/GLOCOMW.2018.8644407

Xianfu Chen

引用次数: 0

Channel Estimation and Symbol Detection for Communications on Overlapping Channels 重叠信道通信的信道估计与符号检测

2018 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2018-12-01 DOI: 10.1109/GLOCOMW.2018.8644453

M. Nguyen, L. Le

{"title":"Channel Estimation and Symbol Detection for Communications on Overlapping Channels","authors":"M. Nguyen, L. Le","doi":"10.1109/GLOCOMW.2018.8644453","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2018.8644453","url":null,"abstract":"In this paper, we investigate the joint channel estimation, interference cancellation and data detection problem for a general setting in which a desired communication is interfered by another communication having a different symbol rate and being asynchronous with the considered communication. The fast fading channel gains of the desired communication and the effective interference coefficients (EIC) induced by filters of the interfering signal must be estimated to enable reliable detection of the desired data. However, the joint estimation of fast fading channel and EIC from communications with different bandwidths has not been studied in literature. Toward this end, we propose a two-phase strategy for channel estimation and data detection. In the first phase, we derive the closed-form maximum-likelihood estimator of the EIC. Then, the interference is subtracted and the desired channel gains corresponding to pilot symbols are estimated. In the second phase, with the knowledge of desired channel information obtained from the previous phase, we derive the posterior probability for data symbols for the soft data detection. Via numerical studies, we demonstrate that our design can effectively cancel the interference and the soft detection approach can achieve better symbol error rate compared to the existing message passing based detection approach. We show that our design can perform well for a wide range of interference power and frequency spacing and it has lower complexity than the existing technique.","PeriodicalId":348924,"journal":{"name":"2018 IEEE Globecom Workshops (GC Wkshps)","volume":"109 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":"124082248","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}

引用次数: 2

When Blockchain Makes Ephemeral Keys Authentic: A Novel Key Agreement Mechanism in the IoT World 当区块链使临时密钥可信时:物联网世界中的一种新型密钥协议机制

2018 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2018-12-01 DOI: 10.1109/GLOCOMW.2018.8644494

Pietro Tedeschi, G. Piro, G. Boggia

引用次数: 3

Performance Analysis of Cognitive Clustered Machine-to-Machine Networks with Device Selection 基于设备选择的认知聚类机器对机器网络性能分析

2018 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2018-12-01 DOI: 10.1109/GLOCOMW.2018.8644158

Mohammed A. M. Abdullah, Gaojie Chen, Mahmoud Alageli, A. Ikhlef, J. Chambers

引用次数: 2

On Matching Users to Specialised MNOs in Service Tailored Networks of the Future 关于在未来的服务定制网络中将用户与专门的移动运营商配对

2018 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2018-12-01 DOI: 10.1109/GLOCOMW.2018.8644257

Conor Sexton, M. Butt, N. Marchetti, L. Dasilva

{"title":"On Matching Users to Specialised MNOs in Service Tailored Networks of the Future","authors":"Conor Sexton, M. Butt, N. Marchetti, L. Dasilva","doi":"10.1109/GLOCOMW.2018.8644257","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2018.8644257","url":null,"abstract":"In this paper, we investigate a network model in which entities called subscription brokers group service level agreements with multiple specialised mobile network operators (SMNOs) into a single subscription bundle, with a fixed data allowance that can be used by the subscriber as needed across any of the SMNOs included in the bundle. Each SMNO operates a network that is designed to meet the demands of a particular service area or vertical industry. We demonstrate the performance benefits of such a model, allowing users to choose SMNOs according to the needs of the service that they are using. In particular, we focus on how to perform the matching between users and SMNOs in a bundle, adopting the Gale-Shapley matching algorithm. We argue that a stable matching is needed to ensure that both SMNOs and users are incentivised to adopt the broker-based model. We outline a framework based on the concept of utility for devising the preference lists of users, while the approach we propose for building the preference lists of SMNOs can differentiate between different classes of users based on the price they pay for their subscription. We evaluate the performance cost in terms of utility of achieving stability compared to a sum utility maximisation matching approach, showing that this cost is largely borne by the lower priority users. Overall, the proposed broker-based model performs at least as well as any one SMNO for lower priority users, and outperforms any one SMNO for higher priority users.","PeriodicalId":348924,"journal":{"name":"2018 IEEE Globecom Workshops (GC Wkshps)","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":"127856757","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