检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王忠锋[1,2,3] 张楠[1,2,3,4] 夏长清[1,2,3] 尚志军 田宇 金曦[1,2,3] 许驰[1,2,3] WANG Zhong-feng;ZHANG Nan;XIA Chang-qing;SHANG Zhi-jun;TIAN Yu;JIN Xi;XU Chi(Key Laboratory of Networked Control Systems,Chinese Academy of Sciences,Shenyang 110016,China;Shenyang Institute of Automation,Chinese Academy of Sciences,Shenyang 110016,China;Institutes for Robotics and Intelligent Manufacturing,Chinese Academy of Sciences,Shenyang 110169,China;University of Chinese Academy of Sciences,Beijing 100049,China)
机构地区:[1]中国科学院网络化控制系统重点实验室,沈阳110016 [2]中国科学院沈阳自动化研究所工业控制网络与系统研究室,沈阳110016 [3]中国科学院机器人与智能创造创新研究院,沈阳110169 [4]中国科学院大学,北京100049
出 处:《小型微型计算机系统》2023年第1期204-210,共7页Journal of Chinese Computer Systems
基 金:国家重点研发计划项目(2018YFB1700100)资助;国家自然科学基金项目(61903356,61972389,61803368)资助;辽宁省自然科学基金项目(2020-MS-034)资助;中国博士后科学基金项目(2019M661156)资助;中国科学院青年创新促进会项目(2020207)资助。
摘 要:工业无线系统中网络资源受限,如何确保大量控制指令的实时传输是工业无线网络面临的关键问题.聚合传输是提高网络资源利用率的有效手段,然而,现有方法主要面向树状拓扑网络,未考虑数据流目的节点不同导致的解聚点延迟问题,在网状拓扑中聚合后的网络系统实时性难以保障.为此,本文研究网状拓扑下的工业实时聚合调度问题,首先提出了考虑数据包聚合的最短截止时间算法(EDF-PA),EDF-PA在路径重叠区域采用被动聚合等待的方式对数据包进行聚合,以降低数据流间的传输冲突;在此基础上,为进一步提高重叠区域数据包聚合度,本文提出了一种改进的聚合调度算法(EDF-OPA),EDF-OPA采用主动聚合等待的方式,以数据流可调度性为约束,最大化特定重叠区域的数据包聚合度.仿真结果表明,本文提出的EDF-OPA算法可以有效提高工业无线系统性能,相比传统聚合调度方法的调度成功率可提升35%,在网络丢包严重时,性能仍可提升20%.Network resources are limited in industrial wireless systems.Ensuring the real-time transmission of a large number of control commands is a key problem in industrial wireless networks.Aggregated transmission is an effective technology to improve utilization of network resources.However, the existing methods are mainly oriented to tree topology networks, and do not consider the delay at disaggregation nodes caused by different destination nodes of flows.Therefore, the real-time performance of the aggregated network system is difficult to guarantee in mesh topology.To this end, this paper studies the problem of industrial real-time aggregationscheduling in mesh topology.Firstly, the earliest deadline first algorithm(EDF-PA)considering aggregation is proposed.EDF-PA passively waits for packets to be aggregated in overlapping path to reduce transmission conflicts.On this basis, the paper proposes an optimized aggregation scheduling algorithm(EDF-OPA)to further improve the degree of aggregation in overlapping areas.EDF-OPA takes the schedulability of flows as constraint, and maximizes the degree of aggregation in specific overlapping areas by actively waiting for aggregation.The results show that EDF-OPA effectively improves the performance of industrial wireless systems.Compared with traditional aggregation method, the scheduling success rate can be increased by 35%.The performance can still be increased by 20% when the network packet loss is severe.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145