• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.8
• /
• pp.3672-3679
• /
• 2012

Vehicle Ad hoc Network (VANET) is next-generation network technology to provide various services using V2V (Vehicle-to-Vehicle) and V2I (Vehicle-to-Infrastructure). In VANET, many researchers proposed various studies for the safety of drivers. In particular, using the emergency message to increase the efficiency of traffic safety have been actively studied. In order to efficiently transmit to moving vehicle, to send a quick message to as many nodes is very important via broadcasting belong to communication range of vehicle nodes. However, existing studies have suggested a message for transmission to the communication node through indiscriminate broadcasting and broadcast storm problems, thereby decreasing the overall performance has caused the problem. In addition, theses problems has decreasing performance of overall network in various form of road and high density of vehicle node as urban area. Therefore, this paper proposed Clustering based Routing Algorithm (CBRA) to efficiently transmit emergency message in high density of vehicle as urban area. The CBRA managed moving vehicle via clustering when vehicle transmit emergency messages. In addition, we resolve linkage problem between vehicles according to various form of road. The CBRA resolve link brokage problem according to various form of road as urban using clustering. In addition, we resolve broadcasting storm problem and improving efficacy using selection flooding method. simulation results using ns-2 revealed that the proposed CBRA performs much better than the existing routing protocols.

• Journal of Korea Multimedia Society
• /
• v.9 no.5
• /
• pp.595-605
• /
• 2006

In this thesis, GPS and the electronic mapping were used to realize such a system by recognizing license plate numbers and identifying the location of objects that move at synchronous times with simulated movement in the electronic map. As well, throughout the study, a camera attached to a PDA, one of the mobile devices, automatically recognized and confirmed acquired license plate numbers from the front and back of each car. Using this mobile technique in a wireless network, searches for specific plate numbers and information about the location of the car is transmitted to a remote server. The use of such a GPS-based system allows for the measurement of topography and the effective acquisition of a car's location. The information is then transmitted to a central controlling center and stored as text to be reproduced later in the form of diagrams. Getting positional information through GPS and using image-processing with a PDA makes it possible to estimate the correct information of a car's location and to transmit the specific information of the car to a control center simultaneously, so that the center will get information such as type of the car, possibility of the defects that a car might have, and possibly to offer help with those functions. Such information can establish a mobile system that can recognize and accurately trace the location of cars.

• Journal of IKEEE
• /
• v.23 no.1
• /
• pp.280-288
• /
• 2019

In the CR-enabled MANET, routing paths can be easily destroyed due to node mobility and channel unavailability (due to the emergence of the PU of a channel), resulting in significant overhead to maintain/recover the routing path. In this paper, network caching is actively used for route maintenance, taking into account the properties of the CR. In the proposed scheme, even if a node detects that a path becomes unavailable, it does not generate control messages to establish an alternative path. Instead, the node stores the packets in its local cache and 1) waits for a certain amount of time for the PU to disappear; 2) waits for a little longer while overhearing messages from other flow; 3) after that, the node applies local route recovery process or delay tolerant forwarding strategy. According to the simulation study using the OPNET simulator, it is shown that the proposed scheme successfully reduces the amount of control messages for path recovery and the service latency for the time-sensitive traffic by 13.8% and 45.4%, respectively, compared to the existing scheme. Nevertheless, the delivery ratio of the time-insensitive traffic is improved 14.5% in the proposed scheme.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2019.05a
• /
• pp.381-381
• /
• 2019

