移动M2M通信的MAC协议建模

M. Mehmet-Ali, Farshad Keyvan Ghazvini, M. Doughan
{"title":"移动M2M通信的MAC协议建模","authors":"M. Mehmet-Ali, Farshad Keyvan Ghazvini, M. Doughan","doi":"10.1109/ISNCC.2017.8072018","DOIUrl":null,"url":null,"abstract":"Machine-to-machine (M2M) communications is one of the enabling technologies for connecting massive number of devices to the Internet of Things (IoT). M2M communications have different characteristics than human-to-human (H2H) communications. In this work, we assume that the machines are mobile, as a result, the number of machines served by the network is variable. We consider a contention-based MAC protocol for M2M communications. The transmissions are organized into frames and each machine is assumed to generate probabilistically one or zero packet per frame. The machines have been divided into different types according to their packet generation probabilities. We assume that a machine will attempt transmission of a packet until it generates a new packet. A packet will be lost if it hasnot been successfully transmitted by the time the machine generates a new packet. We have derived packet loss probability for each type of machines. The numerical results show that very low packet loss probability may be achieved for a wide range of traffic load. The results of this paper may be used in the dimensioning of M2M networks.","PeriodicalId":176998,"journal":{"name":"2017 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Modelling of a MAC protocol for mobile M2M communications\",\"authors\":\"M. Mehmet-Ali, Farshad Keyvan Ghazvini, M. Doughan\",\"doi\":\"10.1109/ISNCC.2017.8072018\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Machine-to-machine (M2M) communications is one of the enabling technologies for connecting massive number of devices to the Internet of Things (IoT). M2M communications have different characteristics than human-to-human (H2H) communications. In this work, we assume that the machines are mobile, as a result, the number of machines served by the network is variable. We consider a contention-based MAC protocol for M2M communications. The transmissions are organized into frames and each machine is assumed to generate probabilistically one or zero packet per frame. The machines have been divided into different types according to their packet generation probabilities. We assume that a machine will attempt transmission of a packet until it generates a new packet. A packet will be lost if it hasnot been successfully transmitted by the time the machine generates a new packet. We have derived packet loss probability for each type of machines. The numerical results show that very low packet loss probability may be achieved for a wide range of traffic load. The results of this paper may be used in the dimensioning of M2M networks.\",\"PeriodicalId\":176998,\"journal\":{\"name\":\"2017 International Symposium on Networks, Computers and Communications (ISNCC)\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Symposium on Networks, Computers and Communications (ISNCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISNCC.2017.8072018\",\"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 International Symposium on Networks, Computers and Communications (ISNCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISNCC.2017.8072018","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

机器对机器(M2M)通信是将大量设备连接到物联网(IoT)的使能技术之一。M2M通信与人对人(H2H)通信具有不同的特点。在这项工作中,我们假设机器是移动的,因此,网络服务的机器数量是可变的。我们考虑了一种基于争用的M2M通信MAC协议。传输被组织成帧,假设每台机器每帧产生一个或0个包的概率。这些机器根据它们生成包的概率被分为不同的类型。我们假设一台机器将尝试传输一个数据包,直到它生成一个新的数据包。如果一个包在机器生成一个新包之前还没有成功传输,那么它就会丢失。我们推导出了每种机器的丢包概率。数值结果表明,在较宽的业务负载范围内,该算法可以实现很低的丢包概率。本文的研究结果可用于M2M网络的维度划分。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Modelling of a MAC protocol for mobile M2M communications
Machine-to-machine (M2M) communications is one of the enabling technologies for connecting massive number of devices to the Internet of Things (IoT). M2M communications have different characteristics than human-to-human (H2H) communications. In this work, we assume that the machines are mobile, as a result, the number of machines served by the network is variable. We consider a contention-based MAC protocol for M2M communications. The transmissions are organized into frames and each machine is assumed to generate probabilistically one or zero packet per frame. The machines have been divided into different types according to their packet generation probabilities. We assume that a machine will attempt transmission of a packet until it generates a new packet. A packet will be lost if it hasnot been successfully transmitted by the time the machine generates a new packet. We have derived packet loss probability for each type of machines. The numerical results show that very low packet loss probability may be achieved for a wide range of traffic load. The results of this paper may be used in the dimensioning of M2M networks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信