• 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.30 no.9A
• /
• pp.814-821
• /
• 2005

When there are many tags using the same frequency around the reader in RFID system, they disturb each other and in the end their response cannot be received by the reader. To solve this disturbance and fast identify the tags, the anti-collision algorithm, which is the core technology in RFID system, is needed. We propose two ALOHA-type Dynamic Framed Slotted ALOHA(DFS-ALOHA) algorithms using Dynamic Slot Allocation(DSA), which dynamically allocates the frame size in accordance with the number of tags and Tag Estimation Method(TEM), which estimates the number of tags around the reader. We also compare the performance of the proposed DFS-ALOHA algorithms with that of the conventional Framed Slotted ALOHA (FS-ALOHA) algorithms and the algorithms proposed by Vogt using OPNET simulation. According to the analysis, the two proposed DFS-ALOHA algorithms(DFS-ALOHA I and DFS-ALOHA II) show better performance than the conventional ALOHA-based algorithms regardless of the number of tags. Although the two proposed DFS-ALOHA algorithms show the similar performance, BFS-ALOHA ll is better because it is easier to be implemented in the system and the complexity is lower.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.756-758
• /
• 2010

Fixed frame size is used in the RFID system with the frame-based slot ALOHA algorithm. Therefore, it is anticipated that the tag identification performances will highly depend on the number of tags within the reader's identification range and the frame size. In this paper, we propose a tag number estimation scheme and analyze the performance with the computer simulations. The proposed scheme is based on the status of slots that the tags respond during a query round as well as the probabilistic calculations.

• Proceedings of the KIEE Conference
• /
• 2007.10a
• /
• pp.507-508
• /
• 2007

확률적(stochastic) RFID 충돌방지 알고리즘은 둘 이상의 태그가 리더기의 인식범위 내에 있을 경우 태그들이 동시에 리더기의 질의에 응답함으로서 발생하는 충돌을 확률적으로 감소시켜, 정확하고 빠르게 다수의 태그를 인식하기 위한 알고리즘이다. 본 논문에서는 확률적 충돌방지 알고리즘 중 하나인 dynamic framed ALOHA를 기반으로 새로운 태그 수 추정 방법을 이용한 RFID 충돌 방지 알고리즘을 제안하였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.615-617
• /
• 2014

The PS algorithm divides the tags within the identification range of reader into smaller groups by increasing the transmission power incrementally and identifies them. This algorithm uses the fixed frame size at every scan. Therefore, it has problems that the performance of PS algorithm can be variously shown according to the number of tags, frame size, and power level increase. In this paper, we propose an EPS algorithm that allocates the optimal frame size by estimating the number of tags at each scan.

• Proceedings of the KSME Conference
• /
• 2005.11a
• /
• pp.202.2-202.2
• /
• 2005

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.723-725
• /
• 2016

In Gen-2 Q-algorithm, if the number of tags is small and we let the initial $Q_{fp}$ be large, the number of empty slot will be large. On the other hand, if we let the initial $Q_{fp}$ be small in spite of many tags, almost all the slots will be collided. Also, if the reader selects an inappropriate weight, there are a lot of empty or collided slots. As a result, the performance will be declined because the frame size does not converge to the optimal point quickly during the query round. In this paper, we propose a scheme to select the weight based on the slot-count size of current query round through the tag number estimation and.

• Journal of the Institute of Convergence Signal Processing
• /
• v.9 no.2
• /
• pp.164-172
• /
• 2008

This paper presents the efficient localization of a mobile robot traveling on the floor with tags installed, using the spatial and temporal information acquired from passive RFID environment. Compared to previous research, the proposed localization method can reduce the position estimation error and also cut down the initial cost tag installation cost. Basically, it is assumed that a mobile robot is traveling over a series of straight line segments, each at a certain constant velocity, and that the number of tags sensed by a mobile robot at each sampling instant is at most one. First, the velocity and position estimation of a mobile robot starting from a known position, which is valid for all segments except the first one. Second, for the first segment in which the starting position is unknown, the velocity and position estimation is made possible by enforcing a mobile robot to traverse at least two tags at a constant velocity with the steering angle unchanged. Third, through experiments using our passive RFID localization system, the validity and performance of the mobile robot localization proposed in this paper is demonstrated.

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

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.18 no.1 s.116
• /
• pp.31-36
• /
• 2007

In the RFID system, one of the important criteria of tag antenna performance is the detection distance. The most important factor determining the detection distance of the tag antenna is the Radar Cross Sections(RCS). In this paper, we propose a method to simply measure the RCS of the RFID tag antenna using two reader antennas(Tx and Rx) and a network analyzer. We estimate RCS' from the RCS equation based on the measured $S_{21}$ using the network analyzer. We compare the measured $S_{21}$ values with the calculated $S_{21}$ values and the simulated $S_{21}$ values using EM simulator. The used tag antennas are two kinds of dipole-type, metal-type, and an inductively-coupled type ones. In case of the dipole type, the measured, simulated and calculated values of the RCS are almost the same. In case of other types, we obtain the measured RCS values with a difference of about 3 dB.