• Journal of the Semiconductor & Display Technology
• /
• v.20 no.1
• /
• pp.48-53
• /
• 2021

The purpose of this study is to establish a crime prevention system through the Crime Prevention Through Environmental Design (CPTED). The research method went through the double diamond process and discovered the user's needs through the persona analysis. The most representative features are the functions that informs users of the safe and optimal route, checks the presence of streetlights or cctvs in real time to update them, and allows people with similar routs to return home together. It is a function to help safe return home with the help of an autonomous method, and a self-defense function to protect themselves. Therefore, the application presented in this study was intended to be of great help when actually returning home by adding these new functions. In particular, we help users to return home most safely by recommending the best safe route. Through the persona analysis, research method which we had chosen, the needs of users were discovered and implemented in a design that reflected those needs and requirements.

• Korean Journal of Artificial Intelligence
• /
• v.10 no.1
• /
• pp.27-32
• /
• 2022

As the need for eco-friendly transportation increases due to the deepening climate crisis, many local governments in Korea are introducing shared bicycles. Due to anxiety about public transportation after COVID-19, bicycles have firmly established themselves as the axis of daily transportation. The use of shared bicycles is spread, and the demand for bicycles is increasing by rental offices, but there are operational and management difficulties because the demand is managed under a limited budget. And unfortunately, user behavior results in a spatial imbalance of the bike inventory over time. So, in order to easily operate the maintenance of shared bicycles in Seoul, bicycles should be prepared in large quantities at a time of high demand and withdrawn at a low time. Therefore, in this study, by using machine learning, the linear regression algorithm and MS Azure ML are used to predict and analyze when demand is high. As a result of the analysis, the demand for bicycles in 2018 is on the rise compared to 2017, and the demand is lower in winter than in spring, summer, and fall. It can be judged that this linear regression-based prediction can reduce maintenance and management costs in a shared society and increase user convenience. In a further study, we will focus on shared bike routes by using GPS tracking systems. Through the data found, the route used by most people will be analyzed to derive the optimal route when installing a bicycle-only road.

• Journal of the Korea Safety Management & Science
• /
• v.21 no.4
• /
• pp.51-58
• /
• 2019

The LBS(Location Based Service) technology plays an important role in reducing wastes of time, losses of human lives and economic losses by detecting the user's location in order by suggesting the optimal evacuation route of the users in case of safety accidents. We developed an algorithm to estimate indoor location, movement path and indoor location changes of smart phone users based on the built-in sensors of smartphones and the dead-reckoning algorithm for pedestrians without a connection with smart devices such as Wi-Fi and Bluetooth. Furthermore, seven different indoor movement scenarios were selected to measure the performance of this algorithm and the accuracy of the indoor location estimation was measured by comparing the actual movement route and the algorithm results of the experimenter(pedestrian) who performed the indoor movement. The experimental result showed that this algorithm had an average accuracy of 95.0%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.7
• /
• pp.3386-3411
• /
• 2019

Secured and reliable routing is a crucial factor for improving the performance of Wireless Mesh Networks (WMN) since these networks are susceptible to many types of attacks. The existing assumption about the internal nodes in wireless mesh networks is that they cooperate well during the forwarding of packets all the time. However, it is not always true due to the presence of malicious and mistrustful nodes. Hence, it is essential to establish a secure, reliable and stable route between a source node and a destination node in WMN. In this paper, a trust based secure routing algorithm is proposed for enhancing security and reliability of WMN, which contains cross layer and subject logic based reliable reputation scheme with security tag model for providing effective secured routing. This model uses only the trusted nodes with the forwarding reliability of data transmission and it isolates the malicious nodes from the providing path. Moreover, every node in this model is assigned with a security tag that is used for efficient authentication. Thus, by combining authentication, trust and subject logic, the proposed approach is capable of choosing the trusted nodes effectively to participate in forwarding the packets of trustful peer nodes successfully. The simulation results obtained from this work show that the proposed routing protocol provides optimal network performance in terms of security and packet delivery ratio.

• Proceedings of the KSR Conference
• /
• 1999.11a
• /
• pp.46-53
• /
• 1999

As of July 1999, i,185 lomocotives(excluding metropolitan area electric locomotives) are in Korean National Railroad(KNR). With this limited number of resources assigning locomotives to each trains of timetable is very important in the entire railway management point of view because schedule can be regarded as goods in transportation industry. On a simple rail network, it is rather easier to assign proper locomotives to trains with the experience of operating experts and get optimal assignment solution. However, as the network is getting bigger and complicated, the number of trains and corresponding locomotives will be dramatically increased to rover all the demands required to service all of the trains in timetable. There will be also numerous operational constraints to be considered. Assigning proper locomotives to trains and building optimal cyclic rotations of locomotive routings will result in increasing efficiency of schedule and giving a guarantee of more profit. The purpose of this study is two fold: (1) we consider a planning-level locomotive scheduling problem with the objective of minimizing the wasting cost under various practical constraints and (2) development of implementation prototype program of its assigning result. Not like other countries, i.e. Canada, Sweden, Korean railroad operates on n daily schedule basis. The objective is to find optimal assignment of locomotives of different types to each trains, which minimize the wasting cost. This problem is defined on a planning stage and therefore, does not consider operational constraints such as maintenance and emergency cases. Due to the large scale of the problem size and complexity, we approach with heuristic methods and column generation to find optimal solution. The locomotive scheduling prototype consists of several modules including database, optimization engine and diagram generator. The optimization engine solves MIP model and provides an optimal locomotive schedule using specified optimization algorithms. A cyclic locomotive route diagram can be generated using this optimal schedule through the diagram generator.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11B
• /
• pp.981-988
• /
• 2008

