• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.43 no.2
• /
• pp.231-238
• /
• 2023

Since there is a limit to the physically visible horizon that sensors for autonomous driving can perceive, complementary utilization of digital map data such as a Local Dynamic Map (LDM) along the probable route of an Autonomous Vehicle (AV) is proposed for safe and efficient driving. Although the amount of digital map data may be insignificant compared to the amount of information collected from the sensors of an AV, efficient management of map data is inevitable for the efficient information processing of AVs. The objective of this study is to analyze the efficiency of information use and information processing time of AV according to the expansion of the active section of LDM-based static road and traffic information. To carry out this objective, a microscopic simulator model, VISSIM and VISSIM COM, was employed, and an area of about 9 km × 13 km was selected in the Busan Metropolitan Area, which includes heterogeneous traffic flows (i.e., uninterrupted and interrupted flows) as well as various road geometries. In addition, the LDM information used in AVs refers to the real high-definition map (HDM) built on the basis of ISO 22726-1. As a result of the analysis, as the electronic horizon area increases, while short links are intensively recognized on interrupted urban roads and the sum of link lengths increases as well, the number of recognized links is relatively small on uninterrupted traffic road but the sum of link lengths is large due to a small number of long links. Therefore, this study showed that an efficient range of electronic horizon for HDM data collection, processing, and management are set as 600 m on interrupted urban roads considering the 12 links corresponding to three downstream intersections and 700 m on uninterrupted traffic road associated with the 10 km sum of link lengths, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5B
• /
• pp.942-955
• /
• 2000

This paper proposes enhanced designs of global service logic and information flow for the mass-call based IN service, which increase call completion rates and optimize the resource in joint wired and wireless networks. In order to hanve this logic implemented, we design a Dynamic Queue Manager(DQM) applied to the call queuing service feature in the Service Control Point(SCP). In order to apply this logic to wireless service subscribers as well as wired service subscribers, the service registration flags between the Home Location Register(HLR) and the SCP are managed to notify the DQM of the corresponding service subscribers’ mobility. Hence, we present a dynamic queue management mechanism, which dynamically manages the service group and the queue size based on M/M/c/K queueing model as the wireless subscribers roam the service groups due to their mobility characteristics. In order to determine the queue size allocated by the DQM, we simulator and analyze the relationship between the number of the subscriber’s terminals and the drop rate by considering the service increment rate. The appropriate waiting time in the queue as required is simulated according to the above relationship. Moreover, we design and implement the DQM that includes internal service logic interacting with SIBs(Service Independent building Blocks) and its data structure.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.1
• /
• pp.48-59
• /
• 2009

Next generation mobile communication system will have various access networks and provide seamless multimedia data service to mobile nodes. The WiNGS system, one of these access network, has superior RAT(Radio Access Technology) and network connectivity other than previous ones. In this paper, we propose link-layer SR-ARQ between mobile node and WAGW to solve packet re-ordering problem during handover. In the proposed scheme, we apply the adaptive timer at the SR-ARQ sender to reduce unnecessary packet retransmission during handoff and delayed NAK algorithm at the SR-ARQ receiver for delaying NAK response due to temporary out-of-sequenced frames. We evaluate the performance of the proposed scheme by implementing the new SR-ARQ protocol at the link-layer using ns-2 simulator, and show the handover performance is improved greatly by preventing unnecessary retransmission.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2004.11a
• /
• pp.169-174
• /
• 2004

To design ship channel is one of important factors for planning and developing a port. In most case, the core factors for designing ship channel are the layout and width of dvnnel provided the net underkeel clearance is assessed as safety. In this study, Variable Bumper Area(VBA) model is applied to design and assess ship channel. This model reflects ship's principle dimension, ship domain theory, ship speed, conning officer's ship handling skill and experience and all external forces which cause leeway, set and drift and the change of ship maneuvering characteristics. Full Mission Ship Handling Simulator is used to analyze ship dynamic data according to conning officer's ship control, external forces, etc. This model uses Domain-index for assessing the efficiency and safety of the channel. The proposed model is applied to Ulsan new port plan which has a channel width of 1.5 times the length if the largest vessel, a radius if 5 times the length of the largest vessel in a curve of 57 degree centerline angle and SBM facility adjacent to the lateral edge if channel. The result of this study shows tint the width and radius of channel curve are suitable for the target ship but the difficulty of ship handling is caused by the large course change and SBM located in the vicinity if channel.

