• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.5
• /
• pp.26-37
• /
• 2009

This paper suggests a sensor's placement method for detecting the dilemma zone problem when real-time driver's safety service is provided at signalized intersections by multiple pointed traffic sensors using USN environments. For detecting the dangerous situations from vehicles accelerating through yellow intervals, red-light running and stopping abruptly like as dilemma zone problem, VISSIM(microscopic, behavior-based multi-purpose traffic simulation program) is used to perform a real-time multiple detection situation by changing the input data like as various inflow-volume, design speed change, driver perception and response time. As a result, the optimal interval of traffic sensors is 20~27m, and the initialized sensor location from stop-line is different according to road design speed. Moreover, the pattern of detection about dilemma zone is also different according to inflow-volumes. This paper shows that the method is useful to evaluate the sensor's placement problem based on micro-simulation and the results can be used as the basic research for USN services.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.10
• /
• pp.1945-1956
• /
• 1994

In this paper, a multiaccess network protocol for high-speed communication is proposed, which enables multimedia sevices with integrating the existing networks. We examine the traffic control mechanisms and configurations for the network architecture and compare with various protocols which are suitable to high speed LAN/MAN and propose an adaptive access control mechanism. ATMR has low channel utilization due to window size reset time, and that MetaRing is very sensitive over the change of traffic load. This suggested protocol, however, has quite a good performance for that situation by adding adaptive parameter condition. This mechanism may introduce a model of small-scaled Broadband Integrated Service Network and be used as an internetworking system for the ATM network.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.32 no.4
• /
• pp.89-99
• /
• 2007

In this paper, an analytic model of a sleep mode operation in the IEEE 802.16e is investigated. A mobile subscriber station(MSS) goes to sleep mode after negotiations with the base station(BS) and wakes up periodically for a short interval to check whether there is downlink traffic to it. If the arrival of traffic is notified, an MSS returns to wake mode. Otherwise, it again enters increased sleep interval which is double as the previous one. In order to consider the situation more practically, we propose the sleep mode starting threshold, during which MSS should await packets before it enters the sleep mode. By modifying the M/G/l with multiple vacations model, energy consumption ratio(ECR) and average packet response time are calculated. Our analytic model provides potential guidance in determining the optimal parameters values such as sleep mode starting threshold, minimal sleep and maximal sleep window.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3150-3170
• /
• 2016

In Intelligent Transportation Systems (ITS), logistics distribution and mobile e-commerce, the real-time, accurate and reliable vehicle trajectory prediction has significant application value. Vehicle trajectory prediction can not only provide accurate location-based services, but also can monitor and predict traffic situation in advance, and then further recommend the optimal route for users. In this paper, firstly, we mine the double layers of hidden states of vehicle historical trajectories, and then determine the parameters of HMM (hidden Markov model) by historical data. Secondly, we adopt Viterbi algorithm to seek the double layers hidden states sequences corresponding to the just driven trajectory. Finally, we propose a new algorithm (DHMTP) for vehicle trajectory prediction based on the hidden Markov model of double layers hidden states, and predict the nearest neighbor unit of location information of the next k stages. The experimental results demonstrate that the prediction accuracy of the proposed algorithm is increased by 18.3% compared with TPMO algorithm and increased by 23.1% compared with Naive algorithm in aspect of predicting the next k phases' trajectories, especially when traffic flow is greater, such as this time from weekday morning to evening. Moreover, the time performance of DHMTP algorithm is also clearly improved compared with TPMO algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.41 no.4
• /
• pp.138-145
• /
• 2018

In the field of optimization, many studies have been performed on various types of Vehicle Routing Problem (VRP) for a long time. A variety of models have been derived to extend the basic VRP model, to consider multiple truck terminal, multiple pickup and delivery, and time windows characteristics. A lot of research has been performed to find better solutions in a reasonable time for these models with heuristic approaches. In this paper, by considering realtime traffic characteristics in Map Navigation environment, we proposed a method to manage realistic optimal path allocation for the logistics trucks and cargoes, which are dispersed, in order to realize the realistic cargo mixing allowance and time constraint enforcement which were required as the most important points for an online logistics brokerage service company. Then we developed a prototype system that can support above functionality together with delivery status monitoring on Map Navigation environment. First, through Map Navigation system, we derived information such as navigation-based travel time required for logistics allocation scheduling based on multiple terminal multiple pickup and delivery models with time constraints. Especially, the travel time can be actually obtained by using the Map Navigation system by reflecting the road situation and traffic. Second, we made a mathematical model for optimal path allocation using the derived information, and solved it using an optimization solver. Third, we constructed the prototype system to provide the proposed method together with realtime logistics monitoring by arranging the allocation results in the Map Navigation environment.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.3D
• /
• pp.401-407
• /
• 2006

