图书馆 | 所内网 | 所长信箱 | English | 中国科学院
站内搜索  
 
首 页 新闻 机构概况 机构设置 科研成果 研究队伍 研究生教育 国际交流 院地合作 学术期刊 创新文化 党群园地 科学传播
 
科研成果
概况介绍
论文
专著
专利
成果转化
研究所图库
园区一角南区办公楼实验楼(R楼)园区一角科研楼(A楼)自动化所鸟瞰自动化所正门
相关链接
ARP Email 所报
 您现在的位置:首页 > 科研成果 >论文
论文题目: Reliability and Temporality Optimization for Multiple Coexisting WirelessHART Networks in Industrial Environments
第一作者: Jin X(金曦);Kong FX(孔繁鑫);Kong LH(孔令和);Liu, W;Zeng P(曾鹏)
参与作者:
联系作者:
发表刊物: IEEE Transactions on Industrial Electronics
发表年度: 2017
卷,期,页: 64,8,6591-6602
论文出处:
第一作者所在部门:
论文编号:
论文摘要: WirelessHART is a networking technology that is widely-used in industrial wireless sensor networks. Its reliability and real-time performance are essential to industrial production. Many works have studied these two aspects, primarily focusing on a single WirelessHART network. However,multiple WirelessHART networks usually coexist in a real industrial environment. Applying existing approaches to such coexisting networks would cause performance degradation due to communication interference among these networks. In this paper, we propose a holistic framework that optimizes both reliability and temporality for multiple coexisting networks. The framework consists of two levels. The upper level targets communication channel management, and the lower level addresses data flow scheduling. For the upper level, we propose a network isolation algorithm that improves the data transmission reliability through dynamically adjusting channel assignments to different WirelessHART networks. For the lower level, we propose data flow scheduling algorithms that guarantee the temporality of data flows within each isolated network. These algorithms minimize the number of channels reserved by each isolated network and further enhance the transmission reliability through alleviating channel resource contention. We conduct trace-driven simulations of the channel management algorithm, and the results demonstrate that our algorithm exhibits stable performance and reduces packet loss by 36%. For the scheduling algorithms, the simulations demonstrate that in contrast with existing algorithms, the greater the number of coexisting networks, the fewer resources our algorithms use. When eight networks coexist, our algorithms outperform existing ones by consuming up to 63% fewer channel resources.
论文全文:
其他备注:
附件下载:
 
中国科学院沈阳自动化研究所 版权所有 1996-2009 辽ICP备05000867 联系我们
地址:中国辽宁省沈阳市东陵区南塔街114号 邮编:110016 留言反馈 网站地图