In this paper, the efficient AODV routing algorithm in MANET is proposed. Because transmission channel has a high error rate and loss in MANET, the number of hops can't be regarded as an absolute network metric. After measuring FER periodically at the data link layer using cross-layer design, the scheme that every node forwards the weight of link status in the reserved field of AODV protocol is used. In order to find the efficient route, we design AODV to be able to select an optimal route that has a good channel status by evaluating the sum of weight. The proposed AODV improves throughput, routing overhead and average end-to-end delay in comparison with the generic AODV.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.8 no.3
• /
• pp.122-131
• /
• 2009

Ubiquitous-Transportation sensor network is able to realize a vehicle ad-hoc network. Since there are some problems in an existing ITS system, the new technology and traffic information strategies are requirements in this advanced system, u-TSN. The purposes of this paper is to introduce the components on u-TSN system, establish new traffic strategies for this system, and then evaluate these strategies by making a comparative study of ITS and using micro traffic simulator, AIMSUN. The strategy evaluated by AIMSUN is position-based multicast strategy which provides traffic information to vehicles using V2I (vehicle to Infrastructure) communication. This paper focuses on the providing real-time route guidance information when congestion is occurred by the incidents. This study estimates total travel time on each route by API modules. Result from simulation experiments suggests that position-based multicast strategy can achieve more optimal network performance and increased driver satisfaction since the total accumulated travel times of both the major road and the total system on position-based multicast strategy are less than those on VMS.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.8
• /
• pp.344-351
• /
• 2016

In the point of view of a train operator, the main concern with a train operation is not only to maintain a time schedule, but also to decrease the energy consumption as much as possible. Generally for a manual drive, a train conductor controls the train acceleration and deceleration by controlling the notches not to exceed the regulation velocity by considering the given maximum velocity profile for an operation route. For this case, the guideline for a conductor is needed to choose the proper notches by applying the notch optimization so as to drive at the regulation velocity and minimize energy consumption simultaneously. In this paper, the real-time notch optimization plan is suggested using a genetic algorithm that optimizes the notches for the remaining route in real time when the event occurs that track information or regulation velocity profile of the remaining route changes during train operation as well as a normal operation situation. An energy saving effect and the convergence behavior of the optimal solution obtained was analyzed in a genetic algorithm.

• International Journal of Computer Science & Network Security
• /
• v.21 no.12
• /
• pp.1-8
• /
• 2021

In Mobile Ad-Hoc Network (MANET) Application, routing protocol is essential to ensure successful data transmission to all nodes. Ad-hoc On-demand Distance Vector (AODV) Protocol is a reactive routing protocol that is mostly used in MANET applications. However, the protocol causes Route Request (RREQ) message flooding issue due to the broadcasting method at the route request stage to find a path to a particular destination, where the RREQ will be rebroadcast if no Request Response (RREP) message is received. A scalable neighbor-based routing (SNBR) protocol was then proposed to overcome the issue. In the SNBR protocol, the RREQ message is only rebroadcast if the number of neighbor nodes less than a certain fix number, known as drop factor. However, since a network always have a dynamic characteristic with a dynamic number of neighbor nodes, the fix drop factor in SNBR protocol could not provide an optimal flooding problem solution in a low dense network environment, where the RREQ message is continuously rebroadcast RREQ message until reach the fix drop factor. To overcome this problem, a new broadcasting method as Dynamic SNBR (DSNBR) is proposed, where the drop factor is determined based on current number of neighbor nodes. This method rebroadcast the extra RREQ messages based on the determined dynamic drop factor. The performance of the proposed DSNBR is evaluated using NS2 and compared with the performance of the existing protocol; AODV and SNBR. Simulation results show that the new routing protocol reduces the routing request overhead, energy consumption, MAC Collision and enhances end-to-end delay, network coverage ratio as a result of reducing the extra route request messages.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.565-569
• /
• 2007

To find optimal path is killer application in the telematics system. The shortest path of conventional system, however, isn't always optimal path. That is, the path with minimum travelling time could be defined as optimal path in the road networks. There are techniques and algorithms for finding optimal path. Hierarchical path algorithm categorizes road networks into major layer and minor layer so that the performance of operational time increases. The path searched is accurate as much as optimal path. At above 2 system, a method to allocate minor roads to major road region influences the performance extremely. This paper proposes methods to determine search space for selecting major roads in the hierarchical path algorithm. In addition, methods which apply the proposed methods to hierarchical route algorithm is presented.