311 research outputs found

    Backscattering UWB/UHF hybrid solutions for multi-reader multi-tag passive RFID systems

    Get PDF
    Ultra-wideband (UWB) technology is foreseen as a promising solution to overcome the limits of ultra-high frequency (UHF) techniques toward the development of green radio frequency identification (RFID) systems with low energy consumption and localization capabilities. While UWB techniques have been already employed for active tags, passive tags solutions are more appealing also due to their lower cost. With the fundamental requirement of maintaining backward compatibility in the RFID domain, we propose a hybrid UWB/UHF architecture to improve passive tag identification both in single-reader and multi-reader scenarios. We then develop two hybrid algorithms: the first one exploits the UWB signal to improve ISO/IEC 18000-6C UHF standard, while the other one exploits UWB to enhance a compressive sensing (CS) technique for tag identification in the multi-reader, multi-tag scenario. Both solutions are able to improve success rate and reading speed in the tag identification process and reduce the energy consumption. The multi-reader version of the proposed approaches is based on a cooperative scheme in order to manage reader-tag collisions and reader-reader collisions besides the typical tag-tag collisions. Furthermore, timing synchronization non-idealities are analyzed for the proposed solutions and simulation results reveal the effectiveness of the developed schemes

    RFID Control System for the Embarkation/Disembarkation of Passengers and Vehicles on/from Ferries

    Get PDF
    Radio-frequency identification (RFID) is a technology which provides automatic identification and real time data acquisition capabilities without requiring additional human resources. This paper presents a control system for the embarkation/ disembarkation of passengers and vehicles on/from ferries, supported by RFID technology. A basic model of a RFID control system is developed to introduce the notion of RFID as a technology capable of access control with certain technical constraints. The ticket check-in process, made automatic by simple entry of a tag into the field of a RFID reader, increases the flow of passengers and vehicles, reduces port congestion, eliminates the possibility of boarding the wrong (by destination) ferry, and significantly reduces the number of cash payments

    Distributed Wireless Algorithms for RFID Systems: Grouping Proofs and Cardinality Estimation

    Get PDF
    The breadth and depth of the use of Radio Frequency Identification (RFID) are becoming more substantial. RFID is a technology useful for identifying unique items through radio waves. We design algorithms on RFID-based systems for the Grouping Proof and Cardinality Estimation problems. A grouping-proof protocol is evidence that a reader simultaneously scanned the RFID tags in a group. In many practical scenarios, grouping-proofs greatly expand the potential of RFID-based systems such as supply chain applications, simultaneous scanning of multiple forms of IDs in banks or airports, and government paperwork. The design of RFID grouping-proofs that provide optimal security, privacy, and efficiency is largely an open area, with challenging problems including robust privacy mechanisms, addressing completeness and incompleteness (missing tags), and allowing dynamic groups definitions. In this work we present three variations of grouping-proof protocols that implement our mechanisms to overcome these challenges. Cardinality estimation is for the reader to determine the number of tags in its communication range. Speed and accuracy are important goals. Many practical applications need an accurate and anonymous estimation of the number of tagged objects. Examples include intelligent transportation and stadium management. We provide an optimal estimation algorithm template for cardinality estimation that works for a {0,1,e} channel, which extends to most estimators and ,possibly, a high resolution {0,1,...,k-1,e} channel
    corecore