Radio Frequency IDentification (RFID) systems are becoming more and more popular in the field of ubiquitous computing, in particular for objects identification. An RFID system is composed by one or more readers and a number of tags. One of the main issues in an RFID network is the fast and reliable identification of all tags in the reader range. The reader issues some queries, and tags properly answer. Then, the reader must identify the tags from such answers. This is crucial for most applications. Since the transmission medium is shared, the typical problem to be faced is a MAC-like one, i.e. to avoid or limit the number of tags transmission collisions. We propose a protocol which, under some assumptions about transmission techniques, always achieves a 100 perfomance. It is based on a proper recursive splitting of the concurrent tags sets, until all tags have been identified. The other approaches present in literature have performances of about 42 in the average at most. The counterpart is a more sophisticated hardware to be deployed in the manufacture of low cost tags.
This paper analyses the practical faults existing in enhanced dynamic frame slotted ALOHA (EDFSA) algorithms, and discusses the strategy to improve the efficiency of anti-collision algorithm in RFID system. EDFSA algorithm divides the tags into a number of groups and allows only one group of tags to respond when the number of tags is much larger than optimal efficiency tags. However the efficiency of the system can still be improved. We propose a new anti-collision algorithm called by the name of variant enhanced dynamic frame slotted ALOHA algorithm (VEDFSA) to improve the efficiency of the system that can solve the problem above by dynamic divide tags into groups during the anti-collision solving procedure. In RFID system, one of the problems that we must solve is the collision between tags which lowers the efficiency of the RFID system. One of the popular anti-collision algorithms is ALOHA-type algorithms, which are simple and shows good performance when the number of tags to read is small. However, they generally require exponentially increasing number of slots to identify the tags as the number of tag increases. In the paper, we propose a new anti-collision algorithm called enhanced dynamic framed slotted ALOHA (EDFSA) which estimates the number of unread tags first and adjusts the number of responding tags or the frame size to give the optimal system efficiency. As a result, in the proposed method, the number of slots to read the tags increases linearly as the the number of tags does. Simulation results show that the proposed algorithm improves the slot efficiency by 85 spl sim 100 compared to the conventional algorithms when the number of tags is 1000. Radio frequency identification systems with passive tags are powerful tools for object identification. However, if multiple tags are to be identified simultaneously, messages from the tags can collide and cancel each other out. Therefore, multiple read cycles have to be performed in order to achieve a high recognition rate. For a typical stochastic anti-collision scheme, we show how to determine the optimal number of read cycles to perform under a given assurance level determining the acceptable rate of missed tags. This yields an efficient procedure for object identification. We also present results on the performance of an implementation. Adding frame structure to slotted ALOHA makes it very convenient to control the ALOHA channel and eliminate instability. The frame length is adjusted dynamically according to the number of garbled, successful, and empty timeslots in the past. Each terminal that has a packet to transmit selects at random one of the n timeslots of a frame. Dynamic frame length ALOHA achieves a throughput (expected number of successful packets per timeslot) of 0.426 which compares favorably with the 1 e ( .368) upper bound of ordinary slotted ALOHA.