5 research outputs found

    Time-Efficient Cloning Attacks Identification in Large-Scale RFID Systems

    Get PDF
    Radio Frequency Identification (RFID) is an emerging technology for electronic labeling of objects for the purpose of automatically identifying, categorizing, locating, and tracking the objects. But in their current form RFID systems are susceptible to cloning attacks that seriously threaten RFID applications but are hard to prevent. Existing protocols aimed at detecting whether there are cloning attacks in single-reader RFID systems. In this paper, we investigate the cloning attacks identification in the multireader scenario and first propose a time-efficient protocol, called the time-efficient Cloning Attacks Identification Protocol (CAIP) to identify all cloned tags in multireaders RFID systems. We evaluate the performance of CAIP through extensive simulations. The results show that CAIP can identify all the cloned tags in large-scale RFID systems fairly fast with required accuracy

    Twins:Device-free Object Tracking using Passive Tags

    Full text link
    Without requiring objects to carry any transceiver, device-free based object tracking provides a promising solution for many localization and tracking systems to monitor non-cooperative objects such as intruders. However, existing device-free solutions mainly use sensors and active RFID tags, which are much more expensive compared to passive tags. In this paper, we propose a novel motion detection and tracking method using passive RFID tags, named Twins. The method leverages a newly observed phenomenon called critical state caused by interference among passive tags. We contribute to both theory and practice of such phenomenon by presenting a new interference model that perfectly explains this phenomenon and using extensive experiments to validate it. We design a practical Twins based intrusion detection scheme and implement a real prototype with commercial off-the-shelf reader and tags. The results show that Twins is effective in detecting the moving object, with low location error of 0.75m in average

    Implementation of Fosstrak EPCIS RFID system

    Get PDF
    Projecte realitzat en el marc d'un programa de mobilitat amb la Czech Technical University[ANGLÈS] How to adapt a RFID system with Fosstrak open-source software to follow the EPCglobal standards.[CASTELLÀ] Cómo adaptar el software de código libre Fosstrak a un sistema RFID para seguir los estándares de EPCglobal.[CATALÀ] Com adaptar el software de codi obert Fosstrak a un sistema RFID per seguir els estàndards d'EPCglobal

    A Very Fast Tags Polling Protocol for Single and Multiple Readers RFID Systems, and its Applications

    No full text
    In this paper, we present a very fast and simple protocol for polling tags in an RFID system formed by one or more readers, and a multitude of tags. Actually, the protocol is time-optimal for single reader systems, while being very fast for multiple readers systems. The main idea of the protocol described in this paper, is to associate a short and unique number (called “nickname” in the following) to each tag in the reader’s range, and by using such nicknames as the polling order. We first describe the single reader version of the protocol. For this version, the used nicknames are the integers 1,2,…,n1,2,…,n if the set of tags to be polled is formed by n tags. They can be seen as the time slot in which a tag has to communicate with the reader. We also provide a procedure to assign a nickname for a new tag, as well as a way to delete a tag from the polling order, while keeping the above consecutivity property about nicknames. When polled, the tags transmit a proper (usually short) message. Polling protocols, sometime with little changes, sometime with no change, can be efficiently used for solving several practical problems related to the use of RFID systems. Some of the most prominent ones, and those considered in this paper, are the problems of exactly determine missing tags, the collection of information associated to the tags, the probabilistic determination of missing tags (useful for raising a warning), and the determination of the presence of cloned tags, again for raising a proper warning. We formally show that the protocol is time-optimal. Besides, the protocol is privacy preserving since tags ID’s are never transmitted during the polling procedure. In the protocol version for large, multireader RFID systems, we take an approach completely different from that used so far for any multireader protocol. Up to now, in the proposed protocols for this and related problems, first readers are scheduled so that those with overlapping ranges never operate at the same time. Then, single reader protocol for each so scheduled reader are applied. Here, we schedule the tags instead of the readers so that tags whose transmission can be received by a common reader, never operate at the same time. Then, we show that our polling protocol for single reader systems can be effectively used along with such a tags scheduling strategy, in multireader systems. The time performance improvement of our protocol over the known ones for multireader systems is very large, going from two to seven times, as shown by a simulation experiment we set up, and whose results are also presented

    A Fast Tags Polling Protocol for Multireader RFID Systems

    No full text
    In this paper, we investigate the tags polling problem for large, multireader RFID systems. We take an approach completely different from that used so far for multireader protocols. Up to now, in the proposed protocols for this and related problems, first readers are scheduled so that those with overlapping ranges never operate at the same time. Then, proper protocols for each so scheduled reader are applied. Here, we schedule the tags instead of the readers so that tags whose transmission can be received by a common reader, never operate at the same time. Then, we present a polling protocol that takes advantage of this paradigmatic shift. The performance improvement of our protocol over the known ones is very large, going from two times to seven times, as shown by a simulation experiment we set up, and whose results are also presented
    corecore