Anti-collision Algorithm Research Articles

A Novel RFID Anti-Collision Algorithm based on Binary Tree

The method to deal with the tag collision in RFID system can be directly called “Multiple Access”. According to the ideas of these different anti-collision algorithms, they can be divided into two categories. One is the binary tree algorithm based on deterministic; the other is the statistical-based ALOHA algorithm. Overall, however, there is still room for improvement on anti-collision algorithm path optimization and communication complexity,. This paper focuses on binary tree algorithm. After analysis of the basic binary tree algorithm, dynamic binary tree algorithm, Trajan binary tree algorithm, paper propose a novel binary tree algorithm based on the dichotomy. Simulation performance shows that there have upgraded path optimization and communication efficiency

An Efficient Adaptive Anticollision Algorithm Based on 4-Ary Pruning Query Tree

In radio frequency identification system (RFID), the efficiency in which the reader identifies multiple tags is closely related to the methods to solve the collision of multiple tags. At present, a reasonable solution is the introduction of 4-ary query tree (or n-ary query tree) to reduce the collision time slots and additional query is used to decrease idle timeslots. The advantage of a 4-ary tree anti-collision algorithm is that it is able to reduce collision timeslots, but it also increases the idle timeslots. To reduce these excessive idle timeslots the 4-ary tree anticollision algorithm brings, an anti-collision algorithm based on adaptive 4-ary pruning query tree (A4PQT) is proposed in this paper. On the basis of the information of collision bits, some idle timeslots can be eliminated through pruning the 4-ary tree. Both theoretical analysis and simulation results support that A4PQT algorithm can significantly reduce recognition time and improve throughput of the RFID system.

Anti-collision Algorithm for RFID Based on Continuous Collision Detection

Tag estimation can improve the throughput of the UHF passive RFID systems. It plays an important role in anti-collision algorithm. In order to reduce the complexity of the estimation algorithm and the hardware support, a new algorithm based on the continuous detection mechanism has been proposed. According to the different probability of the collision and idle, the number of the continuous detected slots must be set independently. This scheme can simplify the system and reduce the extra consumption by less detecting timeslot. Simulation results indicate the proposed scheme can improve the efficiency without complicate system. DOI: http://dx.doi.org/10.11591/telkomnika.v11i12.3661 Full Text: PDF

Positioning of Logistics based on RFID and Integrated Sharing System

As logistics system becomes more complex, identifying and tracking a certain product or pallet in the whole process based on RFID in a real-time manner has played an important role. This study is focusing on identification, locating, tracking and dynamic management on logistics by using RFID technology. Firstly, an innovative scheme for the identification of an individual physical object through Web service is proposed. Then, an anti-collision framed slotted Aloha algorithm for the multiple tags simultaneously sensing is discussed. In addition, a selection sequence optimizing model via RFID technology is developed, and numerical analysis is made to explain the model. Finally, an RFID-based framework of dynamic logistics management system is put forward in order to realize logistics processes automatically verified and operation optimized. DOI: http://dx.doi.org/10.11591/telkomnika.v11i12.3664 Full Text: PDF

응답 라운드 조기종료와 전송확률 제어를 통한 STAC 프로토콜의 성능 개선

Auto-ID 센터에서는 13.56MHz RFID 시스템에서 다중 태그를 식별하기 위한 충돌 방지 알고리즘으로 STAC 프로토콜을 제안하였다. STAC 프로토콜에서는 다음 응답 라운드의 슬롯 개수를 결정하기 위하여 태그 수 추정 기법을 적용한다. 이 경우 추정한 태그의 수에 오차가 발생하면 충돌 또는 빈 슬롯이 많이 발생할 수 있으므로 식별 성능이 저하되는 문제점이 있다. 따라서 본 논문에서는 응답 라운드 동안 빈번한 충돌 또는 빈 슬롯이 발생하면 응답 라운드를 종료하는 기법과 태그의 전송확률을 제어하는 기법을 적용한 ERPB 알고리즘을 제안하고, 이에 대한 성능을 분석한다. 시뮬레이션을 통한 성능분석의 결과, 제안한 기법은 충돌률이 STAC 프로토콜에 비하여 39% 정도 낮으므로 태그 식별 시간이 짧음을 알 수 있었다. In 13.56MHz RFID system of Auto-ID center, STAC protocol is defined as an anti-collision algorithm for multiple tag reading. In STAC protocol, the reader uses the tag number estimation scheme to determine the number of slots for the next reply round. If errors occur in the estimated number of tags, the identification performances will be degraded due to a lot of collision or idle slots. Therefore, in this paper, we propose an ERPB algorithm that the reader cancels the reply round when it experiences a series of collision or idle slots during the current round. The transmission probability control for the tag is also applied to the proposed algorithm. Through simulations, it is demonstrated that the collision rate for the proposed scheme is about 39% lower than STAC protocol. Therefore, the proposed scheme can achieve faster tag identification time compared with STAC protocol due to the low collision rate.