동남아시아의 급격한 도시인구 증가는 도시화로 파생되는 제반문제를 유발하고 있으며 특히 집중호우와 홍수배제 시설의 부족 및 유관시설의 정보관리체계 부재는 홍수 피해규모를 가중시키고 있다. 인도네시아의 경우 물 재해 관리기관 간의 정보공유체계 부재로, 홍수로 인한 문제해결에 대하여 효과적인 대응이 어려운 실정이다. 주요 물 관리 기관인 유역관리청(BBWS)의 경우 조기홍수경보시스템을 보유하고 있으나 단순 수문현황 모니터링에 국한되어 운영되고 있다. 이에 본 연구에서는 홍수피해를 최소화 할 수 있는 동남아시아 맞춤형 물 재해 관리 클라우드 플랫폼을 개발하여 비구조적 홍수 문제해결의 매개체로 활용하고자 한다. 기본적인 유역 수문현황 모니터링과 함께 댐, 보, 배수문 및 펌프장 등 홍수방어시설물의 운영현황 정보, 홍수상황분석, 홍수위험지도 등 종합적인 물 재해 정보를 제공하고 사전에 홍수위험 지역을 분석하여 유관기관과 공유할 수 있는 물 재해 관리 의사결정지원시스템을 개발하고자 한다. 기본적인 정보관리 체계화를 위하여 인도네시아의 다양한 물 재해 관련기관에서 보유하고 있는 자료들의 통합 클라우드 DB관리 시스템을 구축하였다. 연구대상지역은 인도네시아 수도인 자카르타의 Pesanggrahan유역과 인근 Batam섬 Baloi유역을 선정하였으며 대상 유역의 수문, 기상자료 및 GIS 정보수집은 공동연구기관인 인도네시아 공공사업부 수자원청(MPWH)과 주요 물 관리기관인 유역관리청(BBWS)의 협조를 통하여 진행하였다. 수집된 자료들은 관계형 데이터베이스 관리시스템인 MySQL을 사용하여 통합 물 재해 정보 데이터베이스를 구축하였으며 완성된 데이터베이스의 정보제공 및 공유시스템은 웹기반 인터페이스를 통해 관리되도록 설계하였다. 홍수유출 해석을 위한 분석 엔진은 K-water의 홍수분석 시스템인 FAS를 이용하였다. FAS의 홍수분석모형인 COSFIM과 수리모형인 Fldwav를 연계하는 데이터 분석 플랫폼을 완성하였으며 인도네시아 현지 조건에 부합하는 홍수분석 시스템으로 Customizing과정을 수행하였다. 또한 FAS의 PC기반 시뮬레이션 형식을 DB 연계형 웹서비스 방식으로 연동되도록 개량하였으며 추후 SaaS형 물 재해 분석시스템으로 전환할 수 있는 개발환경을 확보하였다. 개발된 물 재해 분석 플랫폼(WRMP)을 활용하여 인도네시아 공동연구기관과의 협의를 통해 물 재해 관리 시나리오를 수립하고 그 대안을 제시하였으며, 적용 시나리오별 홍수피해 저감 효과를 분석하였다. 또한 향후 방재시설물까지 연계하여 운영효과를 분석할 수 있도록 구조화하였다. 개발된 물 재해 관리 시스템은 개선된 정보처리 및 분석시스템을 활용하여 종합적인 물 재해정보를 제공하고, 사전에 홍수위험 지역을 분석하여 유관기관과 공유할 수 있는 물 재해 관리 의사결정 지원시스템으로써 유용하게 활용될 수 있을 것이다.

• The Journal of the Korea Contents Association
• /
• v.21 no.1
• /
• pp.541-551
• /
• 2021

Among the numerous duties of a librarian in a library, the work of arranging books is a job that the librarian has to do one by one. Thus, the cost of labor and time is large. In order to solve this problem, the interest in book-arranging robots based on artificial intelligence has recently increased. In this paper, we propose the K-ACO algorithm, which is the shortest path algorithm for multi-stops that can be applied to the library book arrangement robots. The proposed K-ACO algorithm assumes multiple robots rather than one robot. In addition, the K-ACO improves the ANT algorithm to create K clusters and provides the shortest path for each cluster. In this paper, the performance analysis of the proposed algorithm was carried out from the perspective of book arrangement time. The proposed algorithm, the K-ACO algorithm, was applied to a university library and compared with the current book arrangement algorithm. Through the simulation, we found that the proposed algorithm can allocate fairly, without biasing the work of arranging books, and ultimately significantly reduce the time to complete the entire work. Through the results of this study, we expect to improve quality services in the library by reducing the labor and time costs required for arranging books.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.20 no.6
• /
• pp.299-312
• /
• 2021

Autonomous vehicles using V2X can drive safely information on areas outside the sensor coverage of autonomous vehicles conventional autonomous vehicles. As V2X technology has emerged as a key component of autonomous vehicles, research on V2X security is actively underway research on risk analysis due to failure of V2X communication is insufficient. In this paper, the service scenario and function of autonomous driving system V2X were derived by presenting the intersection scenario of the autonomous vehicle, the malfunction was defined by analyzing the hazard of V2X. he ISO26262 Part3 process was used to analyze the risk of malfunction of autonomous vehicle V2X. In addition, a fault injection scenario was presented to verify the fail-safe of the simulation-based intersection scenario.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.11
• /
• pp.181-190
• /
• 2022

