面向5G网络切片的MTC数据聚合

Yiqian Xu, G. Feng, Liang Liang, Shuang Qin, Zhi Chen
{"title":"面向5G网络切片的MTC数据聚合","authors":"Yiqian Xu, G. Feng, Liang Liang, Shuang Qin, Zhi Chen","doi":"10.23919/APCC.2017.8304005","DOIUrl":null,"url":null,"abstract":"Recently network slicing has been identified as a promising network architectural technology for the next generation mobile cellular networks (5G) to address the challenges stemming from a wide range of applications. Especially, for machine type communication (MTC) application, it is widely recognized that traditional cellular network architecture is not adequate to meet the requirements in terms of massive connectivity and low latency. For exploiting network slicing, data aggregation (DA) can be adopted to effectively address the massive connectivity and latency requirement. In this paper, we propose an efficient network slicing data aggregation (NSDA) scheme for MTC applications. Different from conventional DA scheme where data aggregation is performed based on device locations, we perform DA according to latency requirement for MTC devices (MTCDs), with aim to exploit the benefits of network slicing and thus improve network access capacity and decrease access latency. We formulate the DA problem as a 0–1 Linear Programming and propose an efficient two-step algorithm to aggregate the MTC data for accessing a specific network slice. We examine the performance of our proposed NSDA in typical MTC scenarios via simulations. Numerical results reveal that NSDA significantly outperforms traditional MTC access schemes (without network slicing) in terms of network capacity, access congestion degree, latency, etc.","PeriodicalId":320208,"journal":{"name":"2017 23rd Asia-Pacific Conference on Communications (APCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"MTC data aggregation for 5G network slicing\",\"authors\":\"Yiqian Xu, G. Feng, Liang Liang, Shuang Qin, Zhi Chen\",\"doi\":\"10.23919/APCC.2017.8304005\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently network slicing has been identified as a promising network architectural technology for the next generation mobile cellular networks (5G) to address the challenges stemming from a wide range of applications. Especially, for machine type communication (MTC) application, it is widely recognized that traditional cellular network architecture is not adequate to meet the requirements in terms of massive connectivity and low latency. For exploiting network slicing, data aggregation (DA) can be adopted to effectively address the massive connectivity and latency requirement. In this paper, we propose an efficient network slicing data aggregation (NSDA) scheme for MTC applications. Different from conventional DA scheme where data aggregation is performed based on device locations, we perform DA according to latency requirement for MTC devices (MTCDs), with aim to exploit the benefits of network slicing and thus improve network access capacity and decrease access latency. We formulate the DA problem as a 0–1 Linear Programming and propose an efficient two-step algorithm to aggregate the MTC data for accessing a specific network slice. We examine the performance of our proposed NSDA in typical MTC scenarios via simulations. Numerical results reveal that NSDA significantly outperforms traditional MTC access schemes (without network slicing) in terms of network capacity, access congestion degree, latency, etc.\",\"PeriodicalId\":320208,\"journal\":{\"name\":\"2017 23rd Asia-Pacific Conference on Communications (APCC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 23rd Asia-Pacific Conference on Communications (APCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/APCC.2017.8304005\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 23rd Asia-Pacific Conference on Communications (APCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/APCC.2017.8304005","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

最近,网络切片已被确定为下一代移动蜂窝网络(5G)的一种有前途的网络架构技术,以解决各种应用所带来的挑战。特别是在机器类型通信(MTC)应用中,传统的蜂窝网络架构已不能满足海量连接和低时延的要求。为了利用网络切片,可以采用数据聚合(DA)来有效地解决海量连接和延迟需求。在本文中,我们提出了一种用于MTC应用的高效网络切片数据聚合(NSDA)方案。与传统数据处理方案基于设备位置进行数据聚合不同,我们根据MTC设备(mtcd)的延迟需求进行数据处理,旨在利用网络切片的优势,从而提高网络访问容量,降低访问延迟。我们将数据挖掘问题表述为一个0-1线性规划,并提出了一个有效的两步算法来聚合访问特定网络片的MTC数据。我们通过模拟测试了我们提出的NSDA在典型MTC场景下的性能。数值结果表明,NSDA在网络容量、接入拥塞程度、时延等方面明显优于传统的MTC接入方案(不进行网络切片)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
MTC data aggregation for 5G network slicing
Recently network slicing has been identified as a promising network architectural technology for the next generation mobile cellular networks (5G) to address the challenges stemming from a wide range of applications. Especially, for machine type communication (MTC) application, it is widely recognized that traditional cellular network architecture is not adequate to meet the requirements in terms of massive connectivity and low latency. For exploiting network slicing, data aggregation (DA) can be adopted to effectively address the massive connectivity and latency requirement. In this paper, we propose an efficient network slicing data aggregation (NSDA) scheme for MTC applications. Different from conventional DA scheme where data aggregation is performed based on device locations, we perform DA according to latency requirement for MTC devices (MTCDs), with aim to exploit the benefits of network slicing and thus improve network access capacity and decrease access latency. We formulate the DA problem as a 0–1 Linear Programming and propose an efficient two-step algorithm to aggregate the MTC data for accessing a specific network slice. We examine the performance of our proposed NSDA in typical MTC scenarios via simulations. Numerical results reveal that NSDA significantly outperforms traditional MTC access schemes (without network slicing) in terms of network capacity, access congestion degree, latency, etc.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信