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

• Journal of Korea Multimedia Society
• /
• v.15 no.11
• /
• pp.1358-1368
• /
• 2012

A tag sequence estimation scheme is to estimate the physical sequence of passive RFID tags that are linearly spread using the movement of a RFID reader. Since RFID readers communicate with the passive tags by very weak radio waves, scanning passive tags are unstable. In this paper, we applied round-trip scanning of a reader to enhance the tag sequence estimation. Proposed scheme first determines the turning point of the reader movement, and then estimates the sequence of the tags using the tag sets scanned in each read cycles. Test experiments show that the proposed scheme can improve the estimation accuracy.

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

• Proceedings of the KIEE Conference
• /
• 2008.07a
• /
• pp.1815-1816
• /
• 2008

본 논문에서는 RFID 태그 인프라 혹은 RFID 태그 플로어 상에서 RFID 리더를 이용한 위치추정 시에 RFID리더의 송출전력을 제어하여 위치추정 성능을 향상시키는 방법을 제시한다. 또한 RFID 위치 추정 문제에 대하여 정의하고 이들의 성능을 비교하는 성능 기준 (Performance measure)을 이용하여 송출전력을 제어할 경우와 그렇지 않은 경우의 위치추정 성능을 시뮬레이션과 실험을 통해서 비교한다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.2
• /
• pp.559-569
• /
• 2010

We propose an RFID system based on range-free localization method. This method recognizes pre-determined reference tags first, and then checks within which reference tag the target tag is placed closest. It estimates target tag's position relative to the reference tag's position. We use Aging Counter to estimate the distance between reference and target tags using the read ratio of RFID tags. Practicality of the proposed method is verified by applying it to a library book locating system.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.616-619
• /
• 2012

When multiple Tags transmit their IDs to the Reader, tag identification time is delayed due to collisions. Therefore, to reduce the reader's identification time, an efficient anti-collision technology is needed. In this paper, a new anti-collision method is proposed. The method estimates the number of tags and allocates proper number of slots based on the DFSA. The performance of proposed method is compared with existing methods through extensive simulations.

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

• Journal of KIISE:Information Networking
• /
• v.33 no.6
• /
• pp.420-427
• /
• 2006

An RFID system is an important technology that could replace the traditional bar code system changing the paradigm of manufacturing, distribution, and service industry. An RFID reader can recognize several hundred tags in one second. Tag identification is done by tags' random transmission of their IDs in a frame which is assigned by the reader at each round. To minimize tag identification time, optimal frame size should be selected according to the number of tags. This paper presents new query optimization methods in RFID systems. Query optimization consists of tag number estimation problem and frame length determination problem. We propose a simple yet efficient tag estimation method and calculate optimal frame lengths that minimize overall query time. We conducted rigorous performance studies. Performance results show that the new tag number estimation technique is more accurate than previous methods. We also observe that a simple greedy method is as efficient as the optimal method in minimizing the query time.