2018 IEEE International Conference on Communications (ICC)最新文献_第9页

Sparse Vector Coding for 5G Ultra-Reliable and Low Latency Communications 5G超可靠低延迟通信的稀疏矢量编码

2018 IEEE International Conference on Communications (ICC) Pub Date : 2018-05-20 DOI: 10.1109/ICC.2018.8422147

Hyoungju Ji, S. Park, B. Shim

{"title":"Sparse Vector Coding for 5G Ultra-Reliable and Low Latency Communications","authors":"Hyoungju Ji, S. Park, B. Shim","doi":"10.1109/ICC.2018.8422147","DOIUrl":"https://doi.org/10.1109/ICC.2018.8422147","url":null,"abstract":"Ultra reliable and low latency communication (URLLC) is a newly introduced service category in 5G to support delay-sensitive applications. In order to support this new service category, 3rd Generation Partnership Project (3GPP) sets an aggressive requirement that a packet should be delivered with 10^-5 block error rate within 1 ms transmission period. Since the current wireless standard designed to maximize the coding gain by transmitting capacity achieving long code-block is not relevant for this purpose, entirely new transmission strategy is required. In this paper, we propose a new approach to transmit short packet information, called sparse vector coding (SVC). Key idea behind the proposed method is to transmit the control channel information after the sparse vector transformation. By mapping the transmit information into the position of nonzero elements and then transmitting it after the random spreading, we obtain underdetermined sparse system for which the principle of compressed sensing can be applied. From the numerical evaluations on realistic channel setting and decoder performance analysis, we demonstrate that the proposed SVC technique is very effective in URLLC transmission and outperforms the 4G LTE and LTE-Advanced physical downlink control channel (PDCCH) scheme.","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115532519","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

Object Tracking via Blocking in Millimeter Wave Communications: A Blessing Misfortune 毫米波通信中基于阻塞的目标跟踪:幸灾乐祸

2018 IEEE International Conference on Communications (ICC) Pub Date : 2018-05-20 DOI: 10.1109/ICC.2018.8422810

Zhiyang Zhang, Liang Li, Yawen Fan, Husheng Li

引用次数: 3

Cloud-Based Convergence of Heterogeneous RANs in 5G Disaggregated Architectures 5G分解架构下异构ran的云融合

2018 IEEE International Conference on Communications (ICC) Pub Date : 2018-05-20 DOI: 10.1109/ICC.2018.8422227

N. Makris, Christos Zarafetas, Pavlos Basaras, T. Korakis, N. Nikaein, L. Tassiulas

{"title":"Cloud-Based Convergence of Heterogeneous RANs in 5G Disaggregated Architectures","authors":"N. Makris, Christos Zarafetas, Pavlos Basaras, T. Korakis, N. Nikaein, L. Tassiulas","doi":"10.1109/ICC.2018.8422227","DOIUrl":"https://doi.org/10.1109/ICC.2018.8422227","url":null,"abstract":"Cloud-RAN based architectures are widely considered a fundamental part of 5G networks. As a consequence, in the upcoming standards for 5G RAN, disaggregating the RAN functionality between a Central Unit (CU) and multiple Distributed Units (DUs) is considered, addressing the splitting of the 5G protocol stack at the PDCP/RLC point. This split is expected to bring numerous advantages to mobile network operators, as through the isolation of the stack from the PDCP layer and upwards, the CU will be able to act as the Cloud-based convergence point among multiple heterogeneous technologies in the provisioned networks and hence able to serve multiple heterogeneous DUs. Moreover, data rate requirements for this type of split are not very demanding, thus allowing the IP-based transferring of data from the DU to CU and vice-versa. In this work, we propose, implement and evaluate a protocol for a Cloud-RAN based architecture allowing the selection and dynamic switching of different heterogeneous networks in the RAN. We rely on the open source OpenAirInterface platform and extend it to support data plane splitting of the LTE functionality, and the subsequent data injection to WiFi networks. We evaluate the platform using a real network setup, under several scenarios of network selection and different delay settings.","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115873456","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}

引用次数: 26

mIot Connectivity Solutions for Enhanced 5G Systems 用于增强型5G系统的物联网连接解决方案

2018 IEEE International Conference on Communications (ICC) Pub Date : 2018-05-20 DOI: 10.1109/ICC.2018.8422802

M. Condoluci, R. Trivisonno, Toktam Mahmoodi, Xueli An

引用次数: 3

Reduced-Dimension Symbol Detection in Random Access Channel 随机接入信道中的降维符号检测

2018 IEEE International Conference on Communications (ICC) Pub Date : 2018-05-20 DOI: 10.1109/ICC.2018.8422126

Milutin Pajovic, P. Orlik

{"title":"Reduced-Dimension Symbol Detection in Random Access Channel","authors":"Milutin Pajovic, P. Orlik","doi":"10.1109/ICC.2018.8422126","DOIUrl":"https://doi.org/10.1109/ICC.2018.8422126","url":null,"abstract":"In a growing number of IoT applications, an access point communicates with IoT users whose number prevents assignment of orthogonal channel resources to them, and renders network management and control impractical. Consequently, symbols transmitted from active users collide, which necessitates their separation on the receiver side. Given that an IoT user transmits with low probability, the sparsity in the user activity domain has been exploited in a number of previous works, where the symbol separation problem is formulated and solved as a sparse recovery problem. However, an excessive computational complexity remains a challenge in such approaches, where the number of filters in the equivalent receiver filter bank is equal to the overall number of users. Consequently, reduced-dimension processors facilitating low complexity symbol separation are sought. We propose here two novel reduced-dimension processors. In addition, a scheme, which aims to remove an impractical requirement that the receiver knows channels from all users is proposed and studied in conjunction with the reduced-dimension processors. Furthermore, pre-whitened reduced- dimension processors and a variety of approaches for the design of dimensionality reduction transformation matrix are considered. Finally, the results are validated with simulations. As such, the tests show that the proposed processors considerably outperform the benchmark, and also that the pre-whitened processors outperform their non-pre-whitened counterparts.","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124275549","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

A New Protection Scheme Based on Daily Traffic Demand for Survivable Fiber-Wireless (FiWi) Access Network 一种基于生存型光纤无线接入网日流量需求的保护方案

2018 IEEE International Conference on Communications (ICC) Pub Date : 2018-05-20 DOI: 10.1109/ICC.2018.8422443

Hong Zhang, Ruyang Wang, Honggang Wang

引用次数: 1

Secrecy Outage Probability Analysis over Malaga-Malaga Fading Channels 马拉加-马拉加衰落信道保密中断概率分析

2018 IEEE International Conference on Communications (ICC) Pub Date : 2018-05-20 DOI: 10.1109/ICC.2018.8422835

Jin-yuan Wang, Cheng Liu, Jun-Bo Wang, J. Dai, Min Lin, Ming Chen

引用次数: 10

Dynamic Computation Offloading and Resource Allocation over Mobile Edge Computing Networks with Energy Harvesting Capability 具有能量收集能力的移动边缘计算网络的动态计算卸载和资源分配

2018 IEEE International Conference on Communications (ICC) Pub Date : 2018-05-20 DOI: 10.1109/ICC.2018.8422096

Fei Wang, Xi Zhang

{"title":"Dynamic Computation Offloading and Resource Allocation over Mobile Edge Computing Networks with Energy Harvesting Capability","authors":"Fei Wang, Xi Zhang","doi":"10.1109/ICC.2018.8422096","DOIUrl":"https://doi.org/10.1109/ICC.2018.8422096","url":null,"abstract":"As an emerging and promising technique, the mobile edge computing (MEC) can significantly enhance the computational capability and save computing energy of mobiles, by offloading the computation-intensive tasks from the resource-constrained mobiles to the resource-rich MEC servers. However, since mobiles are generally energy constrained, mobile applications may still be interrupted when the energy of mobiles runs out. To overcome this challenge, we propose to integrate energy harvesting (EH) technique, which can enable mobiles to collect recyclable energy from ambient environments, into MEC, and develop the joint computation offloading and resource allocation scheme for the MEC system supporting multiple EH mobiles. In our considered scenario, each mobile first harvests energy from radio frequency (RF) signals emitted by a base station (BS) which is equipped with an MEC server, and then utilizes the harvested energy to execute its own task either locally at the mobile or by offloading to MEC. Moreover, our developed MEC system employs non- orthogonal multiple access (NOMA) so that multiple mobiles can utilize the same system subcarriers for task offloading to improve system performance. We first formulate the computation offloading and resource allocation problem of interest into an optimization problem, aiming to minimize the total task execution time of all mobiles under their strict timely-execution requirements. Then, we develop the joint computation offloading and resource allocation schemes, through which we can dynamically determine: 1) the energy harvesting time for mobiles; 2) the CPU clock frequencies of mobiles which intend local computing on their own; and 3) the set of mobiles which choose data offloading as well as the subcarriers and power allocations for these mobiles. Finally, we validate and evaluate the proposed offloading and resource allocation scheme through numerical analyses.","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123392157","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}

引用次数: 21

Computing Probability Density Functions of Compound Distributions: A Comparative Investigation 计算复合分布的概率密度函数:比较研究

2018 IEEE International Conference on Communications (ICC) Pub Date : 2018-05-20 DOI: 10.1109/ICC.2018.8423041

T. Olofsson, A. Ahlén

引用次数: 2

EmoSense: Data-Driven Emotion Sensing via Off-the-Shelf WiFi Devices EmoSense:通过现成的WiFi设备进行数据驱动的情感感知

2018 IEEE International Conference on Communications (ICC) Pub Date : 2018-05-20 DOI: 10.1109/ICC.2018.8422330

Yu Gu, Tao Liu, Jie Li, Fuji Ren, Zhi Liu, Xiaoyan Wang, Pengjie Li

引用次数: 23