阵列系统中采集节点地址的动态分配方法
Dynamic address allocation algorithm for acquisition node in array system
蒋佳佳 1段发阶 1陈劲 1王凯 1张超 1常宗杰 1华香凝1
作者信息
- 1. 天津大学精密测试技术及仪器国家重点实验室,天津300072
- 折叠
摘要
为解决阵列勘探在现场铺设时,采集节点地址容易发生错乱的问题,提出了一种“流水线逐级增长”与“双次对比”相结合的动态分配方法,以实现在任何现场铺设条件下均能有序地设置所有采集节点的地址.基于阵列勘探的结构特点,使各个采集节点的地址以流水线的方式在同一时间内同时增加,从而实现采集节点地址的并行快速设置,缩短系统初始化的时间.同时采用对每个采集节点的地址进行两次对比设置的方法,提高节点地址被正确设置的可靠性.搭建了具有8个采集节点的实验系统,结果表明8个节点地址设置总时间为162.55μs,与理论分析一致,同时也证明了该方法的有效性.
Abstract
Address of collection node is confused easily when array exploration system is connected in the field.For this problem,a dynamic address allocation algorithm of"gradual growth based on pipeline" and "double contrast" is proposed to set address of collection nodes sequentially in array exploration system.Based on the structural features of array exploration system,address of each collection node grows at the same time to achieve quickly the set of address of nodes,which reduces the system initialization time.At the same time,security of address of nodes being set correctly is improved through the method of comparing the address of nodes in twice address allocation.An experimental system with eight collection nodes is established,and experimental results show that the set total time of address of eight nodes is 162.55μs,which is consistent with the theoretical analysis and demonstrate the effectiveness of the address allocation algorithm.
关键词
勘探系统/动态设置/流水线/多通道/采集节点Key words
exploration system/dynamic allocation/pipeline/multi-channel/acquisition node引用本文复制引用
基金项目
国家自然科学基金(51275349)
国家自然科学基金(50375110)
教育部新世纪优秀人才支持计划(NECT)
天津市科技支撑计划重点项目(11ZCKFGX03600)
天津市科技兴海专项基金(KX2010-0006)
出版年
2013
NETL
NSTL
维普
万方数据