• The KIPS Transactions:PartC
• /
• v.16C no.6
• /
• pp.773-782
• /
• 2009

A DHT(Distributed Hash Table) based P2P is a method to overcome disadvantages of the existing unstructured P2P method. If a DHT algorithm is used, it can do a fast data search and maintain search efficiency independent of the number of peer. The peers in the DHT method send messages periodically to keep the routing table updated. In a mobile environment, the peers in the DHT method should send messages more frequently to keep the routing table updated and reduce the failure of a request. Therefore, this results in increase of network traffic. In our previous research, we proposed a method to reduce the update load of the routing table in the existing Chord by updating it in a reactive way, but the reactive method had a disadvantage to generate more traffic than the existing Chord if the number of requests per second becomes large. In this paper, we propose an adaptive method of routing table update to reduce the network traffic. In the proposed method, we apply different routing table update method according to the number of request message per second. If the number of request message per second is smaller than some threshold, we apply the reactive method. Otherwsie, we apply the existing Chord method. We perform experiments using Chord simulator (I3) made by UC Berkeley. The experimental results show the performance improvement of the proposed method compared to the existing methods.

• The KIPS Transactions:PartC
• /
• v.16C no.6
• /
• pp.761-772
• /
• 2009

A DHT(Distributed Hash Table) based P2P is a method to overcome disadvantages of the existing unstructured P2P method. If a DHT algorithm is used, it can do a fast data search and maintain search efficiency independent of the number of peer. The peers in the DHT method send messages periodically to keep the routing table updated. In a mobile environment, the peers in the DHT method should send messages more frequently to keep the routing table updated and reduce the failure of a request. Therefore, this results in increase of network traffic. In our previous research, we proposed a method to reduce the update load of the routing table in the existing Chord by updating it in a reactive way, but the reactive method had a disadvantage to generate more traffic than the existing Chord if the number of requests per second becomes large. In this paper, we propose an adaptive method of routing table update to reduce the network traffic. In the proposed method, we apply different routing table update method according to the number of request message per second. If the number of request message per second is smaller than some threshold, we apply the reactive method. Otherwsie, we apply the existing Chord method. We perform experiments using Chord simulator (I3) made by UC Berkeley. The experimental results show the performance improvement of the proposed method compared to the existing methods.

• Journal of Navigation and Port Research
• /
• v.38 no.4
• /
• pp.373-378
• /
• 2014

In order to prepare for recapitalization of differential GNSS (DGNSS) reference station and integrity monitor (RSIM) due to GNSS diversification, this paper focuses on differential correction algorithm using GPS/Galileo pesudorange. The technical standards on operation and broadcast of DGNSS RSIM are described as operation of differential GPS (DGPS) RSIM for conversion of DGNSS RSIM. Usually, in order to get the differential corrections of GNSS pesudorange, the system must know the real positions of satellites and user. Therefore, for calculating the position of Galileo satellites correctly, using the equation for calculating the SV position in Galileo ICD (Interface Control Document), it estimates the SV position based on Ephemeris data obtained from user receiver, and calculates the clock offset of satellite and user receiver, system time offset between GPS and Galileo, then determines the pseudorange corrections of GPS/Galileo. Based on a platform for performance verification connected with GPS/Galileo integrated signal simulator, it compared the PRC (pseudorange correction) errors of GPS and Galileo, analyzed the position errors of DGPS, DGalileo, and DGPS/DGalileo respectively. The proposed method was evaluated according to PRC errors and position accuracy at the simulation platform. When using the DGPS/DGalileo corrections, this paper could confirm that the results met the performance requirements of the RTCM.

• Journal of Korean Society of Transportation
• /
• v.34 no.1
• /
• pp.68-80
• /
• 2016