VMS which provides information about real-time traffic situation to the drivers is operating 41 places in 204km section at 2003 present time. Contrary to VMS which is constructed in freeway or highway, VMS in Roadway is increasing the demand of relocating according to development of environment. However there is not any definite standard for ITS field devices' relocating. That would be many problem such as re-relocating in the near future. This study presents optimal VMS relocating methodology using the concept of Decision Problem considering budget and number of drivers given information.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.7
• /
• pp.993-1000
• /
• 2002

In this paper, we design the CORBA-based Mobile Agent Model (CMAM) which has the capability of the efficient work processing in distributed environment through sensing network traffic and searching the optimal path for migration nodes of mobile agent. In case existing mobile agent model is given various works from user, the network overhead and traffic are increased by increasing of execution module size. Also, if it happens a large quantity of traffics due to migration of nodes according to appointment of the passive host(below node) routing schedule by user, it needs much cost for node search time by traffic. Therefore, in this paper, we design a new mobile agent m()del that assures the reliability of agent's migration through dynamic act on the specific situation according to appointment of the active routing schedule and can minimize agent's work processing time through optimal path search. The proposed model assigns routing schedule of the migration nodes actively using an extended MAFFinder. Also, for decreasing overhead of network by agent's size, it separates the existing mobile agent object by mobile agent including only agent calling module and push agent with work executing module based on distributed object type of CORBA. Also, it reduces the required time for round works of mobile agent through the optimal path search of migration nodes.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.550-554
• /
• 2002

In this paper, we design the CORBA-based Mobile-Agent Model (CMAM) which has the capability of the efficient work processing in distributed environment through sensing network traffic and searching the optimal path for migration nodes of mobile agent. In case existing mobile agent model is given various works from user, the network overhead and traffic are increased by increasing of execution module size. Also, if it happens a large quantity of traffics due to migration of nodes according to appointment of the passive host(node) muting schedule by user, it needs much cost for node search time by traffic. Therefore, in this paper, we design a new mobile agent model that assures the reliability of agent's migration through dynamic act on the specific situation according to appointment of the active routing schedule and can minimize agent's work processing time through optimal path search. The proposed model assigns routing schedule of the migration nodes actively using an extended MAFFinder. Also, for decreasing overhead of network by agent's size, it separated by mobile agent including oかy agent calling module and push agent with work executing module based on distributed object type of CORBA. Also, it can reduce the required time for round works of mobile agent through the optimal path search of migration nodes.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.829-832
• /
• 2009

Recently, IT-centered convergence between different industries has undergone rapid expansion, accompanied by major advances in u-IT development and digital convergence. Notably, in the automotive-IT convergence sector, automotive sensors and electronic devices interact closely and intelligently with each other, thereby increasing driver safety and convenience and creating the optimal driving environment. This has led to the generation of value-added for the future-oriented automotive industry. Sensing technologies - which are used to monitor traffic situations and transmit correct information (or warnings) on the road traffic situation to car drivers, and to provide accurate information to road traffic controllers - represent both the birth of high-safety, intelligent automotive technologies and the key to automotive manufacturing. In view of these developments, this paper examines the characteristics and structure of the automotive sensor industry, and outlines the policy implications for the automotive sensor industry with regard to the development of the automotive-IT convergence industry.

• KNOM Review
• /
• v.23 no.1
• /
• pp.34-42
• /
• 2020

Network Function Virtualization (NFV) environment can deal with dynamic changes in traffic status with appropriate deployment and scaling of Virtualized Network Function (VNF). However, determining and applying the optimal VNF deployment is a complicated and difficult task. In particular, it is necessary to predict the situation at a future point because it takes for the process to be applied and the deployment decision to the actual NFV environment. In this paper, we randomly generate service requests in Multiaccess Edge Computing (MEC) topology, then obtain training data for machine learning model from an Integer Linear Programming (ILP) solution. We use the simulation data to train the machine learning model which predicts the optimal VNF deployment in a predefined future point. The prediction model shows the accuracy over 90% compared to the ILP solution in a 5-minute future time point.