• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1B
• /
• pp.85-94
• /
• 2010

Many RFID systems use dynamic slotted ALOHA to identify the label information of the RFID tags. One of the key problems in the RFID system is how to estimate the number of RFID tags up to the desired level of accuracy. In this paper, we present the framework of tag estimation algorithm for the collision-oblivious (CO) reader which can only decide whether the tag response is successful or not. Thus, the CO reader must rely on the success estimator to predict the RFID tag population. We propose two estimation algorithms to predict the number of RFID tags, named the memoryless success estimator (MSE) and the intersection-based success estimator (ISE). The MSE considers only the estimate obtained at the current inventory round, while the ISE finds an appropriate intersection interval of the existing estimates collected at every inventory round. Through the simulation results, we demonstrate that the ISE is a fast, accurate, and controllable estimator whose performance is close to that of the collision/idle estimators.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.7B
• /
• pp.448-454
• /
• 2007

This paper proposes an estimation method of number of tags which may be necessary in improving anti-collision performance for ALOHA-based RFID systems. In ALOHA-based anti-collision algorithms, since the performance of the multi tag identification can be improved by allocating the optimal slot size corresponding to the number of tags, it is needed to exactly estimate the number of tags. The proposed method uses the a priori knowledge of the relation between the expectation of the number of empty slots and the number of tags. After measuring the number of empty slots in one ROUND, we estimate the number of tags which corresponds to the expectation of the number of empty slots nearest to the measured one. Simulation results show that the proposed method is superior to conventional methods in terms of the estimation accuracy and the computational complexity.

• The Journal of the Acoustical Society of Korea
• /
• v.33 no.2
• /
• pp.126-132
• /
• 2014

In this paper, a DFSA (Dynamic Framed Slotted ALOHA) based anti-collision algorithm is described and a performance improved algorithm of DFSA and FSA is proposed. The proposed method makes use of expected values and has merits in operation speed by estimating closest value of the number of tags on a single operation. The algorithm compares and analyses number of empty slots and collide slots in accordance with the number of tags, which enables estimation of actual number of tags. we simulated the proposed algorithm and compared it with conventional methods. Results show that our method needs average 18.8 rounds to identify all tags. In case of less than 1000 tags, an average of 18.2 rounds is necessary and an average of 19.2 rounds is needed to identify all tags for more than 1000 tags. The proposed algorithm improves processing speed by 3.1 % comparing to DFSA with cancellation strategy, 10.1 % comparing to DFSA, 37.5 % comparing to FSA(Framed Slotted ALOHA).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6B
• /
• pp.561-571
• /
• 2006

RFID technology, as one contact-less identification technology with using electronic tag, is the field where its multiple researches have been studied. Especially, in the field of supply chain management, when it is necessary to identify a lot of objects by real-time, performance of anti-collision algorithm for multiple tag identification has an effect on performance of entire system. GEN2 is global, open, interoperability protocol for UHF RFID system, the active researches and developments are processed about it. In this paper, we introduce an anti-collision algorithm based on Slotted-ALOHA for GEN2 protocol, focus on estimating number of tags and setting number of slots and review the previous works. We propose new scheme that can estimate number of tags efficiently, and define system efficiency newly when it's used in setting number of slots. We also present result of compare and analysis with previous scheme through simulation. The proposed scheme of estimating number of tags is easy to implement, number of tags which is less than 4 times of number of slots can estimate tags efficiently, we also proved that identification efficiency based on weighted-slot distinguished with definition of previous slot efficiency can improve system efficiency.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.459-462
• /
• 2005

In this paper, we investigate the high precision location estimation algorithm in 2.45GHz band RTLS with multiple tags. The location is estimated in LOS environments, 300m ${\times}$ 300m area, and 2D coordinates adopting a TDOA scheme which is not necessitate the transmission time of tags. We evaluate the average estimation error in distance assuming that tags are randomly distributed and the readers(3${\sim}$8) are uniformly(equal space) placed in test area. In results, average estimation error is 3.12m and 1.47m at reader numbers of 4 and 8, respectively. Minimum estimation error is obtained when the accumulated receiving signal from a tag is 3 or 4 regardless of available reader numbers. The error is less than 3m, satisfies the specification of RTLS.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.11
• /
• pp.2569-2574
• /
• 2013

In 13.56MHz RFID system of Auto-ID center, STAC protocol is defined as an anti-collision algorithm for multiple tag reading. In STAC protocol, the reader uses the tag number estimation scheme to determine the number of slots for the next reply round. If errors occur in the estimated number of tags, the identification performances will be degraded due to a lot of collision or idle slots. Therefore, in this paper, we propose an ERPB algorithm that the reader cancels the reply round when it experiences a series of collision or idle slots during the current round. The transmission probability control for the tag is also applied to the proposed algorithm. Through simulations, it is demonstrated that the collision rate for the proposed scheme is about 39% lower than STAC protocol. Therefore, the proposed scheme can achieve faster tag identification time compared with STAC protocol due to the low collision rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3A
• /
• pp.360-367
• /
• 2006

In this paper, we designed a digital codec of an RFID tag for EPC global generation 2 class 1. There are a large number of studies on RRD standard and anti-collision algorithm but few studies on the design of digital parts of the RFID tag itself. For this reason, we studied and designed the digital codec hardware for EPC global generation 2 class 1 tag. The purpose of this paper is not to improve former studies but to present the hardware architecture, an estimation of hardware size and power consumption of digital part of the RFID tag. Results are synthesized using Synopsys with a 0.35um standard cell library. The hardware size is estimated to be 111640 equivalent inverters and dynamic power is estimated to be 10.4uW. It can be improved through full-custom design, but we designed using a standard cell library because it is faster and more efficient in the verification and the estimation of the design.