Artificial Bee Colony Algorithm for Reader Collision Problem in Radio Frequency Identification Network

2013 ◽  
Vol 10 (12) ◽  
pp. 2877-2883 ◽  
Author(s):  
Wei Liu ◽  
Ben Niu ◽  
Hanning Chen ◽  
Yunlong Zhu
2018 ◽  
Vol 8 (8) ◽  
pp. 1282 ◽  
Author(s):  
Nikola Cmiljanic ◽  
Hugo Landaluce ◽  
Asier Perallos

Radio Frequency Identification (RFID) is a technology that uses radio frequency signals to identify objects. RFID is one of the key technologies used by the Internet of Things (IoT). This technology enables communication between the main devices used in RFID, the reader and the tags. The tags share a communication channel. Therefore, if several tags attempt to send information at the same time, the reader will be unable to distinguish these signals. This is called the tag collision problem. This results in an increased time necessary for system identification and energy consumption. To minimize tag collisions, RFID readers must use an anti-collision protocol. Different types of anti-collision protocols have been proposed in the literature in order to solve this problem. This paper provides an update including some of the most relevant anti-collision protocols.


Author(s):  
Ching-Nung Yang ◽  
Jyun-Yan He ◽  
Yu-Ching Kun

A tag collision problem (or missed reads) in Radio Frequency Identification (RFID) system happens when multiple tags respond to a reader simultaneously. At this time, the reader cannot differentiate these tags correctly. This problem is often seen whenever a large volume of RFID tags are read together in the same radio frequency field. Tag collisions will degrade identification efficiency, and this unreliable identification will compromise the usefulness of RFID system. This chapter introduces tag collision problem and discusses tag anti-collision protocols, including ALOHA-based protocol, Binary Tree (BT) protocol, and Query Tree (QT) protocol. To date, most tag anti-collision protocols are QT protocols. Thus, in this chapter, the authors briefly describe some elegant researches on QT protocols, and also introduce their recent research results on QT protocols.


2016 ◽  
Vol 13 (10) ◽  
pp. 7712-7718
Author(s):  
Jinyan Liu ◽  
Quanyuan Feng ◽  
Xiaolin Jia

In order to solve multi-tag collision problem in radio frequency identification system, many anti-collision algorithms have been proposed, such as query tree algorithm, bi-slotted collision tracking tree algorithm (BSCTTA). In this paper, an enhanced collision tracking tree algorithm is proposed to improve the performance of BSCTTA. The proposed algorithm generates prefix depending on the first collided bit, and then eliminates the idle timeslots and reduces the collided timeslots. Moreover, the proposed algorithm can identify two tags in a timeslot if there is only one collided bit in the response data, and can truncate unvalued data when two collided bits are detected. The simulation results show that the proposed algorithm reduces the communication bits and query cycles than other algorithms, therefore enhances the identification efficiency and identification speed of radio frequency identification system.


Author(s):  
Kamalendu Pal

Radio Frequency Identification (RFID) is a technology that uses radio frequency signals to identify tagged objects. RFID is an important technology used by the Internet of Things (IoT) applications. This technology enables communication between the main devices used in RFID system, the reader, and the tags. The tags share a common communication channel. Therefore, if more than one tag tries to send information at the same time, the reader will be incapable of differentiating these signals in the case of radio signals interference. This phenomenon is known as tag collision problem. The problem of tag collision is one of the major disadvantages for fast tagged-object identification in supply chain management. This chapter describes four different types of binary search algorithms for avoidance of tag collision, and then presents a performance measurement mechanism for RFID application system. Finally, simulation-based experimental results on the performance of these algorithms are presented.


2014 ◽  
Vol 989-994 ◽  
pp. 1905-1908
Author(s):  
Yan Ru Zhao ◽  
Wei Li Miao

With the development of Radio Frequency Identification (RFID) technology, it also exposed some problems in practical applications. Especially in multi-tag anti-collision problem, how to quickly identify multiple tags in the scope of the reader has become the key to solve the problem. On the basis of the Binary Search Algorithm (BSA) and Dynamic Binary Search Algorithm (DBSA), the paper proposed an Improved Dynamic Binary Search Algorithm. The simulation result proves that the improved method in multi-tag anti-collision is more efficiency than the previous two, which is a good solution to the shortcomings of the first two algorithms.


2014 ◽  
Vol 496-500 ◽  
pp. 1821-1824 ◽  
Author(s):  
Min Li Xu ◽  
Li Juan Yu ◽  
Cheng Ming Chen ◽  
Shou Qi Cao

The problem of anti-collision tag is a common problem of the radio frequency identification (RFID) system. ALOHA algorithm and binary search algorithm is the main algorithm to solve the collision problem. This paper analyzes the effectiveness of binary searching of backtracking algorithm in time slot number of shortening identification tags. Combining the theoretical analysis what needs to be improved in binary searching of backtracking algorithm.


Sign in / Sign up

Export Citation Format

Share Document