Search Results (13)

As a result of the current imperfection of the meat traceability system, there have been numerous food safety events with serious consequences. In this paper, a meat product information traceability system is designed to efficiently prevent such problems. This system develops an identification tag information reader based on ultra-high frequency (UHF) Radio Frequency Identification (RFID). It is compatible with LoRa wireless, USB serial port, RS485, and RJ45 Ethernet connection. Among them, the efficiency analysis of the Q-value algorithm finds that the recognition rate of the system reaches a maximum of about 0.367 when the number of tags n is about the frame length. The multi-tag anti-collision algorithm design based on the algorithm improves the efficiency of information collection in production and distribution links. The traceability code identification scheme is designed to effectively match various links, and the platform of system is built using LabVIEW2014 software, which has five sub-modules including user management, farm management, slaughter management, logistics management, and sales management. The system uses MySQL databases to store traceability information so that users can complete their queries by entering the traceability code on the system platform. The system not only has a low cost and a broad range of applications, but it also realizes the tracking record of meat product traceability information from breeding to selling, completes the function from information collection to information inquiry, and solves the problem of the incomplete traceability information chain. In addition, the system not only enhances the informational transparency of meat products in the product supply chain but also provides information for the regulatory authorities to effectively monitor safety. Full article

Fast and reliable identification of Radio Frequency Indentification (RFID) tags by means of anticollision (MAC) protocols has been a problem of substantial interest for more than a decade. However, improvements in identification rate have been slow, as most solutions rely on sequential approaches that try to avoid collisions, which have limited margin for performance improvement. Recently, there has been growing interest in concurrent techniques that exploit the structure of collisions to recover tag IDs. While these techniques promise substantial improvements in speed, a key question that remains unaddressed is how to deal with noise or interference that might introduce errors in the recovery process at the reader. Our goal in this paper is to consider a noisy wireless channel and add robustness to concurrent RFID identification techniques. We propose a new protocol, called CIRF (Concurrent Identification of RFids), which uses multiple antennas to add robustness to noise and leverages block sparsity-based optimization to recover EPC IDs of transmitting tags. We include fail-safe methods to handle errors that persist after the optimization stage. Extensive simulations show that CIRF achieves substantial resilience improvement in a range of very low to medium Signal-to-Noise (SNR) situations, being able to always correctly recover 99% of tags. Full article

Radio Frequency Identification (RFID) is considered as one of the most widely used wireless identification technologies in the Internet of Things. Many application areas require a dense RFID network for efficient deployment and coverage, which causes interference between RFID tags and readers, and reduces the performance of the RFID system. Therefore, communication resource management is required to avoid such problems. In this paper, we propose an anti-collision protocol based on feed-forward Artificial Neural Network methodology for distributed learning between RFID readers to predict collisions and ensure efficient resource allocation (DMLAR) by considering the mobility of tags and readers. The evaluation of our anti-collision protocol is performed for different mobility scenarios in healthcare where the collected data are critical and must respect the terms of throughput, delay, overload, integrity and energy. The dataset created and distributed by the readers allows an efficient learning process and, therefore, a high collision detection to increase throughput and minimize data loss. In the application phase, the readers do not need to exchange control packets with each other to control the resource allocation, which avoids network overload and communication delay. Simulation results show the robustness and effectiveness of the anti-collision protocol by the number of readers and resources used. The model used allows a large number of readers to use the most suitable frequency and time resources for simultaneous and successful tag interrogation. Full article

Hospitals are continuously working to reduce delayed analysis and specimen errors during transfers from testing stations to clinical laboratories. Radio-frequency identification (RFID) tags, which provide automated specimen labeling and tracking, have been proposed as a solution to specimen management that reduces human resource costs and analytic delays. Conventional RFID solutions, however, confront the problem of traffic jams and bottlenecks on the conveyor belts that connect testing stations with clinical laboratories. This mainly results from methods which assume that the arrival rate of specimens to laboratory RFID readers is fixed/stable, which is unsuitable and impractical in the real world. Previous RFID algorithms have attempted to minimize the time required for tag identification without taking the dynamic arrival rates of specimens into account. Therefore, we propose a novel RFID anti-collision algorithm called the Mobility Aware Binary Tree Algorithm (MABT), which can be used to improve the identification of dynamic tags within the reader’s coverage area and limited dwell time. Full article

With the rapid development of the Internet of Things (IoT), the radio frequency identification (RFID) system becomes increasingly important. Tag identification is a basic problem of the RFID system, whose purpose is to inventory tags. However, in recent years, it requires a very short time for massive tag identification, which brings serious challenges. The traditional Aloha based anti-collision algorithms have disadvantages of either low efficiency or high complexity. Therefore, this article proposes a low complexity dynamic frame slotted Aloha (DFSA) anti-collision algorithm, named LC-DFSA. The reader can estimate the range of tag numbers according to the last frame size, the number of successful slots and the ratio of idle slots. Then the optimal frame size can be calculated. Complexity analysis is deployed in this article, and we validate the correctness of the analysis. Through our simulations, LC-DFSA outperforms other schemes in both the average access efficiency and the algorithm complexity. It also can be conveniently applied to engineering implementations. Full article

As an important part of economic development, warehousing logistics also needs to be transformed and upgraded in order to adapt to the development of the new situation. The RFID reader records the related information of the goods to improve the efficiency of warehouse operation by identifying the RFID tags attached to the goods in batches. This paper also proposes an improved group-based anti-collision algorithm (GMQT) to solve the problem of tag collision in the process of Radio Frequency Identification (RFID) identification. The simulation results show that the GMQT algorithm improves the recognition efficiency of the system. The algorithm has the advantages of small data transmission and stable performance; in particular, the recognition efficiency is not affected by the number of tags. Full article

