2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)最新文献_第4页

A Communication Architecture for Cooperative Networked Cyber-Physical Systems 协作网络信息物理系统的通信体系结构

2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC) Pub Date : 2019-01-01 DOI: 10.1109/CCNC.2019.8651834

Georg von Zengen, Yannic Schröder, L. Wolf

{"title":"A Communication Architecture for Cooperative Networked Cyber-Physical Systems","authors":"Georg von Zengen, Yannic Schröder, L. Wolf","doi":"10.1109/CCNC.2019.8651834","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651834","url":null,"abstract":"Cyber-Physical Systems (CPSs) are used in various important application areas. Networking of several CPSs, the internal networking of CPSs components as well as the interconnection with other systems, is of major importance with respect to scientific, engineering and technical considerations; yet, it is also very challenging. In this paper we describe an architecture and methods which can be used for various networked CPSs. To base the system design and approaches on realistic requirements and devise suitable methods, we use tightly cooperating, mobile robots as application area. This is an example of challenging CPSs which put high demands on the networking methods. Nevertheless, the considerations are applicable to other CPSs as well. In order to enable networked mobile robots to perform individual and cooperative tasks, real-time support and network operations such as merge, split, and synchronize among clusters of such robots are needed. Further, management functions have to be provided which enable independent, but concurrent clusters to allocate and share scarce network resources. In the context of this paper, network resources are considered in a broad sense (e.g., time slots, frequency channels, codes) and assigned by a novel scheduling algorithm. Thus, a schedule means not only a sequence of time slots, but it takes all mentioned dimensions into account.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"277 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134312646","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}

引用次数: 1

2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC) Pub Date : 2019-01-01 DOI: 10.1109/CCNC.2019.8651737

Sajad Mehrizi, Anestis Tsakmalis, S. Chatzinotas, B. Ottersten

{"title":"Content Popularity Estimation in Edge-Caching Networks from Bayesian Inference Perspective","authors":"Sajad Mehrizi, Anestis Tsakmalis, S. Chatzinotas, B. Ottersten","doi":"10.1109/CCNC.2019.8651737","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651737","url":null,"abstract":"The efficiency of cache-placement algorithms in edge-caching networks depends on the accuracy of the content request’s statistical model and the estimation method based on the postulated model. This paper studies these two important issues. First, we introduce a new model for content requests in stationary environments. The common approach to model the requests is through the Poisson stochastic process. However, the Poisson stochastic process is not a very flexible model since it cannot capture the correlations between contents. To resolve this limitation, we instead introduce the Poisson Factor Analysis (PFA) model for this purpose. In PFA, the correlations are modeled through additional random variables embedded in a low dimensional latent space. The correlations provide rich information about the underlying statistical properties of content requests which can be used for advanced cache-placement algorithms. Secondly, to learn the model, we use Bayesian Learning, an efficient framework which does not overfit. This is crucial in edge-caching systems since only partial view of the entire request set is available at the local cache and the learning method should be able to estimate the content popularities without overfitting. In the simulation results, we compare the performance of our approach with the existing popularity estimation method.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134525822","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

Relay UE Selection Scheme in an Emergency Warning System Integrating Proximity Services 集成近距离服务的紧急预警系统中继终端选择方案

2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC) Pub Date : 2019-01-01 DOI: 10.1109/CCNC.2019.8651762

Y. Musaka, Yoshitaka Nakamura, H. Inamura, Xiaohong Jiang

引用次数: 2

CAA: CLAT Aware Affinity Scheduler for Next Generation Mobile Networks 下一代移动网络CLAT感知亲和调度器

2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC) Pub Date : 2019-01-01 DOI: 10.1109/CCNC.2019.8651699

Chhaya Bharti, M. Kanagarathinam, S. Srivastava, Milim Lee, JaeKwang Han, Wangkeun Oh

{"title":"CAA: CLAT Aware Affinity Scheduler for Next Generation Mobile Networks","authors":"Chhaya Bharti, M. Kanagarathinam, S. Srivastava, Milim Lee, JaeKwang Han, Wangkeun Oh","doi":"10.1109/CCNC.2019.8651699","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651699","url":null,"abstract":"Exponential growth in the number of subscribers intrigued Mobile Network Operators(MNOs) to invest substantial efforts towards the faster transition to IPv6 address. The current solution deployed by leading MNOs uses Dual IP 464XLAT to achieve address translation. There has been significant research on the dual IP system. However, an important area of study which is not investigated in detail is the correlation of 464XLAT in the multi-core architecture. We investigate the effects of this architecture on bandwidth utilization of mobile Smartphones with emphasis on multi-core scheduling algorithm. In this paper, we propose a novel networking packet scheduling scheme called CAA - CLAT Aware Affinity Scheduler for Next Generation Mobile Networks. CAA classifies the packets according to the characteristics and efficiently schedules among the CPU cores at its best effort for improved throughput in Dual Stack Smartphones. We also propose CAA-LITE, a lightweight version where the affinity scheduling is static with minimal steps. To illustrate the effectiveness of our proposed method, we conducted simulations in our lab at Samsung R&D India Bangalore and live air experiments in Samsung Electronics, South Korea. Our live air experiments show that the CAA outperforms the legacy by improving the throughput of around 90% under various operational conditions consistently. Moreover, our power consumption test shows that the CAA improves the power by 22% compared to original approaches.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125364413","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

A Novel Receiver Technique to enable NOMA Without User Selection 一种新的无用户选择NOMA接收机技术

2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC) Pub Date : 2019-01-01 DOI: 10.1109/CCNC.2019.8651674

