Exploiting Time Diversity of LoRa Networks Through Optimum Message Replication

A. Hoeller, R. Souza, O. A. López, H. Alves, M. Noronha-Neto, G. Brante
{"title":"Exploiting Time Diversity of LoRa Networks Through Optimum Message Replication","authors":"A. Hoeller, R. Souza, O. A. López, H. Alves, M. Noronha-Neto, G. Brante","doi":"10.1109/ISWCS.2018.8491203","DOIUrl":null,"url":null,"abstract":"LoRA networks have been gaining momentum as an accessible and open solution for massive connectivity in the Internet-of- Things. Besides the popularity, however, academic research has shown that the technology has limitations. In particular to the connectivity argument, it became clear that massive coverage comes at the price of severely reduced duty cycles, and the increased number of users in the network significantly elevates packet loss due to collisions. In this paper, we exploit time diversity to increase the probability of successful packet delivery in LoRA uplink. We build on previous work to model the outage and coverage probabilities of LoRA channels and analyze the use of message replication to create signal diversity. We observed that there is an optimum number of message replicas that minimizes outage probability and avoids high collision probability. We validate the proposed model using numerical simulations.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"144 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWCS.2018.8491203","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

LoRA networks have been gaining momentum as an accessible and open solution for massive connectivity in the Internet-of- Things. Besides the popularity, however, academic research has shown that the technology has limitations. In particular to the connectivity argument, it became clear that massive coverage comes at the price of severely reduced duty cycles, and the increased number of users in the network significantly elevates packet loss due to collisions. In this paper, we exploit time diversity to increase the probability of successful packet delivery in LoRA uplink. We build on previous work to model the outage and coverage probabilities of LoRA channels and analyze the use of message replication to create signal diversity. We observed that there is an optimum number of message replicas that minimizes outage probability and avoids high collision probability. We validate the proposed model using numerical simulations.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过最佳消息复制利用LoRa网络的时间分集
LoRA网络作为物联网中大规模连接的可访问和开放的解决方案已获得势头。然而,除了受欢迎之外,学术研究表明,这项技术也有局限性。特别是关于连接性的争论,很明显,大规模覆盖是以严重降低占空比为代价的,并且网络中用户数量的增加大大增加了由于碰撞而导致的数据包丢失。在本文中,我们利用时间分集来提高LoRA上行链路中数据包成功投递的概率。我们以以前的工作为基础,对LoRA信道的中断和覆盖概率进行建模,并分析使用消息复制来创建信号分集。我们观察到,存在一个最优数量的消息副本,可以最小化中断概率并避免高碰撞概率。我们用数值模拟验证了所提出的模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Impact of Selective Channels on Post-OFDM Waveforms for 5G Machine Type Communications Secure Power Allocation of Two-Way Relaying with an Untrusted Denoise-and-Forward Relay Joint Hybrid Precoding Based on Orthogonal Codebook in Millimeter Wave Systems Approximating Electromagnetic Exposure in Dense Indoor Environments Location-Aware Hypergraph Coloring Based Spectrum Allocation for D2D Communication
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1