摘要
针对EPC G1G2标准中的动态帧时隙防碰撞算法,在标签数量较多时,会导致Q值频繁的更改,从而增加了阅读器的负担等问题,提出一种以碰撞、空闲和成功时隙的差值,作为判断Q值改变门限的DTJ(Devalue Threshold Judgment)-ALOHA算法。通过Matlab仿真与EPC中算法做对比,验证了DTJ-ALOHA算法无论在Q值改变次数、平均吞吐率,还是阅读器的开销上都优于常见改进算法。
In the dynamic frame slot ALOHA in the EPC G1G2 standard, when the number of tags is large, the Q value frequently changes, thereby increasing the burden on the reader and other problems. DTJ-ALOHA algorithm is proposed, which takes the difference of the collision, idle and success slots as the threshold to judge the Q value. Compared with the EPC algorithm through Matlab simulation, it is proved that the DTJ-ALOHA algorithm is better than the common improved algorithm in terms of the number of change of Q value, the average throughput, and the cost of the reader.
出处
《计算机应用与软件》
2017年第6期303-308,共6页
Computer Applications and Software
