摘要
工业互联网平台主机对数据样本的接收吞吐量水平,受数据样本自身能耗和时隙分配性能的影响。为优化工业互联网数据链路体系对传输信息的配准能力,设计基于哈希算法的工业互联网低功耗数据链时隙分配系统。根据哈希算法原理,求解压缩函数表达式,借助海绵结构确定数据样本传输序列,完成哈希算法基本原理研究与整体结构设计。利用汇接控制器与数据循环结构,计算功耗数据链路的信息承载能力,联合数据样本参量,确定静态时隙分配与动态时隙交换标准,完成基于哈希算法的工业互联网低功耗数据链时隙分配系统执行方案设计。对比实验结果:基于哈希算法的时隙分配系统可将平台主机对数据样本的接收吞吐量提升至8.8×10^(10) MB/s,在提升工业互联网数据链路体系对信息配准能力方面具有较好的应用价值。
The receiving throughput level of the industrial Internet platform host to the data samples is affected by the energy consumption of the data samples and the slot allocation performance.In order to optimize the registration ability of industrial Internet data link system for transmission information,a low⁃power industrial Internet data link slot allocation system based on Hash algorithm is designed.According to the principle of Hash algorithm,the expression of decompression function is obtained,and the transmission sequence of data samples is determined with the help of sponge structure.The basic principle of Hash algorithm and the overall structure design are completed.Using the tandem controller and data circulation structure,the information carrying capacity of the power consumption data link is calculated,and then the data sample parameters are combined to determine the static time slot allocation and dynamic time slot exchange standards,and the implementation scheme design of the industrial Internet low power consumption data link time slot allocation system based on the Hash algorithm is completed.Comparative experimental results:the time slot allocation system based on the Hash algorithm can improve the receiving throughput of the platform host to the data samples to 8.8×10^(10) MB/s,which has good application value in improving the information registration ability of industrial Internet data link system.
作者
马孟
MA Meng(Zhengzhou Motor Vehicle Quality Monitoring and Certification Technology Research Center Co.,Ltd.,Zhengzhou 451450,China)
出处
《电子设计工程》
2024年第2期102-106,共5页
Electronic Design Engineering
关键词
哈希算法
工业互联网
低功耗数据链
时隙分配
海绵结构
数据吞吐量
Hash algorithm
industrial Internet
low power data link
time slot allocation
sponge structure
data throughput