• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.17-20
• /
• 2012

In the RFID system, A collision occurs when the multiple tags transmit at the concurrent in slot. Reduce conflicts, in order to maximize the efficiency of the system, the number of tags with the same number of slots are allocated. the number of slots to the next frame determined by the number of contention tags. In this paper, it estimate the number of tags based on the DFSA. Analyzed the performance of the system by the initial set number of tags through simulation.

• 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.

• Journal of information and communication convergence engineering
• /
• v.7 no.2
• /
• pp.164-169
• /
• 2009

An RFID system consists of radio frequency tags attached to objects that need to be identified and one or more electromagnetic readers. Unlike the traditional bar code system, the great benefit of RFID technology is that it allows information to be read without requiring contact between the tag and the reader. For this contact-less feature, RFID technology in the near future will become an attractive alternative to bar code in many application fields. In almost all the 13.56MHz RFID systems, FSA (Framed Slot ALOHA) algorithm is used for identifying multiple tags in the reader's identification range. In FSA algorithm, the tag identification time and system efficiency depend mainly on the number of tags and frame size. In this paper, we propose a tag number estimation scheme and a dynamic frame size allocation scheme based on the estimated number of tags.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.203-206
• /
• 2005

Recently, the RFID(Radio Frequency Identification) technology has gained significant attention. One of the performance issues in RFID systems is to resolve the tag collision among responses from RFID tags. In this paper, we proposed a new scheme for estimation of the number of tags in the reader filed. The scheme is used by anti-collision algorithm to identify multiple tags efficiently. And we also present the simulation result that shows the proposed scheme to estimate tags efficiently and also to improve the systems efficiency.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.12
• /
• pp.2643-2648
• /
• 2012

In the RFID Sytem, When leaders recognize the tag, a anti-collision scheme is an important factor in the performance of the system. Probabilistic-based anti-collision scheme using the slot status is a technique to estimate the number of tags. the schemes to quickly and accurately estimate the number of tags has been a lot of research. However, A initial number tag are not considering in the number of tags unknown environment. In the paper, estimation scheme for the initial number of tag is proposed to solve the problems. we analyze the performance by the initial number of tag and the proposed scheme.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.70-77
• /
• 2009

In an RFID network consisting of a single reader and many tags, a framed and slotted ALOHA, which provides a number of slots for the tags to respond, was introduced for arbitrating a collision among tags' responses. In a framed and slotted ALOHA, the number of slots in each frame should be optimized to attain the maximal efficiency in tag cognizance. While such an optimization necessitates the knowledge about the number of tags, the reader hardly knows it. In this paper, we propose a tag cognizance scheme based on framed and slotted ALOHA, which is characterized by directly taking a Bayes action on the number of slots without estimating the number of tags separately. Specifically, a Bayes action is yielded by solving a decision problem which incorporates the prior distribution the number of tags, the observation on the number of slots in which no tag responds and the loss function reflecting the cognizance rate. Also, a Bayes action in each frame is supported by an evolution of prior distribution for the number of tags. From the simulation results, we observe that the pair of evolving prior distribution and Bayes action forms a robust scheme which attains a certain level of cognizance rate in spite of a high discrepancy between the Due and initially believed numbers of tags. Also, the proposed scheme is confirmed to be able to achieve higher cognizance completion probability than a scheme using classical estimate of the number of tags separately.

• IE interfaces
• /
• v.22 no.3
• /
• pp.278-286
• /
• 2009

The anti-collision algorithms to identify a number of tags in real-time in RFID systems are divided into the anti-collision algorithms based on the Framed slotted ALOHA that randomly select multiple slots to identify the tags, and the anti-collision algorithms based on the Tree-based algorithm that repeat the questions and answer process to identify the tags. In the hybrid algorithm which is combined the advantages of these algorithms, tags are distributed over the frames by selecting one frame among them and then identified by using the Query tree frame by frame. In this hybrid algorithm, however, the time of identifying all tags may increase if many tags are concentrated in a few frames. In this study, to improve the performance of the hybrid algorithm, we suggest an improved algorithm that the tags select a specific group of frames based on the earlier bits of the tag ID so that the tags are distribute equally over the frames. By using the simulation and mathematical analysis, we show that the suggested algorithm outperforms traditional hybrid algorithm from the viewpoint of the number of queries per frame and the time of identifying all tags.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.9
• /
• pp.29-37
• /
• 2004

In RFID system one of the problems that we must solve is to devise a good anti-collision algorithm to improve the efficiency of tag identification which is usually low because of tag collision. Among the existing RFID anti-collision algorithms, Framed Slotted ALOHA algorithm though simple, has a disadvantage that the number of slots used to identify the tags increases exponentially as the number of tags does. In the paper, we propose a new anti-collision algorithm called Partial-Response Framed Slotted ALOHA(PRFSA) which restricts the number of responding tags by dividing the tags into a number of groups when there are large number of tags and changes the frame size when there are small tags. Since the proposed algorithm keeps the frame size and the number of responding tags in such a way that can increase slot utilization, the algorithm shows superior performance to the existing ones. The simulation results showed that the proposed algorithm improves the slot efficiency by 85～100% compared to the existing algorithm.

• Journal of information and communication convergence engineering
• /
• v.8 no.6
• /
• pp.677-681
• /
• 2010

This paper proposes a transmission probability control scheme for enhancing the performances of FSA-based RFID system. In order to maximize the system performance, the number of tags attempting to transmit their identifiers in a frame should be kept at a proper level. The reader calculates the transmission probability according to the number of tags within the identification range of reader and then broadcasts it to tags. Tags, in which their slot counter values reach to zero, attempt to transmit their identifiers with the received probability. Simulation results show that the proposed scheme can offer better throughput and delay performance than the conventional one regardless of the number of tags.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.3
• /
• pp.469-474
• /
• 2009

An RFID system consists of radio frequency tags attached to objects that need to be identified and one or more electromagnetic readers. Unlike the traditional bar code system, the great benefit of RFID technology is that it allows information to be read without requiring contact between the tag and the reader. For this contact-less feature, RFID technology in the near future will become an attractive alternative to bar code in many application fields. In almost all the 13.56MHz RFID systems, FSA algorithm is used for identifying multiple tags in the reader's identification range. In FSA algorithm, the tag identification time and system efficiency depend mainly on the number of tags and frame size. In this paper, we propose a tag number estimation scheme and a dynamic frame size allocation scheme based on the estimated number of tags.