阵列系统中采集节点地址的动态分配方法  

Dynamic address allocation algorithm for acquisition node in array system

作　　者：蒋佳佳[1] 段发阶[1] 陈劲[1] 王凯[1] 张超[1] 常宗杰[1] 华香凝[1] 

机构地区：[1]天津大学精密测试技术及仪器国家重点实验室,天津300072

出　　处：《电路与系统学报》2013年第1期224-228,共5页Journal of Circuits and Systems

基　　金：国家自然基金(51275349;50375110);教育部新世纪优秀人才支持计划资助(NECT);天津市科技支撑计划重点项目(11ZCKFGX03600);天津市科技兴海专项基金(KX2010-0006)

摘　　要：为解决阵列勘探在现场铺设时,采集节点地址容易发生错乱的问题,提出了一种"流水线逐级增长"与"双次对比"相结合的动态分配方法,以实现在任何现场铺设条件下均能有序地设置所有采集节点的地址。基于阵列勘探的结构特点,使各个采集节点的地址以流水线的方式在同一时间内同时增加,从而实现采集节点地址的并行快速设置,缩短系统初始化的时间。同时采用对每个采集节点的地址进行两次对比设置的方法,提高节点地址被正确设置的可靠性。搭建了具有8个采集节点的实验系统,结果表明8个节点地址设置总时间为162.55 s,与理论分析一致,同时也证明了该方法的有效性。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.

关 键 词：勘探系统 动态设置 流水线 多通道 采集节点 

分 类 号：TP274.2[自动化与计算机技术—检测技术与自动化装置] TP872[自动化与计算机技术—控制科学与工程]