• Journal of Internet Computing and Services
• /
• v.14 no.4
• /
• pp.25-33
• /
• 2013

The procedure of the arbitration which is the tag collision is essential because the multiple tags response simultaneously in the same frequency to the request of the Reader. This procedure is known as Anti-collision and it is a key technology in the RFID system. In this paper, we propose the 4-Bit Pattern Slot Allocation(4-BPSA) algorithm for the high-speed identification of the multiple tags. The proposed algorithm is based on the tree algorithm using the time slot and identify the tag quickly and efficiently through accurate prediction using the a slot as a 4-bit pattern according to the slot allocation scheme. Through mathematical performance analysis, We proved that the 4-BPSA is an O(n) algorithm by analyzing the worst-case time complexity and the performance of the 4-BPSA is improved compared to existing algorithms. In addition, we verified that the 4-BPSA is performed the average 0.7 times the query per the Tag through MATLAB simulation experiments with performance evaluation of the algorithm and the 4-BPSA ensure stable performance regardless of the number of the tags.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.2
• /
• pp.141-150
• /
• 2002

In this paper, we composed orthogonal multi carrier FH/CDMA system using frequency hopping sequence. Considering hit possibilities by delayed other user's signals we searched the optimal number of user access carrier slots not to influence on performance deterioration with the variation of number of carrier slots according to the number of user access carrier slots. A]io, we evaluated the BER performance improvement due to TCM and Concatenated coding technique by computer simulation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.547-549
• /
• 2014

In RFID systems, the performance for the tag identification is closely related with the tag collision, which is caused by the simultaneous transmission. 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 is anticipated 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 analize the performance of PS algorithm according to the frame length and power level increase.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.30 no.1
• /
• pp.82-88
• /
• 2024

As the modern maritime industry rapidly progresses through technological advancements, data processing technology is emphasized as a key driver of this development. Natural language processing is a technology that enables machines to understand and process human language. Through this methodology, we aim to develop a model that predicts the proportions of outcomes when entering new written judgments by analyzing the rulings of the Marine Safety Tribunal and learning the cause-providing ratios of previously adjudicated ship collisions. The model calculated the cause-providing ratios of the accident using the navigation applied at the time of the accident and the weight of key keywords that affect the cause-providing ratios. Through this, the accuracy of the developed model could be analyzed, the practical applicability of the model could be reviewed, and it could be used to prevent the recurrence of collisions and resolve disputes between parties involved in marine accidents.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.3
• /
• pp.441-450
• /
• 2015

Nowadays, many WLAN access points (APs) are deployed in hotspot areas such as shopping malls and stations. As the number of WLAN APs deployed increases, how to manage densely deployed APs in an efficient manner becomes one of the most important issues in WLANs. In this environment, uncoordinated multicast services can lead to frequent collisions due to simultaneous transmissions among APs. In this paper, we propose a multicast scheduling algorithm that can exploit simultaneous transmissions in multiple sectors and avoid redundant transmissions in dense networks. Simulation results demonstrate that the proposed scheme can reduce the multicast transmission latency compared to comparison scheduling schemes.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.2 s.344
• /
• pp.27-38
• /
• 2006

When an RFID reader attempts to read tags, interference might occur if the neighboring readers also attempt to communicate with the same tag at the same time or the neighboring readers use the same frequency at the same time. These interferences cause the RFID reader collision. When the RFID reader collision occirs, either the command from the reader can not be transmitted to the tags or the response from the tags can not be received by the reader correctly. RFID reader anti-collision algorithms have been developed to reduce it. One of the best blown reader anti-collision algorithms is the Colorwave algorithm proposed by MIT. The Colorwave algorithm reduces the reader collisions by having the readers operate at different times. In Colorwave the time is divided into frames and a frame is divided into a number of slots. Each reader can access the tags using the slot time assigned to it. Depending on the probability of the interference, the colorwave adjusts the frame size to improve the efficiency. In this paper, we analyze the operations and the performance of the Colorwave algorithm and identify the problems of the algorithm. We also show that by adding some modifications to the algorithm the performance can be improved significantly.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.10
• /
• pp.1887-1894
• /
• 2016

