摘要
ALOHA算法是射频识别(RFID)系统中普遍使用的防冲突算法,由于标签发送数据具有盲目性,使得系统的吞吐率并不高;因此提出一种基于P—坚持CSMA的防冲突算法,即根据标签发送数据的数量,动态的调整数据帧内某个时隙的标签发送数据概率值p,以提高系统的吞吐率;文中详细阐述了该算法的主要思想,并建立数学模型对算法进行分析;结果表明在识别多个标签时,基于P—坚持CSMA防冲突算法的系统吞吐率明显高于ALOHA防冲突算法。
ALOHA anti-collision algorithms are widely used in the RFID system.Since the blindness of data tags sending,the throughput of the system is generally very low.Therefore,in this paper we proposed an anti-collision algorithm based on the p-persistent CSMA. According to amount of data tags sending,the method dynamically change p values that data tags send in a slot of a data frame to improve the system throughput.In this paper,we elaborated the algorithm design process in detail and established a mathematical model to analysis this method.The experimental results show that throughput of the system in anti-collision algorithm based on the p-persistent CSMA is significantly higher than ALOHA anti-collision algorithms when identifies multiple tags.
出处
《计算机测量与控制》
北大核心
2013年第12期3322-3324,共3页
Computer Measurement &Control