CAJ | 학술논문

提出了一种自适应多叉树防碰撞算法，该算法构建了无碰撞时隙的二叉查询树，通过计算碰撞因子估计标签数量，从而自适应的选择二叉树或四叉树。理论和仿真表明：该算法克服了现有算法数据传输量大的缺点，同时在二叉树分支内实现了无碰撞时隙以减少总时隙，对多标签情况下，通过自适应的选择四叉碰撞树来减少碰撞时隙。算法有效地减少了数据传输量，提高了时隙利用率和系统吞吐率，具有一定的创新性。
제출료일충자괄응다차수방팽당산법，해산법구건료무팽당시극적이차사순수，통과계산팽당인자고계표첨수량，종이자괄응적선택이차수혹사차수。이론화방진표명：해산법극복료현유산법수거전수량대적결점，동시재이차수분지내실현료무팽당시극이감소총시극，대다표첨정황하，통과자괄응적선택사차팽당수래감소팽당시극。산법유효지감소료수거전수량，제고료시극이용솔화계통탄토솔，구유일정적창신성。
An adaptive query multi-tree anti-collision algorithm is proposed. The new algorithm computes the collision factor and estimates the number of the tags so that it can adaptively use the binary-tree or the quad-tree. The theory and simulation show that the new algorithm overcomes big data transmission by constructing collision-tree. It also can reduce total slots by reducing slot-free in the binary-tree and using adaptive binary-tree or the quad-tree in the case of many tags. The new algorithm has certain innovations.