In the RFID system, the reader transmits a query message to tags in order to identify a unique ID of tags within its detection range. The procedures for arbitrating a collision is essential because the multiple tags can response simultaneously in the same to the query of the Reader. This procedure is known as conflict resolution algorithm and it is a key technology in the RFID system. In this paper, we proposed a variable bits M-ary QT algorithm based on Manchester coding techniques. The proposed algorithm use the location information of the collision bits in the reader and tags. The proposed algorithm can reduce the number of the query-response cycle because it is capable of recognizing discontinuous bits and a variable number of bits. From computer simulation, the proposed method give better performance than the conventional M-ary QT techniques in terms of response, recognition efficiency, communication overhead.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2016.05a
• /
• pp.50-54
• /
• 2016

해양사고 원인규명 통합 분석 시뮬레이션 시스템은 해양사고가 발생하는 과정(선회)을 포함하여 충돌, 좌초, 접촉, 전복, 침수 및 침몰 등의 해양사고를 유체-구조 연성 해석기법의 고도 정밀 M&S 시스템을 사용하여 과학적으로 해양사고의 원인을 분석하고 사고의 손상과정을 체계적으로 재현할 수 있는 시스템이다. 해양사고는 육상과 공중에서 발생하는 자동차와 비행기 등의 충돌이나 추락사고와는 달리 공기의 밀도보다 천배의 물에서 발생하므로 물에서 부양되고, 운동하고, 선내에 물이 침수되고, 운항 중일 때 파도도 생성시키고, 두 물체가 근접할 경우에는 압력이 압착되고, 두 물체가 스쳐 지나거나 안벽이나 해저를 근접하여 운항할 경우에는 압력이 저하되는 등 물에서의 연성효과(interface effect)를 충분히 고려하여 재현할 수 있어야 정확하게 해양사고의 원인을 규명 및 분석할 수 있을 것이다. 또한 황천에서 발생하는 해양사고일 경우에는 강한 조루, 강풍 및 해일성 파도 등을 불규칙 스펙트럼을 사용하여 정확히 구현하여야 황천에서 발생하는 해양사고의 원인을 충분히 분석할 수 있을 것이다. 이러한 해양사고 통합 분석 시뮬레이션 시스템을 이용하여 과학적이고 정확한 해양사고의 원인규명 및 분석으로 심판의 획기적인 신뢰 구축과 심판 지연에 따른 사회적 비용을 최소화하고, 해양사고의 원인과 과실 책임, 나아가서 사고 재발방지 대책수립 등에도 활용하는데도 크게 기여할 것으로 사료된다.

• Journal of Advanced Navigation Technology
• /
• v.12 no.6
• /
• pp.627-633
• /
• 2008

In the case of traffic accidents, the broadcasting methods used in the mobile ad hoc network (MANET) cannot applied to transmit reliable message since moving high-speed in vehicular ad hoc networks (VANET) environments. In this paper, in order to guarantee transmitting reliable messages, we propose a collision avoidance method based-on directional antenna in VANET. In order to reduce interference from omni-broadcasting and to avoid hidden node problem from moving high-speed, we employed a forward-handed and backward directional antenna. The authors simulated the proposed method based on directional antenna and showed that the proposed method has been improved in respect to network utilization compared to existing VANET protocols.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.6
• /
• pp.435-445
• /
• 2013

One of the most challenging issues in radio frequency identification (RFID) and near field communications (NFC) is to correctly and quickly recognize a number of tag IDs in the reader's field. Unlike the probabilistic anti-collision schemes, a query tree based protocol guarantees to identify all the tags, where the distribution of tag IDs is assumed to be uniform. However, in real implements, the prefix of tag ID is uniquely assigned by the EPCglobal and the remaining part is sequentially given by a company or manufacturer. In this paper, we propose an enhanced M-ary query tree protocol (EMQT), which effectively reduces unnecessary query-response cycles between similar tag IDs using m-bit arbitration and tag expectation. The theoretical analysis and simulation results show that the EMQT significantly outperforms other schemes in terms of identification time, identification efficiency and communications overhead.