Improve of dynamic framed slotted ALOHA algorithm
动态帧时隙ALOHA算法的改进

When using the dynamic framed slotted ALOHA algorithm, the defect is that the necessary time slot increases too fast with the increase of tags. But in reality, the time slot cannot increase indefinitely due to the hardware restraint. To make it better, this paper proposed three improved aspects as follows. First, it used hash function to distribute the time slot to different tags. Then, it used three-dimensional method to estimate the amount of tags in order to adjust the length of frame for next cycle. After adjustment it could be best resulted when the frame length was 1.7 times of the amount of tags. The experiment result shows that with the same amount of tags, this algorithm interpreted in this article uses the least time slots.