Abstract

The dynamic frame slot ALOHA (DFSA) algorithm is a typical anti-collision. For the shortcomings of DFSA algorithm, this paper presents an improved algorithm - IDFSA. On the one hand, IDFSA algorithm to improve the label estimation algorithm, so as to achieve dynamic adjustment. On the other hand, through the analysis of mathematics, the new grouping of labels is improved, and the phenomenon of landslide is improved. The simulation results show that the throughput of IDFSA algorithm is higher, and the total operations time is less. RFID (radio frequency identification, RFID) is widely used in logistics, identification, anti-theft and other fields. A traditional RFID system mainly includes two parts: the reader and the tag. In the case of the number of tags more dense, the reader must use the anti-collision to identify the individual tags. So, anti collision algorithm is very important in multi label application field. Tag anti-collision protocols (1) can be categorized into two groups: probabilistic anti-collision methods and deterministic anti-collision methods. The probabilistic anti-collision methods are Aloha-based protocols (2) such as pure Aloha protocol, Slotted ALOHA (SA) protocol, Framed Slotted ALOHA (FSA) protocol and Dynamic Framed Slotted ALOHA (DFSA) (3, 4) protocol. In this paper, an improved dynamic frame slot ALOHA (IDFSA) algorithm is proposed. 2. Related work Frame slotted ALOHA algorithm will be a plurality of time slots set as a frame, for a fixed frame length, when the tag number is less than the length of the frame appears waste the time slot, when the frame length is less than or equal to the number of tags conflict too frequent . In view of this situation, according to the number of tags in the reader range, dynamic adjustment of the next frame length, by a decrease or increase the length of the frame, you can solve the slot waste and tag identification time increased, this method is called dynamic frame slotted ALOHA (DFSA). The analysis of DFSA algorithm shows that the throughput of the system is mainly determined by the estimation of the number of tags and the adjustment of the frame length. The estimation of the number of tags plays a key role in the performance of the algorithm. At present, there are three kinds of label estimation algorithms, Vogt, Schoute and Lowbound

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call