• Proceeding of EDISON Challenge
• /
• 2015.03a
• /
• pp.479-483
• /
• 2015

In case of the big city, choosing the adequate root of which we can reach the destination can affect the driver's condition and driving time. so it is quite important to find the optimal routes for arriving the destination as considering the factors, such as driving conditions or travel time and so on. In this paper, we develop route choice model with considering driving conditions and travel time, and it can search the optimal path which make drivers reduce their fatigues using genetic algorithm.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1505-1508
• /
• 2004

반응적 Ad hoc 라우팅인 AODV의 경로관리는 노드 이동, 노드 혼잡 등의 원인으로 지정시간 내에 응답을 하지 못할 경우 경로 단절을 감지한 뒤 경로복구 과정을 수행한다. 그러나 이러한 경로관리 방법은 능동적이지 못하여 단절 후 경로 재 설정까지 시간 지연이 발생하기 때문에 신속한 경로 복구에 어려움이 있다. 본 논문에서는 기존 AODV에 대한 추가적인 제어 패킷을 발생시키지 않고 경로를 구성하고 있는 이웃노드 Hello 패킷의 수신 시간차를 이용하여 경로 불안정을 예측, Expanding Ring Search 알고리즘을 활용한 효율적인 경로관리 기법을 제시한다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2019.07a
• /
• pp.133-134
• /
• 2019

기존 택시 어플리케이션의 방식은 승객이 택시를 이용할 때 승객 근처의 택시들이 승객을 선착순으로 선택하는 방식이다. 이는 승객이 택시의 정보를 알 수 없으며 승객을 선택한 택시를 탑승해야 된다. 또 택시 관련 범죄가 지속적으로 발생하고 있으며 사회적으로 심각한 문제로 떠오르고 있다. 본 논문에서는 이를 해결하기 위하여 승객이 주변 택시들을 검색하여 선택할 수 있으며 택시의 정보를 제공 받을 수 있다. 그리고 택시 범죄를 예방하기 위해 승객이 여러 경로 중에서 원하는 경로를 선택하면 택시 기사에게 전송하여 이탈 시 감지할 수 있다.

• Journal of KIISE:Information Networking
• /
• v.35 no.6
• /
• pp.521-528
• /
• 2008

Such conventional maritime communication technologies as radio have short some comings in their transmission quality. It can be overcome by wireless channels provided by satellites such as INMARSAT, which nevertheless suffer from the high costs. In this paper, we propose a novel technology resolving the above problems, featuring in the establishment of maritime communication networks with multi-hop structures. The inter vessel and ship-to- shore networks previously modeled after MANET are remodeled by SANET (Ship Ad Hoc Networks) in the present work. Fan-shaped Search Zone Routing (FSR) protocol also is presented, which utilizes not only static geographical information including the locations of ports and the navigations of courses but also the unique characteristics of ships in terms of mobile nodes. The FSR finds the fan-shaped search zone on which the shortest path is located. The performance of LAR protocol is compared with that of FSR in several ways. First, FSR does not make use of a type of control packets as beaconing data, resulting in a full utilization of the bandwidth of the wireless channels. Second, the delivery rate by the FSR is 100% for the fan-shaped search zone includes at least one route between source and destination nodes on its border line, where as that of LAR has been turned out to be 64%. Third, the optimality of routes searched by the FSR is on a 97% level. Of all, the FSR shows a better performance than LAR by about 50%.

• Journal of the Korean Society for information Management
• /
• v.37 no.3
• /
• pp.253-274
• /
• 2020

In this study, text mining and main path analysis (MPA) were applied to understand the origins and development paths of research areas that make up the mainstream of Korean studies. To this end, a quantitative analysis was attempted based on digital texts rather than the traditional humanities research methodology, and the main paths of Korean studies were extracted by collecting documents related to Korean studies including citation information using a citation database, and establishing a direct citation network. As a result of the main path analysis, two main path clusters (Korean ancient agricultural culture (history, culture, archeology) and Korean acquisition of English (linguistics)) were found in the key-route search for the Humanities field of Korean studies. In the field of Korean Studies Humanities and Social Sciences, four main path clusters were discovered: (1) Korea regional/spatial development, (2) Korean economic development (Economic aid/Soft power), (3) Korean industry (Political economics), and (4) population of Korea (Sex selection) & North Korean economy (Poverty, South-South cooperation).

