Towards Extended Bit Tracking for Scalable and Robust RFID Tag Identification Systems

The surge in demand for Internet of Things (IoT) systems and applications has motivated a paradigm shift in the development of viable radio frequency identification technology (RFID)-based solutions for ubiquitous real-Time monitoring and tracking. Bit tracking-based anti-collision algorithms have attracted considerable attention, recently, due to its positive impact on decreasing the identification time. We aim to extend bit tracking to work effectively over erroneous channels and scalable multi RFID readers systems. Towards this objective, we extend the bit tracking technique along two dimensions. First, we introduce and evaluate a type of bit errors that appears only in bit tracking-based anti-collision algorithms called false collided bit error in single reader RFID systems. A false collided bit error occurs when a reader perceives a bit sent by tag as an erroneous bit due to channel imperfection and not because of a physical collision. This phenomenon results in a significant increase in the identification delay. We introduce a novel, zero overhead algorithm called false collided bit error selective recovery tackling the error. There is a repetition gain in bit tracking-based anti-collision algorithms due to their nature, which can be utilized to detect and correct false collided bit errors without adding extra coding bits. Second, we extend bit tracking to 'error-free' scalable mutli-reader systems, while leaving the study of multi-readers tag identification over imperfect channels for future work. We propose the multi-reader RFID tag identification using bit tracking (MRTI-BT) algorithm which allows concurrent tag identification, by neighboring RFID readers, as opposed to time-consuming scheduling. MRTI-BT identifies tags exclusive to different RFIDs, concurrently. The concept of bit tracking and the proposed parallel identification property are leveraged to reduce the identification time compared to the state-of-The-Art. 2013 IEEE.This work was supported by the Qatar National Research Fund (a member of Qatar Foundation) through NPRP under Grant 7-684-1-127. The work of A. Fahim and T. ElBatt was supported by the Vodafone Egypt Foundation.Scopu

Ensuring Application Specific Security, Privacy and Performance Goals in RFID Systems

Radio Frequency IDentification (RFID) is an automatic identification technology that uses radio frequency to identify objects. Securing RFID systems and providing privacy in RFID applications has been the focus of much academic work lately. To ensure universal acceptance of RFID technology, security and privacy issued must be addressed into the design of any RFID application. Due to the constraints on memory, power, storage capacity, and amount of logic on RFID devices, traditional public key based strong security mechanisms are unsuitable for them. Usually, low cost general authentication protocols are used to secure RFID systems. However, the generic authentication protocols provide relatively low performance for different types of RFID applications. We identified that each RFID application has unique research challenges and different performance bottlenecks based on the characteristics of the system. One strategy is to devise security protocols such that application specific goals are met and system specific performance requirements are maximized. This dissertation aims to address the problem of devising application specific security protocols for current and next generation RFID systems so that in each application area maximum performance can be achieved and system specific goals are met. In this dissertation, we propose four different authentication techniques for RFID technologies, providing solutions to the following research issues: 1) detecting counterfeit as well as ensuring low response time in large scale RFID systems, 2) preserving privacy and maintaining scalability in RFID based healthcare systems, 3) ensuring security and survivability of Computational RFID (CRFID) networks, and 4) detecting missing WISP tags efficiently to ensure reliability of CRFID based system\u27s decision. The techniques presented in this dissertation achieve good levels of privacy, provide security, scale to large systems, and can be implemented on resource-constrained RFID devices

Energy Efficient Protocols for Active RFID

