Dense Radio Frequency Identification Research Articles

Distributed channel selection and randomized interrogation algorithms for large-scale and dense RFID systems

Radio frequency identification (RFID) is an emerging wireless communication technology which allows objects to be identified automatically. An RFID system consists of a set of readers and several objects, equipped with small and inexpensive computer chips, called tags. In a dense RFID system, where several readers are placed together to improve the read rate and correctness, readers and tags can frequently experience packet collision. High probability of collision impairs the benefit of multiple reader deployment and results in misreading. A common approach to avoid collision is to use a distinct frequency channel for interrogation for each reader. Various multi-channel anti-collision protocols have been proposed for RFID readers. However, due to their heuristic nature, most algorithms may not achieve optimal system performance. In this paper, we systematically design two optimization-based distributed channel selection and randomized interrogation algorithms for dense RFID systems. For this purpose, we develop elaborate models for the reader-to-tag and reader-to-reader collision problems. The first algorithm is fully distributed and is guaranteed to find a local optimum of a max-min fair resource allocation problem for RFID systems. The second algorithm is semi-distributed and achieves the global optimal system performance. Max-min fair optimality balances the performance and the processing load among readers. Simulation results show that our algorithms have significantly better performance than the previous heuristic algorithms.

Objects tracking in a dense reader environment utilising grids of RFID antenna positioning

One of the fundamental constraints in radio frequency identification (RFID) large scale deployment, such as in warehouse RFID deployment, is the positioning of RFID reader antennas to efficiently locate all the tagged objects distributed in a dense RFID reader environment. For tracking the tagged objects in a dense RFID deployment, the required number of reader antennas must be optimised in order to reduce the overall cost. This study proposes highly accurate square and hexagonal grid-based positioning and tracking techniques mainly for use indoors and includes performance comparison of both of these grids. The study involves the design of the square and hexagonal grid reader antenna networks and position calculation using a diffusion algorithm. Both of these grids of RFID antenna positioning present a solution for the problem of the placement pattern of RFID reader antennas in a dense reader environment, hence an optimal number of required reader antennas and guaranteed coverage can be achieved. This study also presents a path loss model that can be applied to predict the radio signal strength information at a certain distance. The proposed diffusion algorithm estimates RFID tag position by using distance information between the reader and the tag. The obtained results show that a square grid can yield higher positioning accuracy compared to the hexagonal grid. The obtained results further show that the proposed tracking techniques can achieve an average positioning error below 1 m, which is 85% better in some cases than the results obtained by other known methods.

An Efficient Reader Anticollision Algorithm in Dense RFID Networks With Mobile RFID Readers

In parallel with the proliferation of radio-frequency identification (RFID) systems, many RFID readers have been increasingly employed. In such an environment, collision among readers becomes a serious problem. Existing anticollision algorithms, depending on the information of neighboring readers, may require constant effort in order to grasp such information. Although it may be given by a server or a coordinator, they may not be suitable in dense and dynamic RFID networks with mobile readers. In this paper, we propose an efficient reader anticollision algorithm using a polling server in dense and dynamic RFID networks with mobile readers. Owing to the assistance of the server, the readers can rapidly decide whether they can work or not without interfering neighbors and can be easily synchronized. Our proposed algorithm is simple and makes readers aware of neighbors to minimize reader collisions. Performance evaluation shows how many readers can operate in a network and indicates that our proposed algorithm is more efficient than distributed color selection, colorwave, and hierarchical Q-learning algorithm, particularly in dense and mobile environments.

Adaptive and Probabilistic Power Control Algorithms for RFID Reader Networks

In radio frequency identification (RFID) systems, the detection range and read rates will suffer from interference among high power reading devices. This problem grows severely and degrades system performance in dense RFID networks. Consequently, medium access protocols (MAC) protocols are needed for such networks to assess and provide access to the channel so that tags can be read accurately. In this paper, we investigate a suite of feasible power control schemes to ensure overall coverage area of the system while maintaining a desired read rate. The power control scheme and MAC protocol dynamically adjusts the RFID reader power output in response to the interference level seen during tag reading and acceptable signal-to-noise ratio (SNR). We present novel distributed adaptive power control (DAPC) and probabilistic power control (PPC) as two possible solutions. A suitable back off scheme is also added with DAPC to improve coverage. Both the methodology and implementation of the schemes are presented, simulated, compared, and discussed for further work.

Adaptive Power Control Protocol With Hardware Implementation for Wireless Sensor and RFID Reader Networks

<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> The development and deployment of radio frequency identification (RFID) systems render a novel distributed sensor network which enhances visibility into manufacturing processes. In RFID systems, the detection range and read rates will suffer from interference among high-power reading devices. This problem grows severely and degrades system performance in dense RFID networks. Consequently, medium access protocols (MAC) protocols are needed for such networks to assess and provide access to the channel so that tags can be read accurately. In this paper, we investigate a suite of feasible power control schemes to ensure overall coverage area of the system while maintaining a desired read rate. The power control scheme and MAC protocol dynamically adjust the RFID reader power output in response to the interference level seen during tag reading and acceptable signal-to-noise ratio (SNR). We present novel distributed adaptive power control (DAPC) as a possible solution. A suitable back off scheme is also added with DAPC to improve coverage. A generic UHF wireless testbed is built using UMR/SLU GEN4-SSN for implementing the protocol. Both the methodology and hardware implementation of the schemes are presented, compared, and discussed. The results of hardware implementation illustrate that the protocol performs satisfactorily as expected. </para>

ASAP: A MAC Protocol for Dense and Time-Constrained RFID Systems

We introduce a novel medium access control (MAC) protocol for radio frequency identification (RFID) systems which exploits the statistical information collected at the reader. The protocol, termed adaptive slotted ALOHA protocol (ASAP), is motivated by the need to significantly improve the total read time performance of the currently suggested MAC protocols for RFID systems. In order to accomplish this task, ASAP estimates the dynamic tag population and adapts the frame size in the subsequent round via a simple policy that maximizes an appropriately defined efficiency function. We demonstrate that ASAP provides significant improvement in total read time performance over the current RFID MAC protocols. We next extend the design to accomplish reliable performance of ASAP in realistic scenarios such as the existence of constraints on frame size, and mobile RFID systems where tags move at constant velocity in the reader's field. We also consider the case where tags may fail to respond because of a physical breakdown or a temporary malfunction, and show the robustness in those scenarios as well.