• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.4
• /
• pp.61-67
• /
• 2011

In these days, RFID adoption in supply chain management system needs technically part of the performance improvement of RFID Anti-Collision technology. We contrived new scanning algorithm that improve RFID Anti Collision performance, also can be applied to existing RFID readers. In this paper, the proposed algorithm were applied to the actual logistics scene recognition performance much better than the existing practices are presented. For improve of RFID Anti Collision performance, our algorithm implemented in the middleware associated with RFID PDA readers, and actually mount the RFID inventory data from the experiment were accumulated. Through this experiment, the proposed algorithm was confirmed that helps to minimize unaware area of the existing RFID inventory system and significantly improves performance of RFID field solution.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.5
• /
• pp.425-432
• /
• 2014

The Enhanced Distributed Channel Access (EDCA) function of IEEE 802.11e standard defines contention window (CW) for different Access Category (AC) limits to support Quality-of-Service (QoS). However, it have been remained the problem that the collision probability of transmission is increasing in congested network. Several different solutions have been proposed but the collision occurs among same priority queue within the same station to compete the channel access. This paper presents an APCA (Advanced Priority Collision Avoidance) algorithm for EDCA that increases the throughput in saturated situation. The proposed algorithm use reserved field's bits of FC(Frame Control) using IEEE 802.11e standard's RTS/CTS (Request to Send / Clear to Send) mechanism to avoid data collision. The simulation results show that the proposed algorithm improves the performance of EDCA in packet loss. Using Jain's fairness index formula, we also prove that the proposed APCA algorithm achieves the better fairness than EDCA method under network congested condition.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.1
• /
• pp.25-32
• /
• 2018

Due to heavy computational cost, deformable object simulation requires more effective collision detection method than rigid body simulation. However, when the CPU-based collision detection algorithm is purely applied to the GPU environment, the collision detection algorithm and the data structure optimized for the GPU environment are essential because the performance of the GPU can not be used properly. Therefore, we propose a GPU-based parallel collision detection algorithm for mass-spring system which is widely used for deformable object representation in this paper. The proposed method uses a parallel algorithm and data structure to reduce collision detection cost through GPU-based curling algorithm using AABB-Octree structure. In this paper, we prove the effectiveness of the proposed method by comparing the intersection test of all triangle pairs in parallel. The results of experimental tests show that the proposed method improves the performance by about 24% on average. Therefore, it is expected that the proposed method can improve the performance of real-time simulation for deformable objects.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.7
• /
• pp.631-636
• /
• 2007

An efficient obstacle avoidance algorithm is proposed in this paper to avoid dynamic obstacles using a collision vector while a tele-operated mobile robot is moving. For the verification of the algorithm, an operator watches through a monitor and controls the mobile robot with a force-reflection joystick. The force-reflection joystick transmits a virtual force to the operator through the Inter-net, which is generated by an adaptive impedance algorithm. To keep the mobile robot safe from collisions in an uncertain environment, the adaptive impedance algorithm generates the virtual force which changes the command of the operator by pushing the operator's hand to a direction to avoid the obstacle. In the conventional virtual force algorithm, the avoidance of moving obstacles was not solved since the operator cannot recognize the environment realistically by the limited communication bandwidth and the narrow view-angle of the camera. To achieve the dynamic obstacle avoidance, the adaptive virtual force algorithm is proposed based on the collision vector that is a normal vector from the obstacle to the mobile robot. To verify the effectiveness of the proposed algorithm, mobile robot navigation experiments with multiple moving obstacles have been performed, and the results are demonstrated.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.4
• /
• pp.46-55
• /
• 2009