RFID 시스템에서 효율적인 분리를 이용한 충돌 방지 알고리즘

RFID 시스템에서, 리더의 인식영역에서 다수의 태그를 인식하는 과정에서 충돌이 발생하게 된다. 하나의 리더에게 두 개 또는 여러 태그가 응답하여 충돌이 발생하게 되며, 리더는 태그를 인식하지 못하는 일이 발생한다. 이런 충돌로 인해 리더는 인식영역 안에 있는 모든 태그를 인식하기 위한 시간이 길어지며, 이 경우 리더는 태그를 인식하지 못하는 경우가 발생된다. 리더는 인식영역 안의 모든 태그를 빠르게 인식할 수 있는 충돌 방지 알고리즘이 필요하다. 제안된 알고리즘은 태그의 응답을 효율적인 분리를 이용하여 태그 그룹으로 나누어 충돌을 회피한다. 또한, 제안된 알고리즘은 태그 아이디의 모든 비트를 알지 못해도 태그를 인식할 수 있다. 효율적인 분리를 통해 예측을 하여 리더로 부터의 응답 수를 줄인다. In the RFID system, multiple tags respond in the process of identifying multiple tags in the reader's interrogation zone, resulting in collisions. Tag collision occurs when two or more tags respond to one reader, so that the reader cannot identify any tags. These collisions make it hard for the reader to identify all tags within the interrogation zone and delays the identifying time. In some cases, the reader cannot identify any tags. The reader needs the anti-collision algorithm which can quickly identify all the tags in the interrogation zone. The proposed algorithm efficiently divides tag groups through an efficient separation to respond, preventing collisions. Moreover, the proposed algorithm identifies tags without checking all the bits in the tags. The prediction with efficient separation reduces the number of the requests from the reader.

RFID anti-collision algorithm based on tags grouping

A new tags anti-collision algorithm was proposed for the reader collision problems in the Radio Frequency IDentification(RFID) technology.It divided tags into groups based on the coset partition theory,and restricted each group to response in a fixed timeslot.According to the query codes and collision flag bits,the reader could identify a group of tags in one slot.The Matlab simulation results show that,compared with the binary search algorithm and dynamic frame timeslot algorithm,the proposed algorithm improves the slot utilization and throughput when the number of tags is large.

An Improved Anti-Collision Algorithm Based on Binary in RFID System

How effective and efficient to deal with the collision of tag identification is an important issue in RFID systems. In this paper, based on the existing binary anti-collision algorithm, added a sleep status bit to reduce data redundancy of readers sending commands and reduce the number of sending command by changing the order of search tag which the reader sent, and got an improved algorithm. Then used MATLAB to simulate this algorithms advantages in data amounts and sending times.

An RFID anti-collision algorithm with dynamic condensation and ordering binary tree

In many RFID applications, the reader repeatedly identifies the same staying tags. Existing anti-collision protocols can rapidly identify the staying tags by remembering the order in which the tags...

An Improved Anti-collision Algorithm Based on JDS

