• Journal of Korean Society of Forest Science
• /
• v.105 no.1
• /
• pp.115-121
• /
• 2016

This study was conducted to provide the basic policy information for establishing efficient forest-road networks. Synthetic forest-road networks that consist of main and spur roads and forest-road networks with only main road (hereafter called "main-road network") were planned for the five forest-road experimental districts of Korea Forest Service in this study. Road density of the synthetic forest-road networks was calculated and compared with the road density of the main-road networks. The results showed that the optimum road density of the synthetic forest-road networks was 10.1~15.9 m/ha, and the road density of the main-road networks was 8.4~12.4 m/ha. The construction cost of the synthetic forest-road networks was estimated about 1~8% lower than the main-road networks, while the road density was 20~30% greater than the main-road networks. As timber volume and hauling cost increased, the optimum road density of the synthetic forest-road networks increased, within which the road density of highstandard main road rapidly increased. On the other hand, the spur road density increased with slope gradient.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.4
• /
• pp.1836-1842
• /
• 2015

On road networks, the clustering of moving objects is important for traffic monitoring and routes recommendation. The existing schemes find out density route by considering the number of vehicles in a road segment. Since they don’t consider the features of each road segment such as width, length, and directions in a road network, the results are not correct in some real road networks. To overcome such problems, we propose a clustering method for congested routes discovering from the trajectories of moving objects on road networks. The proposed scheme can be divided into three steps. First, it divides each road network into segments with different width, length, and directions. Second, the congested road segments are detected through analyzing the trajectories of moving objects on the road network. The saturation degree of each road segment and the average moving speed of vehicles in a road segment are computed to detect the congested road segments. Finally, we compute the final congested routes by using a clustering scheme. The experimental results showed that the proposed scheme can efficiently discover the congested routes in different directions of the roads.

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

There are various research challenges in vehicular ad hoc networks (VANETs) that need to be focused until an extensive deployment of it becomes conceivable. Design and development of a scalable routing algorithm for VANETs is one of the critical issue due to frequent path disruptions caused by the vehicle's mobility. This study aims to provide a novel road-aware routing protocol for vehicular networks named as Two-level hierarchical Hybrid Road-Aware (THERA) routing for vehicular ad hoc networks. The proposed protocol is designed explicitly for inter-vehicle communication. In THERA, roads are distributed into non-overlapping road segments to reduce the routing overhead. Unlike other protocols, discovery process does not flood the network with packet broadcasts. Instead, THERA uses the concept of Gateway Vehicles (GV) for the discovery process. In addition, a route between source and destination is flexible to changing topology, as THERA only requires road segment ID and destination ID for the communication. Furthermore, Road-Aware routing reduces the traffic congestion, bypasses the single point of failure, and facilitates the network management. Finally yet importantly, this paper also proposes a probabilistical model to estimate a path duration for each road segment using the highway mobility model. The flexibility of the proposed protocol is evaluated by performing extensive simulations in NS3. We have used SUMO simulator to generate real time vehicular traffic on the roads of Gangnam, South Korea. Comparative analysis of the results confirm that routing overhead for maintaining the network topology is smaller than few previously proposed routing algorithms.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2002.11a
• /
• pp.573-577
• /
• 2002

A new estimated neural networks are proposed in order to measure nonlinear road environments in realtime. This new neural networks is Error Estimated Neural Networks. The structure of it is similar to recurrent neural networks; a delayed output as the input and a delayed error between the output of plant and neural networks as a bias input. In addition, we compute the desired value of hidden layer by an optimal method instead of transfering desired values by backpropagation and each weights are updated by RLS(Recursive Least Square). Consequently, this neural networks are not sensitive to initial weights and a learning rate, and have a faster convergence rate than conventional neural networks. We can estimate nonlinear models in realtime by the proposed networks and control nonlinear models. To show the performance of this one, we control 7 degree simulation, this controller and driver were proved to be effective to drive a car in the environments of nonlinear road systems.

• Information and Communications Magazine
• /
• v.31 no.3
• /
• pp.103-116
• /
• 2014