Radio frequency identification (RFID) systems come in different flavours; passive, active, semi-passive, or semi-active. Those different types of RFID are supported by different, internationally accepted protocol standards as well as by several accepted proprietary protocols. Even though the diversity is large between the flavours and between the standards, the RFID technology has evolved to be a mature technology, which is ready to be used in a large variety of applications. This thesis explores active RFID technology and how to develop and apply data communication protocols that are energy efficient and which comply with the different application constraints. The use of RFID technology is growing rapidly, and today mostly “passive” RFID systems are used because no onboard energy source is needed on the transponder (tag). However, the use of “active” RFID-tags with onboard power sources adds a range of opportunities not possible with passive tags. Besides that Active RFID offers increased working distance between the interrogator (RFID-reader) and tags, the onboard power source also enables the tags to do sensor measurements, calculations and storage even when no RFID-reader is in the vicinity of the tags. To obtain energy efficiency in an Active RFID system the communication protocol to be used should be carefully designed. This thesis describes how energy consumption can be calculated, to be used in protocol definition, and how evaluation of protocols in this respect can be made. The performance of such a new protocol, in terms of energy efficiency, aggregated throughput, delay, and number of collisions in the radio channel is evaluated and compared to an existing, commercially available protocol for Active RFID, as well as to the IEEE standard 802.15.4 (used, e.g., in the Zigbee medium-access layer). Simulations show that, by acknowledging the payload and using deep sleep mode on the tag, the lifetime of a tag is increased. For all types of protocols using a radio channel, when arbitrating information, it is obvious that the utilization of that channel is maximized when no collisions occur. To avoid and minimize collisions in the media it is possible to intercept channel interference by using carrier sense technology. The knowledge that the channel is occupied should result in a back-off and a later retry, instead of persistently listening to the channel which would require constant energy consumption. We study the effect on tag energy cost and packet delay incurred by some typical back-off algorithms (constant, linear, and exponential) used in a contention based CSMA/CA (Carrier Sense Multiple Access/ Collision Avoidance) protocol for Active RFID communication. The study shows that, by selecting the proper back-off algorithm coefficients (based on the number of tags and the application constraints), i.e., the initial contention window size and back-off interval coefficient, the tag energy consumption and read-out delays can be significantly lowered. The initial communication between reader and tag, on a control channel, establishes those important protocol parameters in the tag so that it tries to deliver its information according to the current application scenario in an energy efficient way. The decision making involved in calculating the protocol parameters is conducted in the local RFID-reader for highest efficiency. This can be done by using local statistics or based on knowledge provided by the logistic backbone databases. As the CMOS circuit technology evolves, new possibilities arise for mass production of low price and long life active tags. The use of wake-up radio technology makes it possible for active tags to react on an RFID-reader at any time, in contrast to tags with cyclic wake-up behaviour. The two main drawbacks with an additional wake-up circuit in a tag are the added die area and the added energy consumption. Within this project the solution is a complete wake-up radio transceiver consisting of only one hi-frequency very low power, and small area oscillator. To support this tag topology we propose and investigate a novel reader-tag communication protocol, the frequency binary tree protocol

Tag-collision resolution techniques for RFID systems.

Nie, Jing.Thesis (M.Phil.)--Chinese University of Hong Kong, 2007.Includes bibliographical references (leaves 73-77).Abstracts in English and Chinese.Abstract --- p.iAbstract (Chinese Version) --- p.iiiAcknowledgement --- p.ivChapter 1 --- Introduction --- p.1Chapter 2 --- Technology Overview --- p.4Chapter 2.1 --- History --- p.5Chapter 2.2 --- RFID Systems --- p.7Chapter 2.2.1 --- Tag --- p.8Chapter 2.2.2 --- Reader --- p.10Chapter 2.2.3 --- Software system --- p.12Chapter 2.2.4 --- Communication infrastructure --- p.13Chapter 2.3 --- Frequency Regulations and Standards --- p.13Chapter 2.3.1 --- RFID frequency --- p.13Chapter 2.3.2 --- Standards --- p.14Chapter 2.4 --- Technology Comparison and RFID Applications --- p.16Chapter 2.4.1 --- Technology Comparison --- p.16Chapter 2.4.2 --- RFID Applications --- p.19Chapter 3 --- Research Background --- p.22Chapter 3.1 --- Tag-Collision Resolution Techniques for RFID systems --- p.23Chapter 3.1.1 --- Deterministic Collision-Resolution Technique --- p.25Chapter 3.1.2 --- Stochastic Collision-Resolution Technique --- p.27Chapter 4 --- Optimized Anti-Collision Protocol --- p.30Chapter 4.1 --- System Description --- p.31Chapter 4.2 --- Mathematical System Model --- p.35Chapter 4.3 --- Optimal Parameter --- p.40Chapter 4.3.1 --- Stochastic Shortest Path --- p.41Chapter 4.3.2 --- Optimal Parameter --- p.44Chapter 4.4 --- Performance Evaluation --- p.45Chapter 4.4.1 --- Initial and Optimal Policy --- p.45Chapter 4.4.2 --- Performance Comparison --- p.48Chapter 4.5 --- Summary --- p.53Chapter 5 --- Unknown Tag Set Anti-Collision Protocol --- p.54Chapter 5.1 --- Protocol Description --- p.55Chapter 5.1.1 --- System Model --- p.55Chapter 5.1.2 --- Tag Estimation --- p.57Chapter 5.2 --- Performance Evaluation --- p.62Chapter 5.3 --- Summary --- p.67Chapter 6 --- Conclusion and Future Work --- p.68Chapter 6.1 --- Conclusion --- p.68Chapter 6.2 --- Future Work --- p.70Bibliography --- p.7

Mobile Tag Reading in a Multi-reader Rfid Environment

Radio Frequency Identification (RFID) refers to an emerging technology that intends, but not limited to replace barcode technology. RFID system assures to provide an effective inventorying, tracking and monitoring of any sorts of products in any field of applications. Recently, the large scale deployment of RFID system in supply chain management has necessities the use of multiple readers. Unfortunately, multi-reader RFID system suffers from reader collision problems that severely affect the system performance. Hence, this thesis aims to propose a novel framework for multi-reader RFID system based on Framed Slotted ALOHA protocol. The proposed framework is specific to a scenario in supply chain where a tag affixed to an item is in motion that moves on a conveyor belt and multiple readers which are fixed around the conveyor belt are supposed to read all the items. This work also determines the best pattern for the distribution of the tags on the conveyor belt.Computer Science Departmen