With the emergence of active tags and RFID technology used in the fast-moving objects, readers need urgently to read and write tags in limited time. Anti-collision algorithms resolve the problem of a number of tags at the same time to communicate with the reader. Traditional anti-collision algorithm is to minimize recognition time and improve search efficiency under the conditions of maintaining a certain complexity. In this paper, we propose an improved anti-collision technique based on IPA and JDS algorithms. The improvement is achieved thanks to use jumping-back strategy. This latter reduces considerably the responding tag’s numbers and therefore, decreases the probability of bit’s collision. The simulation results shows, the reduced IPA anti-collision algorithm reduce frequency and the number of bits of the reader queries and label response significantly.

An ALOHA-based improved anti-collision algorithm for RFID systems

Tag collision arbitration is considered as one of the critical issues in RFID system design. In order to further improve the identification efficiency of tag anti-collision algorithms in RFID systems, several types of dynamic framed slotted ALOHA (DFSA) anti-collision algorithms are analyzed, and a new anti-collision algorithm is proposed. The proposed algorithm has the ability of identifying the time slot distribution which is selected by the tags within a reader's interrogation range in advance. Then the free time slots will be skipped when the reader queries each time slot. Also, the colliding tags will be immediately processed with additional time slots. Simulation results show that the proposed algorithm takes fewer total number of time slots and has a higher efficiency of tag identification compared to the other four DFSA anti-collision algorithms.

A Segment Collision Inversion Protocol for RFID Tag Reading

This paper presents a novel tag identification mechanism called the Collision Inversion (CI) method, that identifies the transmission tag IDs by their collided bits. Based on the CI method, anti-collision protocols coined the Pure Collision Inversion Protocol (PCIP) and the Segment Collision Inversion Protocol (SCIP) are proposed. Theoretical analysis shows that the identification efficiency of PCIP is decided by the ID length and the tag number. SCIP combines the identification mechanism of traditional tree-based protocol with PCIP, and becomes flexible and efficient. Compared to the mainstream protocols like the Query Tree (QT) Protocol, Jumping and Dynamic Searching (JDS) Protocol and New Enhanced Anti-Collision Algorithm (NEAA), simulation results show that SCIP can reduce both the identification delay and the average energy consumption.

Novel anti-collision algorithm of RFID sensor system for Internet of things

The system of Internet of Things(IoT) based on ultra high frequency Radio-Frequency-IDentification(RFID) usually needs multiple readers to work simultaneously in the same area.Multi-reader collision takes place under this multi-reader environment,which will affect the system performance.Based on backscatter modulation,Signal to Interference Ratio(SIR) was selected as the measurement of communication quality,and the reader anti-collision algorithm based on power control and backoff algorithm was proposed in this paper.Readers dynamically adjust their transmission power according to SIR,to ensure the detection range and to reduce redundancy of their coverage area for anti-collision.Considering that some target SIR may not be achieved yet when the transmit power is adjusted to maximum,a new backoff algorithm was proposed.In backoff process,the reader reduced its power actively,and kept it for some time which is mapped into the proportion of target SIR iteration.The simulation results show the reader can adjust the power with fast convergence,and improve the real-time and reliability of RFID system.The backoff algorithm ensures the fairness of channel occupation.More importantly,it can reduce the power consumption,which is important for mobile readers.The reader anti-collision algorithm can effectively reduce redundancy of their coverage area and thereby minimize the reader collision,but also can ensure the detection range and thereby enhance read rate.

New group-based processing tag anti-collision algorithm for RFID system

Concerning long length of identification time and large amounts of data transmission in some binary search schemes,a new anti-collision algorithm was proposed.The algorithm adopted grouping strategy,and all tags in each subset were identified by reader in order.The grouping strategy could reduce the quantity of responding tags in each query and the probability of collision.On the other hand,tag ID was divided into two segments,the first seven bits were the first part and the remaining bits were the second part.Therefore,the transmission of redundant data could be reduced.The simulation results show that,compared with several other algorithms,the proposed algorithm has fewer searching times,and the data transmission is only one-sixth of Dynamic Binary Search Tree(DBS) algorithm.Thus,the identification efficiency of the proposed algorithm is significantly improved.

Research on Food Safety RFID Anti-Collision Algorithm

