Narrow Results

In RFID systems, many anti-collision algorithms, driven by the concept of rescheduling the response sequence between the reader and unidentified tags, have been put forward to solve tag collision problem, including ALOHA-based, tree-based and hybrid algorithms. In this paper, we propose a novel RFID anti-collision algorithm called EAQ-CBB, which adopts three main approaches: tag population estimation based on collided bit detection method, optimal partitions and trimmed query tree based on the strategy of collided block bit-mapping (QTCBB). The relatively accurate estimation of tag backlog and optimal partition ensure a great reduction of collisions in the initial phase. For each collided partition, a QTCBB process is introduced immediately, which eliminates all the empty slots and significantly reduces the collided slots. Simulation results show that EAQ-CBB performs good stability and scalability when the key parameters change. Compared with the existing algorithms, such as DFSA, QTI, T-GDFSA and CT, EAQ-CBB outperforms the others with high system throughput, low normalized latency and low normalized overhead at a low cost of energy, which makes it easier to be used widely in the efficient-aware and energy-aware applications.

Passive RFID has the advantages of rapid identification of multi-target objects and low implementation cost. It is the most critical technology in the Industrial Internet of Things information-gathering layer and is extensively applied in various industries, such as smart production, asset management, and monitoring. The signal collision caused by the communication between the reader/writer and tags sharing the same wireless channel has caused a series of problems, such as the reduction of the identification efficiency of the reader/writer and the increment of the missed reading rate, thus restricting the further development of RFID. At present, many hybrid anti-collision algorithms integrate the advantages of Aloha and TS algorithms to optimize RFID system performance, but these solutions also suffer from performance bottlenecks. In order to break through such performance bottleneck, based on the ISE-BS algorithm, we combined the sub-frame observation mechanism and the Q value adjustment strategy and proposed two hybrid anti-collision algorithms. The experimental results show that the two algorithms proposed in this paper have obvious advantages in system throughput, time efficiency and other metrics, surpassing existing UHF RFID anti-collision algorithms.

Nowadays, Radio Frequency Identification (RFID) systems are widely used in commercial applications such as warehouse management and automation control to identify the tagged goods or materials. When there existed multiple tags in the interrogation field of a transponder, the arbitration algorithm for RFID system is used to arbitrate all the tags to avoid the collision problem. A splitting algorithm which is called Binary Search Tree is well-known for multi-tags arbitration. In this paper, a Split-Merge Tree Algorithm is developed to reduce the cost of time and power on avoiding collision. Then, its performance is compared with Binary Search Tree according to time and power, the total time slots and tag replies needed for successfully arbitrating an RFID device, during the arbitration process. The results show that our model can reduce the time and power consumed to achieve a better performance.

This is where the English abstract should be placed. It should consist of one paragraph giving a concise summary of the material in the article below. Replace the title, authors, and addresses with your own title, authors, and addresses. You may have as many authors and addresses as you like. It is preferable not to use footnotes in the abstract or the title; the acknowledgments of funding bodies etc. are to be placed in a separate section at the end of the text.

This paper aims at RFID problem, propose an Anti-Collision Algorithm based on Gray Code. This algorithm simplifies the reader to search tag prefix by Gray Code regulation and to enhance the identification speed through efficient division of the collision tags. Branch the tag colliding efficiently to enhance the identification speed of tag. The findings from analysis of algorithm and simulation result demonstrate that BSGC can reduce the number of collision and transmission delay, enhance throughput rate and increase the efficiency of tag identification.

The tags' collision is a common problem in RFID (radio frequency identification) system. The problem has affected the integrity of the data transmission during the process of communication in the RFID system. Based on analysis of the existing anti-collision algorithm, a novel anti-collision algorithm is presented. The new algorithm combines the group dynamic frame slotted Aloha algorithm with code division multiple access technology. The algorithm can effectively reduce the collision probability between tags. Under the same number of tags, the algorithm is effective in reducing the reader recognition time and improve overall system throughput rate.