基于二叉扫描树的电调天线设备扫描算法  

A Scanning Algorithm for ALDs Based on Binary Scanning Tree

作　　者：李文生[1] 罗仁泽[2] 邓春健[1] 

机构地区：[1]电子科技大学中山学院,广东中山528402 [2]西南石油大学电气信息学院,成都610500

出　　处：《电子科技大学学报》2013年第4期597-602,共6页Journal of University of Electronic Science and Technology of China

基　　金：国家自然科学基金(61072073);广东省自然科学基金(S2012010010508)

摘　　要：针对ASIG协议的不足,提出了基于二叉扫描树的电调天线设备扫描算法。叶扫描阶段重用上一轮扫描的对应可读周期的扫描码,直接对可读结点进行扫描识别;根扫描阶段从根结点开始扫描,对新增设备扫描识别。通过利用自适应冲突避免机制和叶-根两阶段扫描方法,有效地减少了扫描过程中冲突次数。仿真实验表明,该算法能有效地减少电调天线设备扫描时间,提高了设备扫描识别效率。To solve the shortcomings of the AISG protocol, an antenna line device （ALD） scanning algorithm based on binary scanning tree is proposed. In leaf scanning phase for existing ALDs, leaf nodes are scanned directly with scanning codes corresponding to the identified nodes from the previous scanning, while in root scanning phase for new arriving ALDs, we start scanning from the root node. By utilization of an adaptive collision avoidance mechanism and the leaf-root scanning method, the collision frequency during ALD scanning is effectively reduced. The results of simulation show that the proposed algorithm can effectively shorten the ALD scanning time and increase the efficiency of ALD search.

关 键 词：AISG协议 电调天线设备扫描 二叉扫描树 冲突避免 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]