As an effective way to control the quality and safety of agricultural products, traceability system is aroused growing world attention. On the purpose of retrospective quality, this paper constructs a food safety management and quality traceability system from IT view. The paper makes a detail analysis of implementation process of RFID Anti-collision algorithm. This paper produces details about the anti-collision mechanism in tags identification and proposes a dynamic frame time slot anti-collision algorithm, which fulfils the function of tags identification in system food safety quality trace.

A semi-blocking algorithm on adaptive query splitting for RFID tag identification

Radio frequency identification (RFID) is a promising wireless technology for using tiny, remotely powered chips as identifiers. The number of RFID applications is rapidly increasing because RFID technology is convenient, fast, and contactless. However, collisions occur when multiple tags simultaneously transmit their IDs. Therefore, an efficient anti-collision algorithm is needed to accelerate tag identification. In some applications, the reader may repeatedly identify staying tags, which constantly exist in the reader's range. The adaptive query splitting algorithm (AQS) was proposed for reserving information obtained from the last identification process to enable rapid re-identification of staying tags. However, since AQS is a non-blocking algorithm that allows newly arriving tags to use the slots reserved for staying tags, collisions among them are problematic. Thus, semi-blocking AQS (SBA) proposed in this study is designed to reduce the collisions between arriving tags and staying tags by applying a semi-blocking technique in which only a minority of arriving tags use the slots reserved for staying tags. By counting the number of minor arriving tags, SBA estimates the number of unrecognized arriving tags and generates proper queries to minimize their collisions. The identification delay of SBA is analyzed, and simulation results show that SBA significantly outperforms AQS.

An RFID anti-collision algorithm with dynamic condensation and ordering binary tree

In many RFID applications, the reader repeatedly identifies the same staying tags. Existing anti-collision protocols can rapidly identify the staying tags by remembering the order in which the tags were recognized in the previous identification process. This paper proposes a novel protocol, dynamic blocking adaptive binary splitting (DBA), based on the blocking mechanism, which prevents the newly-arriving tags from colliding with the staying tags. Moreover, DBA utilizes a dynamic condensation technique to reduce the number of idle slots produced when recognized tags leave. Following the condensation process, multiple staying tags may be required to share the same slot, and thus may cause collisions among them. Accordingly, an efficient ordering binary tree mechanism is proposed to split the collided tags deterministically according to the order in which they were recognized. The analytical and simulation results show that DBA consistently outperforms previous algorithms in all of the considered environments.

Based on RFID Technology of High-Speed Mobile Multi-Objective Binary Tree Anti-Collision Algorithms

In the RFID radio frequency identification system, multiple targets at high speed mobile position data transfer at the same time of channel conflict, and solving multi-objective channel conflict is the most effective method is through the anti-collision algorithm. This article will analysis RFID technology in high speed moving target in the cause of the conflict, this paper introduces the existing anti-collision algorithm and its related optimization algorithm, the paper proposes a kind of suitable for high speed mobile multi-objective binary anti-collision search algorithm for continuous collision position for parity coding mode group, through to the conflict area target estimate size to reduce the number of queries to the effective time identify multiple high-speed moving targets, can better in high speed moving target recognition application. Maltab simulation results show that the proposed algorithm outperforms the other binary tree anti-collision algorithm in effective recognition time etc are obviously improved.

An Improved RFID Anti-Collision Algorithm

The dynamic bit-locking backoff (DBLBO) anti-collision algorithm was proposed on the basis of bit-locking backoff (BLBO) anti-collision algorithm . If there is only one collision bit When the reader is searching the locked collision bit , the reader can identify directly without queries.The proposed algorithm gives full consideration to the number of queries and throughput of the system.The analysis on simulation result indicates that DBLBO performs significantly better than the existing BLBO anti-collision algorithms. It is suitable for the RFID anti-collision protocol in a greater deal.

A Simulation Research of Binary Anti-Collision Algorithms in RFID System

An Anti - collision Algorithms technique would be required in RFID system to reduce conflicts and identify several tabs very quickly and accurately.Binary Search algorithm in a TDMA system is the most usual type of Anti - collision Algorithms in RFID System. This paper puts forward programming and simulating by using MATLAB based on EPCs Binary Search algorithm .Finally the results are compared and analyzed at the end of the paper and the author gives some pieces of advice.