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

Towards Studying Service Function Chain Migration Patterns in 5G Networks and Beyond 5G及以后网络业务功能链迁移模式研究

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

Rami Akrem Addad, D. Dutra, Miloud Bagaa, T. Taleb, H. Flinck

{"title":"Towards Studying Service Function Chain Migration Patterns in 5G Networks and Beyond","authors":"Rami Akrem Addad, D. Dutra, Miloud Bagaa, T. Taleb, H. Flinck","doi":"10.1109/GLOBECOM38437.2019.9013983","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9013983","url":null,"abstract":"Given the indispensable need for a reliable network architecture to cope with 5G networks, 3GPP introduced a covet technology dubbed 5G Service Based Architecture (5G-SBA). Meanwhile, Multi-access Edge Computing (MEC) combined with SBA conveys a better experience to end- users by bringing application hosting from centralized data centers down to the network edge, closer to consumers and the data generated by applications. Both the 3GPP and the ETSI proposals offered numerous benefits, particularly the ability to deliver highly customizable services. Nevertheless, compared to large data- centers that tolerate the hosting of standard virtualization technologies (Virtual Machines (VMs) and servers), MEC nodes are characterized by lower computational resources, thus the debut of lightweight micro-service based applications. Motivated by the deficiency of current micro-services-based applications to support usersâ€™ mobility and assuming that all these issues are under the umbrella of Service Function Chain (SFC) migrations, we aim to introduce, explain and evaluate diverse SFC migration patterns. The obtained results demonstrate that there is no clear vanquisher, but selecting the right SFC migration pattern depends on usersâ€™ motion, applicationsâ€™ requirements, and MEC nodesâ€™ resources.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"11 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":"72918931","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

On Connectivity of Interdependent Networks 论相互依存网络的连通性

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

Arunabha Sen, K. Basu

{"title":"On Connectivity of Interdependent Networks","authors":"Arunabha Sen, K. Basu","doi":"10.1109/GLOBECOM38437.2019.9014143","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9014143","url":null,"abstract":"The studies in fault-tolerance in networks mostly focus on the connectivity of the graph as the metric of fault-tolerance. If the underlying graph is k-connected, it can tolerate up to k -1 failures. This metric in various forms, has been used extensively for robust design of communication networks, which may be viewed as a single layer network. In the last few years, there is an increasing awareness in the research community that critical infrastructure networks, such as the power grid and the communication network are highly interdependent. This inter-dependency has become critical in a {smart-grid} environment, where the electric power transmission/distribution network is highly integrated with the communication network. This dependency realization has led to a fairly large number of studies on robustness and resiliency of interdependent multi-layer networks. Unfortunately, many of the proposed models of inter-dependency that appeared in the literature in the last few years fail to capture the complex inter-dependency that exists between entities of power grid and communication networks, involving a complex combination of conjunctive and disjunctive relations. The Boolean logic based model of inter-dependency proposed in cite{sen2014identification} overcomes this limitation. Using this dependency model, in this paper we explore ''connectivity'' of a two-layer interdependent network and formally define a new metric, Two-Layered connectivity (TL-connectivity), that is a counterpart of the traditional connectivity metric for a single-layer network (SL-connectivity). We provide an algorithm for computation of TL-connectivity. The problem can be solved in polynomial time in some special cases, whereas for some others, the problem is NP-complete. Finally, we evaluate the technique with a specific case study.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"28 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":"80288006","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

Primary Channel Duty Cycle Estimation under Imperfect Spectrum Sensing Based on Mean Channel Periods 基于平均信道周期的不完全频谱感知下主信道占空比估计

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

Ogeen H. Toma, M. López-Benítez, Dhaval K. Patel, K. Umebayashi

{"title":"Primary Channel Duty Cycle Estimation under Imperfect Spectrum Sensing Based on Mean Channel Periods","authors":"Ogeen H. Toma, M. López-Benítez, Dhaval K. Patel, K. Umebayashi","doi":"10.1109/GLOBECOM38437.2019.9013426","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9013426","url":null,"abstract":"The emerged Dynamic Spectrum Access (DSA) concept based on Cognitive Radio (CR) is a promising solution to overcome the problems related to frequency spectrum scarcity. In DSA/CR systems, the inactivity patterns of the licensed frequency channels are exploited in an opportunistic and non-interfering manner by unlicensed users. Therefore, the knowledge of the occupancy rate (i.e., duty cycle) of these licensed channels is crucial for boosting the performance of the DSA/CR system. For example, it can help to select the lowest occupied channel which can offer higher opportunistic spectrum to the unlicensed users. Channel Duty Cycle (DC) is a statistical parameter about the activity of the licensed channel in time- domain, which is initially unknown to the DSA/CR system but can be estimated from the outcomes of spectrum sensing. However, spectrum sensing is imperfect in practice due to sensing errors, which in turn will provide incorrect estimation of the channel DC. In this context, this work successfully finds a novel method to accurately estimate the channel DC even under Imperfect Spectrum Sensing (ISS) without requiring any prior knowledge about the licensed channel activity. This is achieved after accurately analysing the impact of ISS on the estimation of the statistical moment (mean) of the channel activity periods, for which a closed form expression is obtained as a function of the true mean, probability of errors and sensing period. The achieved mathematical expression helps to find a novel method to accurately estimate the true mean of the channel activity periods and subsequently the channel DC based on the outcomes of the ISS.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"89 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":"80318166","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

The Synergy of Edge and Central Cloud Computing with Wireless MIMO Backhaul 边缘和中心云计算与无线MIMO回程的协同作用

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

Xiaoyan Hu, Lifeng Wang, Kai‐Kit Wong, M. Tao, Yangyang Zhang, Zhongbin Zheng

引用次数: 1

Pilot-Free Channel Change Detection for mmWave Massive MIMO System 毫米波大规模MIMO系统的无导频信道变化检测

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

Yue Wu, Yuchen Jiao, F. Gao, Yuantao Gu

引用次数: 4

Optimized Scheduling for Time-Critical Industrial IoT 时间关键型工业物联网的优化调度

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

Keoma Brun-Laguna, P. Minet, Yasuyuki Tanaka

引用次数: 6

Fine-Grained Resource Management for Edge Computing Satellite Networks 边缘计算卫星网络的细粒度资源管理

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

Feng Wang, Dingde Jiang, Sheng Qi, Chen Qiao, H. Song

{"title":"Fine-Grained Resource Management for Edge Computing Satellite Networks","authors":"Feng Wang, Dingde Jiang, Sheng Qi, Chen Qiao, H. Song","doi":"10.1109/GLOBECOM38437.2019.9013467","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9013467","url":null,"abstract":"The low earth orbit (LEO) satellite network has been a valuable architecture due to its characteristics of wide coverage and low transmission delay. Utilizing LEO satellites as edge computing nodes to provide real-time services for access terminals will be the indispensable paradigm of integrated space-air-ground network. However, it is not easy to design resource management strategies in edge computing satellite (ECS), considering different accessing planes and resource requirements of terminals. Moreover, a comprehensive analysis of the network topology, relative motion, and available resources is required to establish ECS collaborative networks. To address these problems, the dynamic resource allocation architecture and advanced K-means algorithm (AKA) in ECSs are proposed. Then, the extended graph model and breadth-first-search-based spanning tree (BFST) algorithm are utilized to guide the inter-satellite link (ISL) construction. As a result, the ECS collaborative network is established with fine-grained resource management. Simulation results show that the proposed fine- grained resource management scheme is feasible and effective.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"28 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":"81345304","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}

引用次数: 12

Online Incentive Mechanism Design for Collaborative Offloading in Mobile Edge Computing 移动边缘计算协同卸载在线激励机制设计

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

Gang Li, Jun Cai, Jing Ma

引用次数: 0

Incentivize to Build: A Crowdsourcing Framework for Federated Learning 激励构建:联邦学习的众包框架

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

Shashi Raj Pandey, N. H. Tran, M. Bennis, Y. Tun, Zhu Han, C. Hong

{"title":"Incentivize to Build: A Crowdsourcing Framework for Federated Learning","authors":"Shashi Raj Pandey, N. H. Tran, M. Bennis, Y. Tun, Zhu Han, C. Hong","doi":"10.1109/GLOBECOM38437.2019.9014329","DOIUrl":"https://doi.org/10.1109/GLOBECOM38437.2019.9014329","url":null,"abstract":"Federated learning (FL) rests on the notion of training a global model in a decentralized manner. Under this setting, mobile devices perform computations on their local data before uploading the required updates to the central aggregator for improving the global model. However, a key challenge is to maintain communication efficiency (i.e., the number of communications per iteration) when participating clients implement uncoordinated computation strategy during aggregation of model parameters. We formulate a utility maximization problem to tackle this difficulty, and propose a novel crowdsourcing framework, involving a number of participating clients with local training data to leverage FL. We show the incentive-based interaction between the crowdsourcing platform and the participating client's independent strategies for training a global learning model, where each side maximizes its own benefit. We formulate a two-stage Stackelberg game to analyze such scenario and find the game's equilibria. Further, we illustrate the efficacy of our proposed framework with simulation results. Results show that the proposed mechanism outperforms the heuristic approach with up to 22% gain in the offered reward to attain a level of target accuracy.","PeriodicalId":6868,"journal":{"name":"2019 IEEE Global Communications Conference (GLOBECOM)","volume":"11 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":"82360763","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}

引用次数: 28

Coverage Area Performance for Multiple Interfering UAVs 多干扰无人机的覆盖区域性能

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

A. Khuwaja, G. Zheng, W. Feng, Yunfei Chen

引用次数: 1