摘要
动态帧时隙ALOHA算法在标签数增加过多的情况下,所需时隙数增长过快;而由于硬件限制,时隙数不能无限增长。为改进此不足,可从以下三个步骤优化算法。首先根据hash函数进行时隙分配,将标签分配到不同的时隙;其次根据三维估计方法估计标签数,为下一周期调整帧长做准备;最后根据估计到的标签数调整帧长,当帧长为标签数的1.7倍时,识别效果最好。实验结果表明,标签数相同的情况下,本算法所用的时隙数最少。
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.
出处
《计算机应用研究》
CSCD
北大核心
2012年第3期907-909,共3页
Application Research of Computers
基金
河北省自然科学基金资助项目(F2010000142)
关键词
动态帧时隙ALOHA
时隙分配
标签估计
帧长
dynamic framed slotted ALOHA
slot assignment
tag estimation
frame length
