上行海量MTC中数据速率分析的干扰统计近似

Sergi Liesegang, O. Muñoz, A. Pascual-Iserte
{"title":"上行海量MTC中数据速率分析的干扰统计近似","authors":"Sergi Liesegang, O. Muñoz, A. Pascual-Iserte","doi":"10.1109/GlobalSIP.2018.8646658","DOIUrl":null,"url":null,"abstract":"Machine-type-communications have attracted a lot of interest in the past years. They rely on interactions between devices with no human supervision. This will help to the advent of a plethora of applications such as the Internet-of-Things. Part of the research within this field deals with coordinating the access of a large number of devices to the network, the so-called massive machine-type-communications. In this paper, we focus on the evaluation of the data rate for that scenario, based on an approximation of the statistics of the aggregated interference that depends on the sensors activity. We will consider that the sensors can be in either active or sleep mode, modeled as a Bernoulli random variable. This results in an aggregated interference that follows a discrete distribution whose computation becomes unfeasible with the number of devices. That is why two alternatives are presented to replace the original magnitude and work with an analytic closed form expression approximating the actual statistics. Our approaches are derived using the Chernoff bound and a Gaussian approximation based on Lyapunov’s central limit theorem. The average rate is found in both cases and compared with the actual values in different setups. Monte-Carlo simulations will be used for this task.","PeriodicalId":119131,"journal":{"name":"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Interference Statistics Approximations for Data Rate Analysis in Uplink Massive MTC\",\"authors\":\"Sergi Liesegang, O. Muñoz, A. Pascual-Iserte\",\"doi\":\"10.1109/GlobalSIP.2018.8646658\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Machine-type-communications have attracted a lot of interest in the past years. They rely on interactions between devices with no human supervision. This will help to the advent of a plethora of applications such as the Internet-of-Things. Part of the research within this field deals with coordinating the access of a large number of devices to the network, the so-called massive machine-type-communications. In this paper, we focus on the evaluation of the data rate for that scenario, based on an approximation of the statistics of the aggregated interference that depends on the sensors activity. We will consider that the sensors can be in either active or sleep mode, modeled as a Bernoulli random variable. This results in an aggregated interference that follows a discrete distribution whose computation becomes unfeasible with the number of devices. That is why two alternatives are presented to replace the original magnitude and work with an analytic closed form expression approximating the actual statistics. Our approaches are derived using the Chernoff bound and a Gaussian approximation based on Lyapunov’s central limit theorem. The average rate is found in both cases and compared with the actual values in different setups. Monte-Carlo simulations will be used for this task.\",\"PeriodicalId\":119131,\"journal\":{\"name\":\"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GlobalSIP.2018.8646658\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GlobalSIP.2018.8646658","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在过去的几年里,机器通信引起了人们的极大兴趣。它们依赖于设备之间的交互,而无需人工监督。这将有助于物联网等大量应用程序的出现。该领域的部分研究涉及协调大量设备对网络的访问,即所谓的大规模机器类型通信。在本文中,我们着重于基于依赖于传感器活动的聚合干扰统计的近似值来评估该场景的数据速率。我们将考虑传感器可以处于活动模式或睡眠模式,建模为伯努利随机变量。这就导致了遵循离散分布的聚合干扰,其计算随着设备数量的增加而变得不可行的。这就是为什么提出了两种替代方法来代替原来的大小,并使用接近实际统计的解析封闭形式表达式。我们的方法是使用切尔诺夫界和基于李亚普诺夫中心极限定理的高斯近似推导出来的。在两种情况下找到平均速率,并将其与不同设置下的实际值进行比较。蒙特卡罗模拟将用于这项任务。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Interference Statistics Approximations for Data Rate Analysis in Uplink Massive MTC
Machine-type-communications have attracted a lot of interest in the past years. They rely on interactions between devices with no human supervision. This will help to the advent of a plethora of applications such as the Internet-of-Things. Part of the research within this field deals with coordinating the access of a large number of devices to the network, the so-called massive machine-type-communications. In this paper, we focus on the evaluation of the data rate for that scenario, based on an approximation of the statistics of the aggregated interference that depends on the sensors activity. We will consider that the sensors can be in either active or sleep mode, modeled as a Bernoulli random variable. This results in an aggregated interference that follows a discrete distribution whose computation becomes unfeasible with the number of devices. That is why two alternatives are presented to replace the original magnitude and work with an analytic closed form expression approximating the actual statistics. Our approaches are derived using the Chernoff bound and a Gaussian approximation based on Lyapunov’s central limit theorem. The average rate is found in both cases and compared with the actual values in different setups. Monte-Carlo simulations will be used for this task.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信