892 research outputs found
Perfect tag identification protocol in RFID networks
Radio Frequency IDentification (RFID) systems are becoming more and more
popular in the field of ubiquitous computing, in particular for objects
identification. An RFID system is composed by one or more readers and a number
of tags. One of the main issues in an RFID network is the fast and reliable
identification of all tags in the reader range. The reader issues some queries,
and tags properly answer. Then, the reader must identify the tags from such
answers. This is crucial for most applications. Since the transmission medium
is shared, the typical problem to be faced is a MAC-like one, i.e. to avoid or
limit the number of tags transmission collisions. We propose a protocol which,
under some assumptions about transmission techniques, always achieves a 100%
perfomance. It is based on a proper recursive splitting of the concurrent tags
sets, until all tags have been identified. The other approaches present in
literature have performances of about 42% in the average at most. The
counterpart is a more sophisticated hardware to be deployed in the manufacture
of low cost tags.Comment: 12 pages, 1 figur
LPDQ: a self-scheduled TDMA MAC protocol for one-hop dynamic lowpower wireless networks
Current Medium Access Control (MAC) protocols for data collection scenarios with a large number of nodes that generate bursty traffic are based on Low-Power Listening (LPL) for network synchronization and Frame Slotted ALOHA (FSA) as the channel access mechanism. However, FSA has an efficiency bounded to 36.8% due to contention effects, which reduces packet throughput and increases energy consumption. In this paper, we target such scenarios by presenting Low-Power Distributed Queuing (LPDQ), a highly efficient and low-power MAC protocol. LPDQ is able to self-schedule data transmissions, acting as a FSA MAC under light traffic and seamlessly converging to a Time Division Multiple Access (TDMA) MAC under congestion. The paper presents the design principles and the implementation details of LPDQ using low-power commercial radio transceivers. Experiments demonstrate an efficiency close to 99% that is independent of the number of nodes and is fair in terms of resource allocation.Peer ReviewedPostprint (author’s final draft
Recommended from our members
From M-ary Query to Bit Query: a new strategy for efficient large-scale RFID identification
The tag collision avoidance has been viewed as one of the most important research problems in RFID communications and bit tracking technology has been widely embedded in query tree (QT) based algorithms to tackle such challenge. Existing solutions show further opportunity to greatly improve the reading performance because collision queries and empty queries are not fully explored. In this paper, a bit query (BQ) strategy based Mary query tree protocol (BQMT) is presented, which can not only eliminate idle queries but also separate collided tags into many small subsets and make full use of the collided bits. To further optimize the reading performance, a modified dual prefixes matching (MDPM) mechanism is presented to allow multiple tags to respond in the same slot and thus significantly reduce the number of queries. Theoretical analysis and simulations are supplemented to validate the effectiveness of the proposed BQMT and MDPM, which outperform the existing QT-based algorithms. Also, the BQMT and MDPM can be combined to BQMDPM to improve the reading performance in system efficiency, total identification time, communication complexity and average energy cost
From M-ary Query to Bit Query: a new strategy for efficient large-scale RFID identification
The tag collision avoidance has been viewed as one of the most important research problems in RFID communications and bit tracking technology has been widely embedded in query tree (QT) based algorithms to tackle such challenge. Existing solutions show further opportunity to greatly improve the reading performance because collision queries and empty queries are not fully explored. In this paper, a bit query (BQ) strategy based Mary query tree protocol (BQMT) is presented, which can not only eliminate idle queries but also separate collided tags into many small subsets and make full use of the collided bits. To further optimize the reading performance, a modified dual prefixes matching (MDPM) mechanism is presented to allow multiple tags to respond in the same slot and thus significantly reduce the number of queries. Theoretical analysis and simulations are supplemented to validate the effectiveness of the proposed BQMT and MDPM, which outperform the existing QT-based algorithms. Also, the BQMT and MDPM can be combined to BQMDPM to improve the reading performance in system efficiency, total identification time, communication complexity and average energy cost
Survey on Lightweight Primitives and Protocols for RFID in Wireless Sensor Networks
The use of radio frequency identification (RFID) technologies is becoming widespread in all kind of wireless network-based applications. As expected, applications based on sensor networks, ad-hoc or mobile ad hoc networks (MANETs) can be highly benefited from the adoption of RFID solutions. There is a strong need to employ lightweight cryptographic primitives for many security applications because of the tight cost and constrained resource requirement of sensor based networks. This paper mainly focuses on the security analysis of lightweight protocols and algorithms proposed for the security of RFID systems. A large number of research solutions have been proposed to implement lightweight cryptographic primitives and protocols in sensor and RFID integration based resource constraint networks. In this work, an overview of the currently discussed lightweight primitives and their attributes has been done. These primitives and protocols have been compared based on gate equivalents (GEs), power, technology, strengths, weaknesses and attacks. Further, an integration of primitives and protocols is compared with the possibilities of their applications in practical scenarios
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
Recommended from our members
Fast splitting based tag identification algorithm for anti-collision in UHF RFID System
Efficient and effective objects identification using Radio Frequency Identification (RFID) is always a challenge in large scale industrial and commercial applications. Among existing solutions, the tree based splitting scheme has attracted increasing attention because of its high extendibility and feasibility. However, conventional tree splitting algorithms can only solve tag collision with counter value equals to zero and usually result in performance degradation when the number of tags is large. To overcome such drawbacks, we propose a novel tree-based method called Fast Splitting Algorithm based on Consecutive Slot Status detection (FSA-CSS), which includes a fast splitting (FS) mechanism and a shrink mechanism. Specifically, the FS mechanism is used to reduce collisions by increasing commands when the number of consecutive collision is above a threshold. Whereas the shrink mechanism is used to reduce extra idle slots introduced by FS. Simulation results supplemented by prototyping tests show that the proposed FSA-CSS achieves a system throughput of 0.41, outperforming the existing UHF RFID solutions
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 tag identification algorithms for RFID: survey, motivation and new design
RFID is widely applied in massive tag based applications, thus effective anti-collision algorithms to reduce communication overhead are of great importance to RFID in achieving energy and time efficiency. Existing MAC algorithms are primarily focusing on improving system throughput or reducing total identification time. However, with the advancement of embedded systems and mobile applications, the energy consumption aspect is increasingly important and should be considered in the new design. In this article, we start with a comprehensive review and analysis of the state-of-the-art anti-collision algorithms. Based on our existing works, we further discuss a novel design of anti-collision algorithm and show its effectiveness in achieving energy efficiency for the RFID system using EPCglobal C1 Gen2 UHF standard
- …