Vaishnavi Jootu Sethuram

{"title":"A Novel Receiver Technique to enable NOMA Without User Selection","authors":"Vaishnavi Jootu Sethuram","doi":"10.1109/CCNC.2019.8651674","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651674","url":null,"abstract":"NOMA (Non Orthogonal Multiple Access)/MUST (Multi-User Superposition Transmission) is one of the major candidates for next generation wireless access technologies as they provide better user fairness and improved spectral efficiency. Successive Interference Cancellation (SIC) receivers enable multiple users to be scheduled in the same time-frequency resources while differentiated in power domain. Two user Power Domain NOMA (PD-NOMA) analysis clearly shows that the SNR difference between the users is very important in order to achieve inter-user interference cancellation. Hence user selection or pairing becomes crucial and can lead to heavy co-channel interference when users are paired wrongly. In order to overcome this problem, a new method of NOMA is proposed where the user pairing can be arbitrary, but an advanced receiver technique is used which enables successful decoding of the desired user’s data. A novel Gaussian Mixture based receiver is proposed. It is shown that the error rate performance of this detector is very close to that of a joint detector and the proposed technique can be used both in uplink and downlink directions. Another key contribution of this work is to show the over-modeling technique which enables the decoder to operate without having to know any prior information about the interferers. This enables a practical approach to build Gaussian Mixture Model (GMM) based receivers for a variety of interference scenarios.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125423546","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

Characterizing Full-Duplex V2V Broadcast Performance through Stochastic Geometry 基于随机几何的全双工V2V广播性能表征

2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC) Pub Date : 2019-01-01 DOI: 10.1109/CCNC.2019.8651886

Alexandre Mouradian, C. Campolo, A. Molinaro, A. Berthet, V. Vèque

{"title":"Characterizing Full-Duplex V2V Broadcast Performance through Stochastic Geometry","authors":"Alexandre Mouradian, C. Campolo, A. Molinaro, A. Berthet, V. Vèque","doi":"10.1109/CCNC.2019.8651886","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651886","url":null,"abstract":"Broadcast traffic in IEEE 802.11 vehicular networks is known to suffer from poor performance due to the lack of recovery mechanisms from packet losses, based on the rules of the Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol. This may have a detrimental impact on cooperative vehicular safety applications that build on the reliable regular broadcasting of status messages by vehicles in a local neighborhood. Full-Duplex (FD) techniques can improve the broadcast CSMA/CA performance by letting a sending vehicle sense the channel while transmitting, thus enabling “collision detection”. The vehicle, consequently, can abort the packet prone to collision and reattempt a later transmission. In this paper, we define a stochastic geometry model that captures the collision detection capability of FD-enabled vehicles, while accurately characterizing the interference power generated by other vehicles on a road segment, and the dynamics of the backoff mechanism used for broadcast packet retransmissions. The model provides helpful insights into the FD broadcast CSMA/CA behaviour, highlighting a clear relationship between the settings for the carrier sense threshold and the collision detection threshold and the number of covered receivers on the road.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129118549","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

Detections of pulse and blood pressure employing 5G millimeter wave signal 利用5G毫米波信号检测脉搏和血压

2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC) Pub Date : 2019-01-01 DOI: 10.1109/CCNC.2019.8651697

Yukino Yamaoka, Jiang Liu, S. Shimamoto

引用次数: 1

Analysis of a crowd-computing search algorithm in mesh networks 网格网络中一种群体计算搜索算法的分析

2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC) Pub Date : 2019-01-01 DOI: 10.1109/CCNC.2019.8651740

P. Dong, Zhizhong Zhang, Jun Yao

引用次数: 0

Incremental Spatial Clustering for Spatial Big Crowd Data in Evolving Disaster Scenario 演化灾害场景下空间大人群数据的增量空间聚类

2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC) Pub Date : 2019-01-01 DOI: 10.1109/CCNC.2019.8651840

Yilang Wu, Amitangshu Pal, Junbo Wang, K. Kant

引用次数: 6

Symbol Denoising in High Order M-QAM using Residual learning of Deep CNN 基于深度CNN残差学习的高阶M-QAM符号去噪

2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC) Pub Date : 2019-01-01 DOI: 10.1109/CCNC.2019.8651830

Saud Khan, K. S. Khan, S. Shin

引用次数: 7