This paper proposes the design of Vehicular Cyber-Physical Systems (called VCPS) based on vehicular cloud for smart road networks. Our VCPS realizes mobile cloud computing services where vehicles themselves or mobile devices (e.g., smartphones and tablets of drivers or passengers in vehicles) play a role of both cloud server and cloud client in the vehicular cloud. First, this paper describes the architecture of vehicular networks for VCPS and the delay modeling for the event prediction and data delivery, such as a mobile node's travel delay along its navigation path and the packet delivery delay in vehicular networks. Second, the paper explains two VCPS applications as smart road services for the driving efficiency and safety through the vehicular cloud, such as interactive navigation and pedestrian protection. Last, the paper discusses further research issues for VCPS for smart road networks.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.10
• /
• pp.33-43
• /
• 2011

Recently, advances in mobile communication and location identifying technology of the moving object is evolving. Therefore, the location-based services based on request for service have increased and a variety of the indexing for the position management of moving objects has been studied. Because the index based on Euclidean space are no restriction of movement, it is difficult to apply to the real world. Also, there is additional cost to find adjacent road segments in road networks-based indexing. Existing studies of fixed static objects such as buildings or hospitals are not considered. In this paper, we propose an efficient road networks-based indexing for management of current positions. The proposed indexing partitions road networks by grids and has integrated road connection informations and manage separated extra indexing for fixed static objects. Through the experiment, we show that the proposed indexing based on road networks improves the performance of operation for search or update than existing indexing.

• The KIPS Transactions:PartD
• /
• v.13D no.7 s.110
• /
• pp.879-888
• /
• 2006

Recently many researchers have focused on management of Historical trajectories of moving objects in Euclidean spaces due to numerous sizes of accumulated data over time. However, the movement of moving objects in real applications generally has some constraints, for example vehicles on roads can only travel along connected road networks. In this paper, we propose an indexing method for trajectories of moving objects on road networks in order to process the network-based spatiotemporal range query. Our method contains the connect information of road networks to use the network distance for query processing, deals with trajectories which are represented by road segments in road networks, and manages them using multiple R-trees assigned per each road segment. Furthermore, it has a structure to be able to share R-tree among several road segments in large road networks. Consequently, we show that our method takes about 30% less in node accesses for the network-based spatiotemporal range query processing than other methods based on the Euclidean distance by experiments.

• Journal of Korea Spatial Information System Society
• /
• v.9 no.3
• /
• pp.51-65
• /
• 2007

In order to analyze moving object trajectories on road networks, its representation needs to be defined correctly. The most previous methods representing moving object trajectories on road networks defined moving object trajectories as a set of passed location and its time. It is required much time in processing analysis such as retrieval for moving object trajectories. In this paper, we focus on POI(Points of Interest) on road networks and propose methods simplifying moving object trajectories based on it. Our method simplifies moving object trajectories by reducing the number of POIs that moving object trajectories passed and maintains its form after moving object trajectories were simplified.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.2949-2952
• /
• 2000

A new neural networks and learning algorithm are proposed in order to measure nonlinear heights of complexed road environments in realtime without pre-information. This new neural networks is Error Self Recurrent Neural Networks(ESRN), The structure of it is similar to recurrent neural networks: a delayed output as the input and a delayed error between the output of plant and neural networks as a bias input. In addition, we compute the desired value of hidden layer by an optimal method instead of transfering desired values by back-propagation and each weights are updated by RLS(Recursive Least Square). Consequently. this neural networks are not sensitive to initial weights and a learning rate, and have a faster convergence rate than conventional neural networks. We can estimate nonlinear models in realtime by ESRN and learning algorithm and control nonlinear models. To show the performance of this one. we control 7 degree of freedom full car model with several control method. From this simulation. this estimation and controller were proved to be effective to the measurements of nonlinear road environment systems.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2007.04a
• /
• pp.121-125
• /
• 2007

Recently, constructing and complementing the road network database are a main key in all social operation in our life. However it needs high expenses for constructing and complementing the data, and relies on many people for finishing the tasks. This study propose a novel method to extract urban road networks from 3-D LiDAR data automatically. This method integrates height, reflectance, and clustered road point information. Geometric information of general roads is also applied to cluster road points group correctly. The proposed method has been tested on various urban areas which contain complicated road networks. The results conclude that the integration of height, reflectance, and geometric information worked reliably to cluster road points.