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

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.1
• /
• pp.127-132
• /
• 2018

One of the key issues in the Unmanned Aerial Vehicle (: UAV) technology is the collision avoidance. Specifically, the collision avoidance among multiple UAVs is critical to expand UAV applications to civil sector where large number of UAVs could be operated in the limited space. In this paper, we introduce a collision avoidance scheme based on Flying Ad Hoc Network (: FANET). The proposed scheme adopts collision avoidance mechanism used in wireless data communication networks. Using this scheme UAVs can not only communicate conventional user information, but also share flight information to avoid collision.

• Journal of KIISE:Information Networking
• /
• v.34 no.5
• /
• pp.316-327
• /
• 2007

RFID (Radio Frequency Identification) is one of the most promising air interface technologies in the future for object identification using radio wave. If there are multiple tags within the range of the RFID tag reader, all tags send their tag identifications to the reader at the same time in response to the reader's query. This causes collisions on the reader and no tag is identified. A multi-tag identification problem is a core issue in the RFID. It can be solved by anti-collision algorithm such as slot based ALHOA algorithms and tree based algorithms. This paper, proposes a collision tree based anti-collision algorithm using collision tree in RFID system. It is a memory-less algorithm and is an efficient RFID anti-collision mechanism. The collision tree is a mechanism that can solve multi-tag identification problem. It is created in the process of querying and responding between the reader and tags. If the reader broadcasts K bits of prefix to multiple tags, all tags with the identifications matching the prefix transmit the reader the identifications consisted of k+1 bit to last. According to the simulation result, a proposed collision tree based anti-collision algorithm shows a better performance compared to tree working algorithm and query tree algorithm.

• Journal of Advanced Navigation Technology
• /
• v.26 no.6
• /
• pp.427-433
• /
• 2022

Obstacle detection, collision recognition, and avoidance technologies are required the collision avoidance technology for UAVs. In this paper, considering collinear multiple static obstacle, we propose an obstacle detection algorithm using LiDAR and a collision recognition and avoidance algorithm based on CPA. Preprocessing is performed to remove the ground from the LiDAR measurement data before obstacle detection. And we detect and classify obstacles in the preprocessed data using the K-means clustering algorithm. Also, we estimate the absolute positions of detected obstacles using relative navigation and correct the estimated positions using a low-pass filter. For collision avoidance with the detected multiple static obstacle, we use a collision recognition and avoidance algorithm based on CPA. Information of obstacles to be avoided is updated using distance between each obstacle, and collision recognition and avoidance are performed through the updated obstacles information. Finally, through obstacle location estimation, collision recognition, and collision avoidance result analysis in the Gazebo simulation environment, we verified that collision avoidance is performed successfully.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.4
• /
• pp.1035-1044
• /
• 1998

A new multi-channel access scheme and the associated network architecture for a single-hop WDM local area network is proposed in this paper. The proposed architecture has Central Scheduling Node (CSN) for the transmission coordination among many users, which is one of the key issues in single-hop WDM networks. The data channels, source nodes, and destination nodes are selected at CSN in very simple menner. Our scheme can relive the control processing overhead at all nodes in the network which is caused in existing distributed scheduling algorithms. CSN is simple in the architecture can be implemented easily. in respect to the network performance, the maximum obtainable throughput is up to that of the ideal output queuing because of collision free scheduling. We use the MQMS (multi-queue multi-server) model for performance analaysis.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.6
• /
• pp.201-208
• /
• 2010

The classical iterated hash function is vulnerable to a multi-collision attack. Gauravaram et al. proposed 3C and 3C+ hash functions, in which an accumulation chain is added to usual Merkle-Damgard changing. Their goal is to design composition schemes resistant to generic attacks of Joux's type, but Joscak and Tuma have shown that 3C and 3C+ schemes are not better than Merkle-Damgard scheme in term of security against multi-collision attacks under some mild assumptions. In this dissertation, in order to increase security of 3C hash function, we proposed secure double pipe hash function which was effectively using XOR and XNOR operations per blocks of message. We seek to improve on the work of Lucks in a way. Proposed secure double pipe hash function takes resistance to multi-block collision, fixed point and pre-image attacks.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.17 no.3
• /
• pp.11-17
• /
• 2003

