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

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.3
• /
• pp.430-436
• /
• 2006

In this paper, a QT_rev protocol is proposed for identifying all the tags within the identification range. The proposed QT_rev protocol revises the QT protocol, which has a memoryless property. In the QT_rev protocol, the tag will send the remaining bits of their identification codes when the query string matches the first bits of their identification codes. After the reader receives all the responses of the tags, it knows which bit is collided. If the collision occurs in the last bit, the reader can identify two tags simultaneously without further query. According to the simulation results, the QT_rev protocol outperforms the QT protocol in terms of the number of queries and the number of response bits.

• Journal of the Korea Society for Simulation
• /
• v.17 no.4
• /
• pp.99-112
• /
• 2008

In the passive UHF (860-960MHz) RFID communications, which consists of a set of readers and tags, the readers normally interrogate the tag by using the backscatter mechanism. (i.e., tag response). In practical RFID environment, where multiple readers or tags exist; the interference causes collisions. This paper proposes a centralized arbitration scheme for avoiding the collision problems among multiple readers. The proposed centralized arbitration scheme is modeled in software environments, and is verified with simulation results. Simulated performance is focused on completion time, utilization and response time, and the simulation results show that our proposed scheme provides satisfactory performance grade.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.9
• /
• pp.1569-1574
• /
• 2008

Almost all the RFID systems in the 13.56MHz ISM band adopt the FSA algorithm as the anti-collision algorithm. The FSA algorithm is based on the slotted ALOHA with a fixed frame size. The FSA, though simple, has a disadvantage that when the number of tags is variable, the system performance degrades because of the fixed frame size. Therefore, this paper proposes a new OFSA. The proposed OFSA algorithm dynamically allocates the optimal frame size at every frame based on the number of tags in the reader's identification range. According to the simulation results, the system efficiency of the proposed algorithm should be maintained optimally. Also, the proposed algorithm always obtained the minimum tag identification delay.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5C
• /
• pp.415-421
• /
• 2005

Passive RFID tag does not have its own power, so it has very poor computation abilities and it can deliver signals in very short range. From the facts, most RFID Tag security schemes assumed that the backward channel from tags to a reader is safe from eavesdropping. However, eavesdroppers near a tag can overhear message from a tag illegally. In this paper, we propose a method to protect the backward channel from eavesdropping by illegal readers. The proposed scheme can overcome the problems of conventional schemes such as randomized tree walking, which have been proposed to secure tag information in tree-walking algorithm as an anti-collision scheme for RFID tags. We showed the efficiency of our proposed method by using an analytical model, and it is also shown that the proposed method can provide the probability of eavesdropping in some standardized RFID tag system such as EPCglobal, ISO, uCode near to '0'.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.5
• /
• pp.85-94
• /
• 2008

When an RFID reader uses the same frequency or adjacent frequency with neighbor readers, the interference might occur. These interferences cause the RFID reader collision and errors during tag recognition. Therefore, the international standard for RFID and some papers proposed the methods to reduce the reader collision. The reader interference is closely related to the distance between the readers haying interference and used frequency band. In the previous RFID reader anti-collision algorithms, the location of readers inducing interference which is closely related to interference of readers is not considered. Only the reader collision is tried to reduce through frequency transfer after collisions occur or modification of frame size in relation to collision probability based a TDM(Time Division Multiplex). In this paper, the genetic algorithm using two-dimensional chromosome which reflect readers' location is proposed to prevent reader collision effectively. By executing evolutionary operation with two-dimensional chromosome, the location information having influence on reader interference can be used. The repair operation in the proposed algorithm makes all reader stably recognize their tags.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.5
• /
• pp.20-27
• /
• 2007

In this paper, Air-interface protocols of ISO 18000-6 Type A and B applied to RFID system in UHF band are analyzed, and those algorithms are realized. Also, the improved anticollision algorithms for the Type A and B of ISO 18000-6 protocol are proposed and the performances are compared. As the results, reduction ratio of total tag recognition time of the improved ISO 18000-6 Type A algorithm is 35.2 % for 100 tags and 24.3% for 1000 tags with respect to standard algorithm, respectively. And the reduction ratio of the improved ISO 18000-6 Type B algorithm is 6.0% for 100 tags and 6.6% for 1000 tags. Therefore, the improved anticollision algorithm proposed in this paper is the advanced method improving the performance of tag recognition in the RFID system.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.9
• /
• pp.29-36
• /
• 2010

Consider an RFID network configured as a star such that a single reader is surrounded by a crowd of tags. In the RFID network, prior to attaining the information stored at a tag, the reader must cognize the tags while arbitrating a collision among tags' responses. For this purpose, we present a tag cognizance scheme based on framed and slotted ALOHA, which statically provides a number of slots in each frame for the tags to respond. For the evaluation of the cognizance performance, we choose the cognizance completion probability and the expected cognizance completion time as key performance measures. Then, we present a method to numerically calculate the performance measures. Especially, for small numbers of tags, we derive them in a closed form. Next, we formulate a problem to find an optimal time structure which either maximizes the cognizance completion probability under a constraint on the cognizance time or minimizes the expected cognizance completion time. By solving the problem, we finally obtain an optimal number of slots per frame for the tags to respond. From numerical results, we confirm that there exist a finite optimal number of slots for the tags to respond. Also, we observe that the optimal number of slots maximizing the cognizance completion probability tends to approach to the optimal number of slots minimizing the expected cognizance completion time as the constraint on the cognizance time becomes loose.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.5
• /
• pp.1133-1138
• /
• 2010

In the anti-collision scheme proposed by EPCglobal Class-1 Gen-2 standard, the frame size for a query round is determined by Q-algorithm. In the Q-algorithm, the reader calculates a frame size without estimating the number of tags in it's identification range. It uses only the slot status. Therefore, Q-algorithm has advantage that the reader's algorithm is simpler than other algorithms. However, it cannot allocate an optimized frame size because it does not consider the number of tags. Also, the conventional Q-algorithm does not define an optimized parameter value C for adjusting the frame size. In this paper, we propose a modified Q-algorithm and evaluate the performance with computer simulations. The proposed Q-algorithm estimates the number of tags at every query round, and determines the parameter value C based on the estimated number of tags.