说明：  动态帧时隙ALOSH算法在标签数增加过多的情况下，所需时隙数增长过快；而由于硬件限制，时隙数不能无限增长。为改进此不足，可从以下三个步骤优化算法。首先根据hash函数进行时隙分配，将标签分配到 不同的时隙；其次根据三维估计方法估计标签数，为下一周期调整帧长做准备；最后根据估计到的标签数调整帧长，当帧长为标签数的1.7倍时，识别效果最好。实验结果表明，标签数相同的情况下，本算法所用的时隙数最少。
(Dynamic frame slot ALOSH algorithm to increase the number of tags excessive case, the required number of slots excessive growth rather due to hardware limitations, the number of slots can not grow indefinitely. To improve this deficiency can be obtained from the following three steps optimization algorithm. First hash function for slot allocation based on the label assigned to the Different time slots secondly dimensional estimation method based on the estimated number of labels, adjust the frame size for the next cycle to prepare Finally, according to the estimated number of tags to adjust the frame length, when the frame length is 1.7 times the number of tags to identify the best . Experimental results show that under the same number of labels, the present algorithm used in the least number of slots.)