Radio frequency identification (RFID) technology has widely been used in the last few years. Its applications focus on auto identification, tracking, and data capturing issues. However, RFID suffers from the main problem of tags collision when multiple tags simultaneously respond to the reader request. Many protocols were proposed to solve the collision problems with good identification efficiency and an acceptable time delay, such as the blocking anti-collision protocol (BA). Nevertheless, most of these protocols assumed that the RFID reader could decode the tag’s signal only when there was one tag responding to the reader request once each time. Hence, they ignored the phenomenon of the capture effect, which results in identifying the tag with the stronger signal as the multiple tags simultaneously respond. As a result, many tags will not be identified under the capture effect. Therefore, the purpose of this paper is to take the capture effect phenomenon into consideration in order to modify the blocking BA protocol to ensure a full read rate, i.e., identifying all the tags in the frame without losing any tag. Moreover, the modifications include distinguishing between collision and interference responses (for the period of staying tags) in the noisy environments, for the purpose of enhancing the efficiency of the identification. Finally, the simulation and analytical results show that our modifications and MBA protocol outperform the previous protocols in the same field, such as generalized query tree protocols (GQT1 and GQT2), general binary tree (GBT), and tweaked binary tree (TBT). Full article

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. Full article

In recent years, Radio Frequency Identification (RFID) has become very popular. The main feature of this technology is that RFID tags do not require close handling and no line of sight is required between the reader and the tags. RFID is a technology that uses radio frequencies in order to identify tags, which do not need to be positioned accurately relative to the reader. Tags share the communication channel, increasing the likelihood of causing a problem, viz., a message collision. Tree based protocols can resolve these collisions, but require a uniform tag ID distribution. This means they are very dependent of the distribution of the IDs of the tags. Tag IDs are written in the tag and contain a predefined bit string of data. A study of the influence of the tag ID distribution on the protocols’ behaviour is proposed here. A new protocol, called the Flexible Query window Tree (FQwT) is presented to estimate the tag ID distribution, taking into consideration the type of distribution. The aim is to create a flexible anti-collision protocol in order to identify a set of tags that constitute an ID distribution. As a result, the reader classifies tags into groups determined by using a distribution estimator. Simulations show that the FQwT protocol contributes to significant reductions in identification time and energy consumption regardless of the type of ID distribution. Full article

The rapid development of RFID (Radio Frequency IDentification) technology has allowed its large adoption and led to increasing deployments of RFID solutions in diverse environments under varying scenarios and constraints. The nature of these constraints ranges from the amount to the mobility of the readers deployed, which in turn highly affects the quality of the RFID system, causing reading collisions. Although several solutions were proposed to engage the issue of reading collision, few were ever concerned with the densification and/or mobility of readers. This paper proposes two distributed TDMA (Time Division Multiple Access) approaches designed to reduce these collisions through local coordination between neighboring devices for different scenarios tested here. The first proposal is based on a reservation phase organized between readers with different priority levels given to readers depending on their previous success. The second one takes advantage of the particular case of RFID collisions, allowing a local and mutual decision of each reader to access or not tags in their vicinity. Simulations were run over different stressful environments in terms of tag/reader density and mobility, proving that our proposals achieved the best performance in terms of throughput, collision avoidance and coverage delay when compared to other collision reducing schemes. Full article

The reader-to-reader collision in an RFID system is a challenging problem for communications technology. In order to model the interference between RFID readers, different interference models have been proposed, mainly based on two approaches: single and additive interference. The former only considers the interference from one reader within a certain range, whereas the latter takes into account the sum of all of the simultaneous interferences in order to emulate a more realistic behavior. Although the difference between the two approaches has been theoretically analyzed in previous research, their effects on the estimated performance of the reader-to-reader anti-collision protocols have not yet been investigated. In this paper, the influence of the interference model on the anti-collision protocols is studied by simulating a representative state-of-the-art protocol. The results presented in this paper highlight that the use of additive models, although more computationally intensive, is mandatory to improve the performance of anti-collision protocols. Full article

At present, RFID is installed on mobile devices such as mobile phones or PDAs and provides a means to obtain information about objects equipped with an RFID tag over a multi-channeled telecommunication networks. To use mobile RFIDs, reader collision problems should be addressed given that readers are continuously moving. Moreover, in a multichannel environment for mobile RFIDs, interference between adjacent channels should be considered. This work first defines a new concept of a reader collision problem between adjacent channels and then suggests a novel reader anti-collision algorithm for RFID readers that use multiple channels. To avoid interference with adjacent channels, the suggested algorithm separates data channels into odd and even numbered channels and allocates odd-numbered channels first to readers. It also sets an unused channel between the control channel and data channels to ensure that control messages and the signal of the adjacent channel experience no interference. Experimental results show that suggested algorithm shows throughput improvements ranging from 29% to 46% for tag identifications compared to the GENTLE reader anti-collision algorithm for multichannel RFID networks. Full article

In the fields of production, manufacturing and supply chain management, Radio Frequency Identification (RFID) is regarded as one of the most important technologies. Nowadays, Mobile RFID, which is often installed in carts or forklift trucks, is increasingly being applied to the search for and checkout of items in warehouses, supermarkets, libraries and other industrial fields. In using Mobile RFID, since the readers are continuously moving, they can interfere with each other when they attempt to read the tags. In this study, we suggest a Time Division Multiple Access (TDMA) based anti-collision algorithm for Mobile RFID readers. Our algorithm automatically adjusts the frame size of each reader without using manual parameters by adopting the dynamic frame size adjustment strategy when collisions occur at a reader. Through experiments on a simulated environment for Mobile RFID readers, we show that the proposed method improves the number of successful transmissions by about 228% on average, compared with Colorwave, a representative TDMA based anti-collision algorithm. Full article