• Journal of the Korean Society for Railway
• /
• v.12 no.4
• /
• pp.488-498
• /
• 2009

The characteristics of intercity rail network are different from those of public transit network in urban area. In this paper, we proposed a new transit assignment model which is generalized form of deterministic assignment model by introducing line selection probability on route section. This model consider various characteristics of intercity rail and simplify network expansion for appling search algorithms developed in road assignment model. We showed the model availability by comparing with existing models using virtual networks. The tests on a small scale network show that this model is superior to existing models for predicting intercity rail demand.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.3
• /
• pp.300-309
• /
• 2003

The Japanese developed the first Car navigation system in 1981 with the advent of Honda, which was known as the car inertial navigation system. Now days, It is possible to search the shortest route to and from places and arrival time using the internet via cell phone to the driver based on GIS and GPS. However, even with a good navigation system, it losses the shortest route when there is an average speed of the vehicle being between S-15 kilometers. Therefore, in order to improve the vehicle waiting time and average vehicle speed, we are suggesting an optimal green time algorithm using fuzzy adaptive control, where there are different traffic intersection lengths, and lanes. In this paper, to be able to assist the driver and forecast the optimal traffic information with regards to the road conditions; dangerous roads, construction work and estimation of arrival time at their destination using internet.

• Journal of the Korean Society for Railway
• /
• v.18 no.2
• /
• pp.149-156
• /
• 2015

It is necessary to determine real path for urban railway users in order to allocate revenues between urban railway organizations. Out of several algorithms used to determine optimal routes, the k-path algorithm based on link-label has been utilized. However, this k-path algorithm has certain flaws. For example, optimal route can change depending on the travel and walking time, transfer penalty, and so on. Also, this algorithm cannot take into account the characteristics of users, who prefer express train to normal trains. In this paper, an algorithm is proposed to determine one single optimal route based on the traffic card data. This method also can search for an optimal path in conjunction with the railway timetable.

• Management & Information Systems Review
• /
• v.33 no.4
• /
• pp.39-48
• /
• 2014

In order that a company may reduce expense, according to companies' income statement, the largest amount of money is set to total sales amount, and the next is the sales cost. The method of reducing the sales cost is the common and it is important to take down a unit price at the time of purchase, or to reduce inventory cost. In this research, the cost reduction model for logistics cost reduction is built using the real data of P company, and in order to verify the validity of a model, logistics cost is calculated through a simulation. A real logistics cost is compared with the logistics cost through logistics route rearrange of the proposal model. It will become an opportunity which analyzes the logistics expense of P company through this research, and can be solved in search of the problem of logistics system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.8
• /
• pp.2188-2208
• /
• 2023

Quality of Service (QoS) is a critical feature of Wireless Sensor Networks (WSNs) with routing algorithms. Data packets are moved between cluster heads with QoS using a number of energy-efficient routing techniques. However, sustaining high scalability while increasing the life of a WSN's networks scenario remains a challenging task. Thus, this research aims to develop an energy-balancing component that ensures equal energy consumption for all network sensors while offering flexible routing without congestion, even at peak hours. This research work proposes a Gravitational Blackhole Search Optimised splay tree routing framework. Based on the splay tree topology, the routing procedure is carried out by the suggested method using three distinct steps. Initially, the proposed GBSO decides the optimal route at initiation phases by choosing the root node with optimum energy in the splay tree. In the selection stage, the steps for energy update and trust update are completed by evaluating a novel reliance function utilising the Parent Reliance (PR) and Grand Parent Reliance (GPR). Finally, in the routing phase, using the fitness measure and the minimal distance, the GBSO algorithm determines the best route for data broadcast. The model results demonstrated the efficacy of the suggested technique with 99.52% packet delivery ratio, a minimum delay of 0.19 s, and a network lifetime of 1750 rounds with 200 nodes. Also, the comparative analysis ensured that the suggested algorithm surpasses the effectiveness of the existing algorithm in all aspects and guaranteed end-to-end delivery of packets.