ISA100.11a的流量感知消息调度方法

Tran Nhon, Dong-Seong Kim
{"title":"ISA100.11a的流量感知消息调度方法","authors":"Tran Nhon, Dong-Seong Kim","doi":"10.1109/INDIN.2013.6622960","DOIUrl":null,"url":null,"abstract":"This paper proposes a new message scheduling method on shared timeslots of ISA100.11a to enhance real-time performance, called Traffic-Aware Message Scheduling (TAMS) method. Instead of competing to transmit sporadic messages in consecutive cycles, end-nodes are divided into parts, and then access the channel in the specific cycles when the probability of timeslots getting involved in collision exceeds a threshold. The simulation results indicate that the proposed method provides performance improvements in terms of throughput and end-to-end delay.","PeriodicalId":6312,"journal":{"name":"2013 11th IEEE International Conference on Industrial Informatics (INDIN)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Traffic-aware message scheduling method for ISA100.11a\",\"authors\":\"Tran Nhon, Dong-Seong Kim\",\"doi\":\"10.1109/INDIN.2013.6622960\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a new message scheduling method on shared timeslots of ISA100.11a to enhance real-time performance, called Traffic-Aware Message Scheduling (TAMS) method. Instead of competing to transmit sporadic messages in consecutive cycles, end-nodes are divided into parts, and then access the channel in the specific cycles when the probability of timeslots getting involved in collision exceeds a threshold. The simulation results indicate that the proposed method provides performance improvements in terms of throughput and end-to-end delay.\",\"PeriodicalId\":6312,\"journal\":{\"name\":\"2013 11th IEEE International Conference on Industrial Informatics (INDIN)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 11th IEEE International Conference on Industrial Informatics (INDIN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INDIN.2013.6622960\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 11th IEEE International Conference on Industrial Informatics (INDIN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INDIN.2013.6622960","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

本文提出了一种新的基于ISA100.11a共享时隙的消息调度方法,称为流量感知消息调度(Traffic-Aware message scheduling, TAMS)方法,以提高实时性能。该算法将终端节点分成若干部分,当发生碰撞的时隙概率超过一定阈值时,终端节点在特定的周期内访问信道,而不是在连续的周期内竞争传输零星的消息。仿真结果表明,该方法在吞吐量和端到端延迟方面都有显著提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Traffic-aware message scheduling method for ISA100.11a
This paper proposes a new message scheduling method on shared timeslots of ISA100.11a to enhance real-time performance, called Traffic-Aware Message Scheduling (TAMS) method. Instead of competing to transmit sporadic messages in consecutive cycles, end-nodes are divided into parts, and then access the channel in the specific cycles when the probability of timeslots getting involved in collision exceeds a threshold. The simulation results indicate that the proposed method provides performance improvements in terms of throughput and end-to-end delay.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信