In this paper, we use a LiDAR sensor and an image camera to detect a left-turning waiting vehicle in two ways, unlike the existing image-type or loop-type left-turn detection system, and a left-turn traffic signal corresponding to the waiting length of the left-turning lane. A system that can efficiently assign a system is introduced. For the LiDAR signal transmitted and received by the LiDAR sensor, the left-turn waiting vehicle is detected in real time, and the image by the video camera is analyzed in real time or at regular intervals, thereby reducing unnecessary computational processing and enabling real-time sensitive processing. As a result of performing a performance test for 5 hours every day for one week with an intersection simulation using an actual signal processor, a detection rate of 99.9%, which was improved by 3% to 5% compared to the existing method, was recorded. The advantage is that 99.9% of vehicles waiting to turn left are detected by the LiDAR sensor, and even if an intentional omission of detection occurs, an immediate response is possible through self-correction using the video, so the excessive waiting time of vehicles waiting to turn left is controlled by all lanes in the intersection. was able to guide the flow of traffic smoothly. In addition, when applied to an intersection in the outskirts of which left-turning vehicles are rare, service reliability and efficiency can be improved by reducing unnecessary signal costs.

• KIPS Transactions on Computer and Communication Systems
• /
• v.12 no.10
• /
• pp.299-308
• /
• 2023

As the spectrum shortage problem has accelerated by the emergence of various services, New Radio-Unlicensed (NR-U) has appeared, allowing users who communicated in licensed bands to communicate in unlicensed bands. However, NR-U network users reduce the performance of Wi-Fi network users who communicate in the same unlicensed band. In this paper, we aim to simultaneously maximize the fairness and throughput of the unlicensed band, where the NR-U network users and the WiFi network users coexist. First, we propose an optimal power allocation scheme based on Monte Carlo Policy Gradient of reinforcement learning to maximize the sum of rates of NR-U networks utilizing rate-splitting multiple access in unlicensed bands. Then, we propose a channel occupancy time division algorithm based on sequential Raiffa bargaining solution of game theory that can simultaneously maximize system throughput and fairness for the coexistence of NR-U and WiFi networks in the same unlicensed band. Simulation results show that the rate splitting multiple access shows better performance than the conventional multiple access technology by comparing the sum-rate when the result value is finally converged under the same transmission power. In addition, we compare the data transfer amount and fairness of NR-U network users, WiFi network users, and total system, and prove that the channel occupancy time division algorithm based on sequential Raiffa bargaining solution of this paper satisfies throughput and fairness at the same time than other algorithms.

• Journal of the Korea institute for structural maintenance and inspection
• /
• v.28 no.3
• /
• pp.100-107
• /
• 2024

Currently, in Korea, due to the rapid aging and deterioration of facilities, the minimum Maintenance Level and Performance Level' of facilities are required by the 'Facility Safety Act' or 'Infrastructure Management Act'. Since infrastructure assets have a long lifespan and the pattern of deterioration over time is complex, it is very difficult to maintain infrastructure as 'minimum maintenance state' or 'minimum performance state' by the current way of management. 'Asset Management' shall be performed not only by a technical perspective, but also by an accounting perspective such as cost and asset value. However, due to lack of awareness of 'asset management' among stakeholder, only technical perspective management is being carried out in practice. In order to effectively manage infrastructure assets, complex consideration of various asset value factors such as budget and service as well as safety and durability are required. In this paper, we presented a theory to evaluate and quantify the road network value for efficient asset management of the road network. We also presented a method of simulation to apply the theory presented in this paper. Through simulation and the results derived from this study, it is possible to specify the budget for the future national asset management, and to optimize the strategy for the management of old road facilities.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.8
• /
• pp.2052-2063
• /
• 1998

Various full-scale radio location systems have been developed since ground-based radio navigation systems appeared during World War II, and more recently global positioning systems (GPS) have been widely used as a representative location system. In addition, radio location systems based on cellular systems are intensively being studied as cellular services become more and more popular. However, these studies have been focused mainly on macrocellular systems of which based stations are mutually synchronized. There has been no study about systems of which based stations are asynchronous. In this paper, we proposed two radio location algorithms in microcellular CDMA systems of which base stations are asychronous. The one is to estimate the position of a personal station at the center of rectangular shaped area which approximates the realistic common area. The other, as a method based on road map, is to first find candidate positions, the centers of roads pseudo-range-distant from the base station which the personal station belongs to and then is to estimate the position by monitoring the pilot signal strengths of neighboring base stations. We compare these two algorithms with three wide-spread algorithms through computer simulations and investigate interference effect on measuring pseudo ranges. The proposed algorithms require no recursive calculations and yield smaller position error than the existing algorithms because of less affection of non-line-of-signt propagation in microcellular environments.