In this paper, we implemented 2-wire (data gnd) RS232C serial communication interface by applying the Collision Sensing Multiple Access(CSMA) Protocol. The transmitting and receiving wires of RS232C pert are connected together by the interface circuit forming data wire without hardware modification On two-wired common channel connection simultaneous transmission Don mere than two hosts causes data collision. The collision is detected by loop-back test of transmission data comparing with the fed back data to detect the data distortion. Various models are adopted to reduce the probability of retransmitted data collision and experiments show the performance of each cases. Due to allowing multiple hosts to be accessed through the common communication channel with minimum circuit addition the result of this paper can be easily applied for conventional RS232C instruments and machines to connect to the single data communication line.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.05a
• /
• pp.486-488
• /
• 2006

RFID 기술의 신속한 확산을 위해서는 태그의 저가격화, 초소형화, 저전력화, 보안 및 프라이버시 문제, 태그식별자의 표준화, 다중태그 식별문제등이 우선적으로 해결되어야 한다. 특히, 식별영역 내에 다수의 태그가 존재할 경우에 다중태그 식별(multi-tag identification)을 위한 충돌방지(anticollision) 알고리즘은 RFID 시스템 구축에 있어서 반드시 해결해야 하는 핵심기술이다. 기존의 충돌방지 알고리즘들은 구현의 복잡성과 낮은 성능이 문제로 제기되고 있으며 지금까지 충돌방지와 관련하여 진행된 대부분의 연구들은 각각 고유한 형태의 태그식별자 체계를 기반으로 진행되어 왔으며 태그식별성능에 대한 비교연구도 부족한 상태이다. 본 논문에서는 저비용(low-cost) RFID 시스템에서 현재 표준화가 진행되고 있는 96비트 EPC (Electronic Product Code) 코드를 기반으로 병원 환경에서 태그에 우선순위를 부여하여 충돌이 발생하면 우선순위가 가장 높은 것부터 읽어들일 수 있는 그룹 트리 알고리즘을 제안하였다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2010.07a
• /
• pp.51-54
• /
• 2010

본 논문에서는 포텐셜 필드 방법과 퍼지로직 시스템을 이용하여 멀티 모바일 로봇의 충돌회피를 위한 경로계획을 연구한다. 잘 알려진 포텐셜 필드 방법은 멀티 모바일 로봇 시스템에 있어서 각각의 로봇에 대한 전역경로를 계획하기 위해 사용되었으며, 퍼지로직 시스템은 각 로봇에 근접하는 혹은 진행하는 로봇의 경로를 가로막는 장애물과의 충돌을 피하고 안전하게 목적지에 도달하기 위한 지역경로를 계획하기 위해 이용되었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.350-352
• /
• 2003

일반적인 접근제어 모델이 메커니즘 내에 보안 정책을 미리 설계함에 따라 보안 요구사항의 추가나 변경에 어려움이 있는 반면에, 다중 접근제어 정책 모델은 기업 환경에 필요한 다양한 보안 정책들을 융통성 있게 지원하기 위해, 권한 명세 언어를 기반으로 positive/negative 권한을 모두 표현할 뿐만 아니라, 권한의 예외적 수행, 권한의 전파와 충돌 해결 정책 등을 구현함으로써, 접근제어의 권한 적용에 유연성을 강화하였다. 그러나, 기존의 권한 전파 및 충돌 해결 정책은 권한 전파의 모든 가능한 path를 고려하지 않거나, 충돌 문제를 해결하지 않는 부분이 있는데, 이것은 특히 서로 다른 정책의 어플리케이션 통합 환경에서 권한의 남용이나 상실 등 의도하지 않은 부당한 권한의 실행을 야기시킨다. 따라서, 본 논문에서는 다수의 정책의 영향을 받은 주체에 대해서 권한의 독립적 수행을 보장하면서, 추가적인 충돌 상황을 발생시키기 않는 권한 전파 정책을 제안한다.