No full-text available
To read the full-text of this research,
you can request a copy directly from the authors.
AFSA: an efficient framework for fast RFID tag reading in dense environments
Abstract
In this paper, we introduce a framework termed Accelerated Frame Slotted Aloha (AFSA) for reducing the average reading time of passive RFID tags in dense environments. The proposed framework can be used in conjunction with almost all tag reading protocols that are based on frame slotted Aloha. AFSA reduces the tag reading time by decreasing the time wasted due to collisions and idle slots. We also discuss extensions of AFSA to read passive tags in a mobile setting. Simulation results show that AFSA can significantly reduce the average tag reading time with respect to the base protocol under both static and mobile settings.
... However, there are several differences between the two technologies. First, Barcode is used for tracking a given class of products [11]. For example, in Wal-Mart, the same kinds of products have the same barcode information printed (all Diet Coke have the same barcode information). ...
... Undoubtably, RFID can have enormous market value, e.g., only Wal-Mart alone can save $8.6 billions a year [11]. Today, many companies are switching to RFID from Barcode because of these advantages that RFID technology have compared to Barcode. ...
... There are two basic types of anti-tag-collision protocols. They are probabilistic (e.g., slotted Aloha protocols, standardized for Class 1 Generation 1 and Class 1 Generation 2 RFID systems) and deterministic protocols (e.g., binary tree search based protocols, standardized for Class 0 Generation 1 RFID systems) [11]. In slotted Aloha protocols, a frame is divided into many time slots and every tag chooses a random time slot ...
... Each frame is formed of specific number of slots that is used for the communication between the readers and the tags. DFSA can identify the tag efficiently because the reader adjusts the frame-size according to the estimated number of tags [6], [7], [9]. However, the frame-size change alone cannot reduce sufficiently the tag collision when there are large numbers of tags because it cannot increase the framesize indefinitely. ...
Radio Frequency Identification (RFID) is a technology that incorporates the use of the electromagnetic spectrum to uniquely identify people or objects. RFID technology has major data stream issues caused by massive amounts of tags simultaneously being captured by the reader that results in collisions. This collision issue can be solved by using anti-collision methods. The current ALOHA-based methods suffer from insufficient performance, especially when a substantial number of tags are present within a reader zone. In this work, we propose a Modified Dynamic Framed-Slotted ALOHA (MDFSA) technique to maximise the performance efficiency and to reduce the total number of slots queried during the tag identification process. The MDFSA approach creates new tag grouping rules using particular equations according to the optimal efficiency obtained for a specific number of tags. In this study, we have demonstrated that our proposed method has maintained its efficiency above other existing approaches, and has the most effective performance.
Radio Frequency Identification (RFID) is considered an emerging technology for advancing a wide range of applications, such as supply chain management and distribution. However, despite the extensive development of the RFID technology in many areas, the RFID tags collision problems remain a serious issue. Collision problems occur due to the simultaneous presence of multiple numbers of tags within the reader zone. To solve collision problems, different anti-collision methods have been mentioned in literature. These methods are either insufficient or too complex, with a high overhead cost of implementation. In this chapter, the authors propose a novel deterministic anti-collision algorithm using combinations of Q-ary trees with the intended goal to minimise memory usage queried by the RFID reader. By reducing the size of queries, the RFID reader can preserve memories, and the identification time can be improved. In addition, the chapter introduces a novel probabilistic group-based anti-collision method to improve the overall performance of the tag recognition process.
Radio Frequency Identification (RFID) uses wireless radio frequency technology to automatically identify tagged objects. Despite the extensive development of the RFID technology in many areas, tags collisions still remain a major problem. This issue is known as the collision problem and can be solved by using anti-collision techniques. Current probabilistic anti-collision approaches suffer from tag starvation due to the inaccurate Backlog estimation and have a low performance in some cases. In this research, we propose a Probabilistic Cluster-Based Technique (PCT) to maximise the performance efficiency during the tag identification process. The PCT approach creates new tag grouping strategies using particular equations, according to the optimal efficiency obtained for a specific number of tags. Through extensive experimentation, we have demonstrated that the proposed concept performs better than the other current state-of-the-art approaches.
Government funding for the security at shipping facilities and ports is limited so there is a need for low cost scalable security systems. With over 20 million sea, truck, and rail containers entering the United States every year, these facilities pose a large risk to security. Securing these facilities and monitoring the variety of traffic that enter and leave is a major task. To accomplish this, the authors have developed and fielded a low cost fully distributed building block approach to port security at the inland Port of Catoosa in Oklahoma. Based on prior work accomplished in the design and fielding of an intelligent transportation system in the United States, functional building blocks, (e.g. Network, Camera, Sensor, Display, and Operator Console blocks) can be assembled, mixed and matched, and scaled to provide a comprehensive security system. The following functions are demonstrated and scaled through analysis and demonstration: Barge tracking, credential checking, container inventory, vehicle tracking, and situational awareness. The concept behind this research is "any operator on any console can control any device at any time."
The problems of identifying a set of tagged objects simultaneously in an RFID network have hampered the adoption of RFID universally. When multiple tags transmit their IDs in a single period of time to a single reader over a shared wireless channel, the tag signals may collide. This collision will disturb the readerpsilas identification process. Hence, we proposed a modified version of accelerated frame slotted ALOHA protocol called hasten dynamic frame slotted ALOHA (HEDFSA) to condense a number of retransmission for one tag, besides reducing the probability of colliding tags. In HEDFSA, the colliding tags in the first round reading will be identified in the next reading. It is expected that our protocol performance would be better in terms of shorter time in identifying process of tags since number of tag collision problems has been reduced.
We identify those functional elements within a radio frequency identification (RFID) tag that must be standardized to enable functionality to be added to tags in a timely and standardized manner. As RFID systems become ubiquitous and used in a plethora of distinct applications, the functionality that may be contained within an individual tag will be varied. Access to this varied functionality must be performed in a standardized manner. Standardization must occur at all levels of functionality to enable the proliferation of functionality that will be demanded by the marketplace, effectively allowing for a standard approach to vendor specific functionality. The RFID Class Structure defined by the Auto-ID Center provides the framework for discussing and developing RFID protocol standards that cover a broad spectrum of functionality. Standards within this framework provide the base functionality that enables vendors to add market demanded functionality in a timely manner while remaining standards compliant. We review the RFID Class Structure and identify those functional elements that must be standardized within each class of the framework to enable a proliferation of vendor proprietary functionality in a standardized manner.
In this work, we develop a CSMA-based MAC protocol to avoid reader-reader and reader-tag collisions in a dense RFID network. The network is implemented using mote-based RFID readers. To implement the MAC protocol, we develop an appropriate carrier sensing circuit using an RFID tag as an antenna and the mote as an apparatus to sample received signal strength. We have augmented a commercially avail- able OEM RFID module with such carrier sensing capability and interfaced it with motes. Performance evaluation shows much superior performance relative to a naive and a ran- domized protocol in dense deployment environments both in regards to accuracy and time per tag read.
This paper proposes a modification to the existing anticollision protocol put forth in version 1.0 protocol specification for 900MHz Class 0 RFID Tag. The version 1.0 specification uses a binary tree approach to singulate one RF tag ID at a time. The proposed change reduces the overall read time of a given number of RFID tags by resetting to the appropriate node, for every consecutive read cycle. The present standard resets to the root node of the binary tree for every read cycle.
In RFID system, one of the problems that we must solve is the collision between tags which lowers the efficiency of the RFID system. One of the popular anti-collision algorithms is ALOHA-type algorithms, which are simple and shows good performance when the number of tags to read is small. However, they generally require exponentially increasing number of slots to identify the tags as the number of tag increases. In the paper, we propose a new anti-collision algorithm called enhanced dynamic framed slotted ALOHA (EDFSA) which estimates the number of unread tags first and adjusts the number of responding tags or the frame size to give the optimal system efficiency. As a result, in the proposed method, the number of slots to read the tags increases linearly as the the number of tags does. Simulation results show that the proposed algorithm improves the slot efficiency by 85∼100% compared to the conventional algorithms when the number of tags is 1000.
A multilayer problem
- G Avoine
- P Oechslin