Interest in freeway truck traffic has increased largely due to greater safety concerns regarding truck-related crashes. The negative interactions between slow-moving trucks and other vehicles are a primary cause of hazardous conditions, which lead to crashes with larger speed variations. To improve operational efficiency and safety, providing a climbing lane that separates slow-moving trucks from higher performance vehicles is frequently considered when upgrading geometrics. This study developed an operations strategy for freeway climbing lanes based on traffic conditions in real time. To consider traffic safety when designing a dynamic strategy to determine whether a climbing lane is closed or open, various factors, including the level of service (LOS) and the percentage of trucks, are investigated through microscopic simulations. A microscopic traffic simulator, VISSIM, was used to simulate freeway traffic streams and collect vehicle-maneuvering data. Additionally, an external application program interface, VISSIM's COM-interface, was used to implement the proposed climbing lane operations strategies. Surrogate safety measures (SSM), including the frequency of rear-end conflicts and, were used to quantitatively evaluate the traffic safety using an analysis of individual vehicle trajectories obtained from VISSIM simulations with various operations scenarios. It is expected that the proposed algorithm can be the backbone for operating the climbing lane in real time for safer traffic management.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.777-781
• /
• 2004

This paper presents an algorithm for multichannel slotted-ring topology medium access protocol (MAC) using in wavelength division multiplexing (WDM) networks. In multichannel ring, there are two main previously proposed architectures: Tunable Transmitter - Fixed Receiver (TTFR) and Fixed Transmitter - Tunable Receivers (FTTR). With TTFR, nodes can only receive packets on a fixed wavelength and can send packets on any wavelengths related to destination of packets. Disadvantage of this architecture is required as many wavelengths as there are nodes in the network. This is clearly a scalability limitation. In contrast, FTTR architecture has advantage that the number of nodes can be much larger than the number of wavelength. Source nodes send packet on a fixed channel (or wavelength) and destination nodes can received packets on any wavelength. If there are fewer wavelengths than there are nodes in the network, the nodes will also have to share all the wavelengths available for transmission. However the fixed wavelength approach of TTFR and FTTR bring low network utilization. Because source node with waiting data have to wait for an incoming empty slot on corresponding wavelength. Therefore this paper presents Tunable Transmitter - Tunable Receiver (TTTR) approach, in which the transmitting node can send a packet over any wavelengths and the receiving node can receive a packet from any wavelengths. Moreover, the self-similar distributed input traffic is used for evaluation of the performance of the proposed algorithm. The self-similar traffic performs better performance over long duration than short duration of the Poison distribution. In order to increase bandwidth efficiency, the Destination Stripping approach is used to mark the slot which has already reached the desired destination as an empty slot immediately at the destination node, so the slot does not need to go back to the source node to be marked as an empty slot as in the Source Stripping approach. MATLAB simulator is used to evaluate performance of FTTR, TTFR, and TTTR over 4 and 16 nodes ring network. From the simulation result, it is clear that the proposed algorithm overcomes higher network utilization and average throughput per node, and reduces the average queuing delay. With future works, mathematical analysis of those algorithms will be the main research topic.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.9
• /
• pp.307-313
• /
• 2012

This paper proposes a hand-eye laser range finder (LRF) based welding plane recognition method for autonomous robotic welding. The robot welding is the process of joining a metal piece and the welding plane along the welding path predefined by the shape of the metal piece. Thus, for successful robotic welding, the position and direction of the welding plane should be exactly detected. If the detected position and direction of the plane is not accurate, the autonomous robotic welding should fail. For precise recognition of the welding plane, a line on the plane is detected by the LRF. For obtaining the line on the plane, the Hough transform is applied to the obtained data from the LRF. Since the Hough transform is based on the voting method, the sensor noise can be reduced. Two lines on the plane are obtained before and after rotation of the robot joint, and then the direction of the plane is calculated by the cross product of two direction vectors of two lines. For verifying the feasibility of the proposed method, the simulation with the robot simulator, RoboticsLab developed by Simlab Co. Ltd., is carried out.