An RFID Anti-Collision Algorithm Assisted by Multi-Packet Reception and Retransmission Diversity

RFID provides a way to connect the real world to the virtual world. An RFID tag can link a physical entity like a location, an object, a plant, an animal, or a human being to its avatar which belongs to a global information system. For instance, let's consider the case of an RFID tag attached to a tree. The tree is the physical entity. Its avatar can contain the type of the tree, the size of its trunk, and the list of actions a gardener took on it

A survey of RFID readers anticollision protocols

International audienceWhile RFID technology is gaining increased attention from industrial community deploying different RFID-based applications, it still suffers from reading collisions. As such, many proposals were made by the scientific community to try and alleviate that issue using different techniques either centralized or distributed, monochannel or multichannels, TDMA or CSMA. However, the wide range of solutions and their diversity make it hard to have a clear and fair overview of the different works. This paper surveys the most relevant and recent known state-of-the-art anti-collision for RFID protocols. It provides a classification and performance evaluation taking into consideration different criteria as well as a guide to choose the best protocol for given applications depending on their constraints or requirements but also in regard to their deployment environments

Towards Secure and Scalable Tag Search approaches for Current and Next Generation RFID Systems

The technology behind Radio Frequency Identification (RFID) has been around for a while, but dropping tag prices and standardization efforts are finally facilitating the expansion of RFID systems. The massive adoption of this technology is taking us closer to the well known ubiquitous computing scenarios. However, the widespread deployment of RFID technology also gives rise to significant user security issues. One possible solution to these challenges is the use of secure authentication protocols to protect RFID communications. A natural extension of RFID authentication is RFID tag searching, where a reader needs to search for a particular RFID tag out of a large collection of tags. As the number of tags of the system increases, the ability to search for the tags is invaluable when the reader requires data from a few tags rather than all the tags of the system. Authenticating each tag one at a time until the desired tag is found is a time consuming process. Surprisingly, RFID search has not been widely addressed in the literature despite the availability of search capabilities in typical RFID tags. In this thesis, we examine the challenges of extending security and scalability issues to RFID tag search and suggest several solutions. This thesis aims to design RFID tag search protocols that ensure security and scalability using lightweight cryptographic primitives. We identify the security and performance requirements for RFID systems. We also point out and explain the major attacks that are typically launched against an RFID system. This thesis makes four main contributions. First, we propose a serverless (without a central server) and untraceable search protocol that is secure against major attacks we identified earlier. The unique feature of this protocol is that it provides security protection and searching capacity same as an RFID system with a central server. In addition, this approach is no more vulnerable to a single point-of-failure. Second, we propose a scalable tag search protocol that provides most of the identified security and performance features. The highly scalable feature of this protocol allows it to be deployed in large scale RFID systems. Third, we propose a hexagonal cell based distributed architecture for efficient RFID tag searching in an emergency evacuation system. Finally, we introduce tag monitoring as a new dimension of tag searching and propose a Slotted Aloha based scalable tag monitoring protocol for next generation WISP (Wireless Identification and Sensing Platform) tags

Building efficient wireless infrastructures for pervasive computing environments

Pervasive computing is an emerging concept that thoroughly brings computing devices and the consequent technology into people\u27s daily life and activities. Most of these computing devices are very small, sometimes even invisible , and often embedded into the objects surrounding people. In addition, these devices usually are not isolated, but networked with each other through wireless channels so that people can easily control and access them. In the architecture of pervasive computing systems, these small and networked computing devices form a wireless infrastructure layer to support various functionalities in the upper application layer.;In practical applications, the wireless infrastructure often plays a role of data provider in a query/reply model, i.e., applications issue a query requesting certain data and the underlying wireless infrastructure is responsible for replying to the query. This dissertation has focused on the most critical issue of efficiency in designing such a wireless infrastructure. In particular, our problem resides in two domains depending on different definitions of efficiency. The first definition is time efficiency, i.e., how quickly a query can be replied. Many applications, especially real-time applications, require prompt response to a query as the consequent operations may be affected by the prior delay. The second definition is energy efficiency which is extremely important for the pervasive computing devices powered by batteries. Above all, our design goal is to reply to a query from applications quickly and with low energy cost.;This dissertation has investigated two representative wireless infrastructures, sensor networks and RFID systems, both of which can serve applications with useful information about the environments. We have comprehensively explored various important and representative problems from both algorithmic and experimental perspectives including efficient network architecture design and efficient protocols for basic queries and complicated data mining queries. The major design challenges of achieving efficiency are the massive amount of data involved in a query and the extremely limited resources and capability each small device possesses. We have proposed novel and efficient solutions with intensive evaluation. Compared to the prior work, this dissertation has identified a few important new problems and the proposed solutions significantly improve the performance in terms of time efficiency and energy efficiency. Our work also provides referrable insights and appropriate methodology to other similar problems in the research community