In RFID field, when the neighboring readers try to occupy the same or adjacent channel simultaneously, there exists reader-to-reader interference; it calls reader collision. From the reader collision, the tags cannot response correctly query from the reader. Reader anti-collision schemes have been developed, and particularly, the Listen-Before-Talk(LBT) scheme is proposed to avoid reader collision in ETSI in multi channel environment. However, in ETSI, there is a drawback that the reader collision does not decreases effectively because the reader selects randomly a channel without considering the channel environment and readers try to occupy the channel concurrently. In this paper, we propose a algorithm based on LBT scheme considering multi channel environment as well as made up for the drawbacks of LBT The proposed algorithm applies random backoff, the collision avoidance mechanism. And it can reduce delay because of our proposed estimation mechanism Simulation using OPNET shows that the proposed algorithm achieves higher superiority than that of the simple algorithms in sparse and dense reader mode.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12B
• /
• pp.1066-1074
• /
• 2008

In this paper, we proposed an efficient algorithm using pulse signal based on group-node-contention in LR-WPAN. The purpose of IEEE 802.15.4 is low speed, low cost and low power consumption. Recently, as applications of LR-WPAN have been extended, there is a strong probability of collision as well and almost collision occurs because of hidden node problem. Moreover, if the collision continuously occurs due to hidden node collision, network performance could be decreased. Nowadays, although several papers focus on the hidden node collision, algorithms waste the channel resource if continuous collisions frequently occur. In this paper, we assume that PAN has been already formed groups, and by using pulse signal, coordinator allocates channel and orders, and then, nodes in the allocated group can compete each other. Hence, contention nodes are reduced significantly, channel wastage caused by collision is decreased, and data transmission rate is improving. Finally, this algorithm can protect the network from disruption caused by frequent collisions. Simulation shows that this algorithm can improve the performance.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.5
• /
• pp.33-39
• /
• 2010

In this paper, we propose an improved anti-collision algorithm. We have designed an anti-collision unit using this algorithm for the 18000-6 Type C Class 1 Generation 2 standard (Gen2). The Gen2 standard uses a Q-algorithm for incremental method on the Dynamic Slot-Aloha algorithm. It has basically enhanced performance over the Slot-Aloha algorithm. Unfortunately, there are several non-clarified parts: initial value. If an incorrect value is selected, it causes degradation in performance. To increase throughput and system efficiency, and to decrease tag identification time, we propose an improved anti-collision algorithm. prorosed Q algorithm has an increment of 5% of system efficiency and a decrement of 9% of tag identification time.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.1 s.343
• /
• pp.41-48
• /
• 2006

An anti-collision algorithm is very important in the RFID system because it decides tag identification time and tag identification accuracy. We propose improved anti-collision algorithms using Bin slot in RFID system. In the proposed algorithms, if the reader memorizes the Bin slot information, it can reduce the repetition of unnecessary PingID command and the time to identify tags. If we also use ScrollA11ID command in the proposed algorithm, the reader knows the sequence of collided E bits. Using this sequence, the reader can reduce the repetition of PingID command and tag identification time. We analyze the performance of the proposed anti-collision algorithms and compare the performance of the proposed algorithms with that of the conventional algorithm. We also validate analytic results using simulation. According to the analysis, for the random tag n, comparing the proposed algorithms with the conventional algorithm, the performance of the proposed algorithms is about $130\%$ higher when the number of the tags is 200. And for the sequential tag ID, the performance of the conventional algorithm decreases. On the contrary, the performance of the proposed algerian using ScrollA11ID command is about $16\%$ higher than the case of using random tag ID.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2009.10a
• /
• pp.62-63
• /
• 2009

A monitoring system of collision risk among multiple ships is newly-designed in order to reduce human error and make vessel traffic control more effective. By using AIS data as ships' navigational information, an estimation algorithm of collision risk among multiple ships is newly-designed. To consider ships' course of now and future, collision risks of multiple ships can be calculated by using fuzzy algorithm. To test the performance of new algorithm, replay simulations are carried out on actual AIS data collected from VTS center of Ulsan harbor in Korea. The AIS data include 25 ships' information for two hours. In this paper, the features of newly-designed estimation algorithm of collision risk and the results of replay simulation are discussed.