RFID (Radio frequency Identification) has become an efficient way to identify, track and/or trace objects and people. Its importance has motivated scientists and researchers to examine the challenges that are slowing ...
详细信息
ISBN:
(纸本)9781479935871
RFID (Radio frequency Identification) has become an efficient way to identify, track and/or trace objects and people. Its importance has motivated scientists and researchers to examine the challenges that are slowing its expeditious deployment in various applications. RFID collision is a major challenge imposed by the wireless links shared among a reader and the many tags in the interrogation zone. In most proposed anti-collision algorithms, tags reply randomly to time slots chosen by the reader. Since two or more tags may choose the same slot, this Random Access (RA) causes garbled data at the reader side;therefore, the identification process fails. In this paper, we propose a new anti-collision algorithm that adopts a novel method for eliminating the theory of RA to enhance system efficiency and to reduce both the number of rounds between reader and tag and the number of collided/empty slots over existing algorithms. In this algorithm, tags use modulo function to choose tag owned time slot. Another advantage of this method is that the reader estimates the next frame size and compares it with the previously selected frame sizes that are saved in the reader to ensure there is no redundancy. The performance of the algorithm is simulated and compared with existent Aloha family algorithms.
In the radio frequency identification technology system, there are too many time slots which are caused by tag collision, and the communication complexity is high. On the basis of the anti-collision algorithm of the b...
详细信息
In the radio frequency identification technology system, there are too many time slots which are caused by tag collision, and the communication complexity is high. On the basis of the anti-collision algorithm of the binary tree and the quadtree query tree, the methods of locking the collision bit and predicting the child node are used, a newlock-bit hybrid querytree (novel lock-bit hybrid query tree, NLHQT) algorithm is proposed. In the algorithm, the collision bit information is extracted through the lock instruction, and the extracted collision bit information is predicted. While reducing the collision time slot, the reader generates a new query prefix through prediction, thereby avoiding the generation of idle child nodes. Compared with the improved hybrid query tree (IHQT) anti-collision algorithm and the regression lock adaptive multi-tree search (RLAMS), the algorithm in this paper is more effective in reducing the total number of time slots and communication complexity, and the efficiency of identifying tags can be effectively improved.
In the field of RFID technology, a power efficient tag anti-collision protocol plays an important role in the entire system based on this technology. The query Tree scheme is one of the most important anti-collision p...
详细信息
ISBN:
(纸本)9781479974566
In the field of RFID technology, a power efficient tag anti-collision protocol plays an important role in the entire system based on this technology. The query Tree scheme is one of the most important anti-collision protocols for RFID technology. Researchers have developed different Query algorithm with improved features, each time reducing the number of query iteration and idle slots. The EPC Gen protocol uses this anti-collision algorithm, which is popularly known and globally accepted for its secured data transmission feature but having a huge load of data itself. Low power design and implementation of the anti-collision protocol is another challenging area for cost effective RFID system. In our research work, we have implemented the protocol as low power single chip solution. Furthermore, we have included a data security scheme in this protocol for secured data transmission. VHDL code has been used for design purpose, Xilinx ISE 14.3 simulation tools to simulate the design and Kintex-7 FPGA board for implementation purpose. We have also implemented other anti-collision protocols with different bit size and a comparative study of performance evaluation has been provided.
In the scenario of inventorying densely stacked tags, there exists an important problem of initial frame length selection in Radio Frequency Identification (RFID) dynamic frame slot anti-collision algorithm, a loaded ...
详细信息
The RFID system is the core technology of the future Internet of Things system and Industry 4.0, and the RFID anti-collision algorithm is the basis for realizing the communication between the tag and the reader. Aimin...
详细信息
ISBN:
(数字)9781665471565
ISBN:
(纸本)9781665471565
The RFID system is the core technology of the future Internet of Things system and Industry 4.0, and the RFID anti-collision algorithm is the basis for realizing the communication between the tag and the reader. Aiming at the problems of high computational complexity, low recognition efficiency and complex recognition process in existing RFID anti-collision algorithms in existing international standards, based on the query tree algorithm, combined with the extended bit transformation method, a relatively simple method is proposed. We propose a relatively simple anti-collision algorithm for RFID: Improved collision Tree based on Bit Transformation algorithm (ICTBTA). The simulation results show that the system efficiency of the tree algorithm proposed in this paper can be stabilized at more than 80%, and the efficiency of the currently used CT algorithm can be improved by more than 50%. Therefore, ICTBTA can be applied to common RFID passive tag identification systems.
RFID has become a key technology with the development of the Internet of Thing, its development and application is limited by the tag anti-collision technology which has become an urgent problem needs to be solved. In...
详细信息
ISBN:
(纸本)9780769549323
RFID has become a key technology with the development of the Internet of Thing, its development and application is limited by the tag anti-collision technology which has become an urgent problem needs to be solved. In this paper, the binary search algorithm and multi-state binary search algorithm are compared and analyzed in detail, and an anti-collision algorithm based on counting mechanism and multi-state binary(CMS) is proposed. By utilizing the obtained collision information collected from preprocessing, the supreme conflict counting mechanism is introduced into the multi-state binary search algorithm. Theoretical analysis and simulation results show that the proposed algorithm can greatly reduce the query search times, the length of reader's send command and tag's response command as well as the identification time.
RFID technology is an important technology of the Internet of Things. The key to realizing large-scale applications is to improve the efficiency of the system. For this reason, a novel RFID anti-collision Q-value algo...
详细信息
RFID technology is an important technology of the Internet of Things. The key to realizing large-scale applications is to improve the efficiency of the system. For this reason, a novel RFID anti-collision Q-value algorithm is proposed, which changes the Q-rounding of the original Q-value algorithm to 2Q rounding, so that the adjusted frame length is closer to the theoretical optimal value, thereby the convergence is effectively reduced. Slot utilization of time is improved. By comparison, the actual throughput of the improved algorithm remains at a high level (average is 0.311 3), the total number of time slots is reduced by 26.7% when it is compared with the original Q-value algorithm.
This paper presents a scalable uplink multiple access (SUMA) protocol for bistatic Wi-Fi backscatter systems, composed of a Wi-Fi reader, Wi-Fi helper, and multiple Wi-Fi backscatter tags. SUMA uses a Wi-Fi reader-ini...
详细信息
This paper presents a scalable uplink multiple access (SUMA) protocol for bistatic Wi-Fi backscatter systems, composed of a Wi-Fi reader, Wi-Fi helper, and multiple Wi-Fi backscatter tags. SUMA uses a Wi-Fi reader-initiated dynamic framed slotted ALOHA (DFSA)-based multiple access protocol to minimize collisions caused by simultaneous Wi-Fi backscatter uplink traffic from multiple Wi-Fi backscatter tags. In SUMA, the Wi-Fi helper first estimates the number of tags at the start of network operation and derives an appropriate slot-count parameter (i.e., Q), based on which the frame size is specified. Then, the Wi-Fi helper adaptively adjusts the value of Q to maximize network performance while continuously monitoring the number of remaining Wi-Fi backscatter tags to detect information. An experimental simulation was performed to verify the superiority of SUMA. The results demonstrated that SUMA obtained higher performance in terms of the number of collided and empty slots, delay, and throughput compared with the legacy DFSA approach adopted in the EPCglobal Class 1 Gen 2 standard.
In this paper, we propose an improved anti-collision technique based on the binary search algorithm. The improvement is achieved thanks to the manner of the requests' building. This latter reduces considerably the...
详细信息
In this paper, we propose an improved anti-collision technique based on the binary search algorithm. The improvement is achieved thanks to the manner of the requests' building. This latter reduces considerably the responding tag's numbers and therefore, decreases the probability of bit's collision. Further, the algorithm provides a noticeable advantage for the length of transmitted binary data compared against basic binary search and dynamic binary search algorithms. Besides, it provides same performance in terms of average request's number making the identification process faster, and the expose time of information is then reduced. (C) 2012 Elsevier GmbH. All rights reserved.
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 ...
详细信息
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. (C) 2013 Elsevier B.V. All rights reserved.
暂无评论