• Journal of Korean Society of Forest Science
• /
• v.108 no.1
• /
• pp.59-66
• /
• 2019

This study was conducted to evaluate the effect of the synthetic forest road network by calculating the optimal road density and layout of the forest road network in order to construct the systematic road network in the forested area. For this, five comparative routes were additionally planed and compared through evaluation indicators. As a result, the optimum road density of the study site was estimated to be 18.4 m/ha, and the synthetic forest road network was the best in the four indicators such as average skidding distance, standard deviation of skidding distance, development index, and circuity factor. In addition, the synthetic forest road network was comparable to the main road network by about 4 %p in the timber volume available and potential area size for logging, but the construction cost of the road was about 20 %p lower. It showed a synthetic forest road network was better in terms of economy.

• Spatial Information Research
• /
• v.20 no.5
• /
• pp.57-66
• /
• 2012

Recent development in wireless communication technology like GPS as well as mobile equipments like PDA and cellular phone makes location-based services (LBSs) popular. However, because users request a query to LBS servers by using their exact locations while moving on the road network, users' privacy may not be protected in the LBSs. Therefore, a mechanism for users' privacy protection is required for the safe and comfortable use of LBSs by mobile users. For this, we, in this paper, propose a road network distance based cloaking scheme supporting user privacy protection in location-based services. The proposed scheme creates a cloaking area by considering road network distance, in order to support the efficient and safe LBSs on the road network. Finally, we show from our performance analysis that our cloaking scheme outperforms the existing cloaking scheme in terms of cloaking area and service time.

• New & Renewable Energy
• /
• v.9 no.4
• /
• pp.13-18
• /
• 2013

Wind turbines should generally be installed at a certain distance from a road to ensure passengers' safety. In Korea, there is no clear guidance as the Ministry of Environment first proposed a road setback distance of 400 m in the Onshore Wind Farm Siting Guidelines draft proposed in July 2012, and then modified it to 1.5 times the height of the wind turbine in October of the same year. This study analyzed the dynamic range of onshore wind resource potential according to how the road setback distance is set using the Korea Wind Atlas with 100m spatial resolution made by the Korea Institute of Energy Research, the transportation network of the Ministry of Construction and Transportation, and the forest road network of the Korea Forestry Service. Owing to the geographical characteristics of Korea, where mountainous terrain accounts for 70% of the total territory, the wind resource potential within 1 km from forest roads are estimated to be 14.3 GW, 14% of Korea's total wind resource potential. In addition, the construction distance of new road for transporting wind turbines from the existing road to a wind farm site is estimated as less than 2 km. Given the limited wind resource potential and geographical constraints, an assessment system that can maximize wind resource utilization and ensure road safety at the same time, and which takes into account the regional characteristics instead of applying the fixed road setback distance across-the-road, is required.

• Journal of Korea Spatial Information System Society
• /
• v.9 no.1
• /
• pp.59-77
• /
• 2007

Advances in mobile techknowledges and supporting techniques require an effective representation and analysis of moving objects. Similarity search of moving object trajectories is an active research area in data mining. In this paper, we propose a trajectory search algorithm for spatio-temporal similarity of moving objects on road network. For this, we define spatio-temporal distance between two trajectories of moving objects on road networks, and propose a new method to measure spatio-temporal similarity based on the real road network distance. In addition, we propose a similar trajectory search algorithm that retrieves spatio-temporal similar trajectories in the road network. The algorithm uses a signature file in order to retrieve candidate trajectories efficiently. Finally, we provide performance analysis to show the efficiency of the proposed algorithm.

• 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 the Korea Academia-Industrial cooperation Society
• /
• v.8 no.3
• /
• pp.593-600
• /
• 2007

In this paper, we composed several road network and evaluated the network for the performance of the network with protocols. The protocols we applied were the MANET routing protocols such as AODV(Ad-hoc On-Demand Distance Vector) and DSR(Dynamic Source Routing) protocols. Generally, the AODV performs better than the DSR. However, in my ad-hoc vehicular network, the performance of the DSR is the better than the AODV when there are more vehicles in the road environment than there are the less vehicles. For the simulation, we composed 4-lane road with vehicles and simulated in the OPNET.

• Current Research on Agriculture and Life Sciences
• /
• v.19
• /
• pp.45-54
• /
• 2001

This study was carried out to provide fundamental data for prospective forest-road project and forest-road network arrangement through appraising existing forest-road network with density, extension distance, maximum yarding distance and yarding area, position of forest-road line considered above foundation of two theories, one is "theory of optimal forest-road density" which has expense for yarding cost and constructing forest-road minimized, the other is "theory of optimal forest-road arrangement" which has investment effect maximized. The results are as follows. 1. In density and extension distance of the forest-road by site, it was showed up that density of existing forest-road is lower than that of calculated forest-road. So, it is thought that some additional forest-roads have to be constructed. 2. In the arrangement of the forest-road network by site, it was showed up that the arrangement of calculated forest-road is higher than that of existing forest-road arrangement for the forestry and yarding function. So, it is thought that the arrangement of forest-road network have to be considered to maximize the investment effect. 3. In "mean maximum distance for yarding" and "mean area which yarding can be done" by horizontal and inclined distance, the existing forest-road networks were different from those of calculated forest-road network. So, calculated forest-road network making investment effect maximize is more effective than existing forest-road network. Hence, in prospective forest-road project, it is needed that forest-road network having "area which yarding can be done" maximized through considering function for yarding have to be constructed.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.1
• /
• pp.29-40
• /
• 2008

With the spread of mobile devices and advances in communication techknowledges, the needs of application which uses the movement patterns of moving objects in history trajectory data of moving objects gets Increasing. Especially, to design public transportation route or road network of the new city, we can use the similar patterns in the trajectories of moving objects that move on the spatial network such as road and railway. In this paper, we propose a spatio-temporal similar trajectory search algorithm for moving objects on road network. For this, we define a spatio-temporal similarity measure based on the real road network distance and propose a grid-based index structure for similar trajectory search. Finally, we analyze the performance of the proposed similar trajectory search algorithm in order to show its efficiency.

• Journal of the Economic Geographical Society of Korea
• /
• v.9 no.2
• /
• pp.149-166
• /
• 2006

The purpose of this study is to produce time-distance cartograms based on the various Korean transportation networks, and to analyze the spatial structure of time-distance accessibilities. For the purpose this study attempts to develop continuous area cartogram by utilizing Wolf's algorithm for creating contiguous cartogram in ArcGIS 9. The absolute physical space was transformed to the functional space indexed by time-distances along various transportation networks in Korea. We examined the differences in the time-distance accessibilities among transportation networks. This study makes a comparison between the spatial structure of time-distance accessibility of KTX network with them of existing railroad network, as well as with them of road network. In order to clarify the spatial structures of time-distance accessibilities, we restructured them on the time-distance circular diagrams and performing Multi-Dimensional Scaling analysis. Overall structure of time-distance accessibilities shows similar patterns: The time distances are shrinked a lot along the Seoul-Busan axis, while coastal parts, in particular the eastern part of the county, are shrinked relatively little via all transportation networks. The Road network affects significantly on the accessibilities of cities in Gangwon-do and Gyeonggi-do, while railway network affects on the accessibilities of cities in Jeolla-do and Gyeongsang-do in general. When we compared the time-distance accessibilities based on the 5 largest cities, Seoul appears as the most accessible city from/to all other cities in Korea. We can also find significant changes in the time-distance accessibility between KTX network and existing railroad network. Cities along the KTX network, in particular cities which has KTX stops, improved significantly in time-distance accessibilities.

• Journal of KIISE:Databases
• /
• v.35 no.5
• /
• pp.447-458
• /
• 2008

In this paper, we address an efficient processing scheme for k-nearest neighbor queries to retrieve k static objects in road network databases. Existing methods cannot expect a query processing speed-up by index structures in road network databases, since it is impossible to build an index by the network distance, which cannot meet the triangular inequality requirement, essential for index creation, but only possible in a totally ordered set. Thus, these previous methods suffer from a serious performance degradation in query processing. Another method using pre-computed network distances also suffers from a serious storage overhead to maintain a huge amount of pre-computed network distances. To solve these performance and storage problems at the same time, this paper proposes a novel approach that creates an index for moving objects by approximating their network distances and efficiently processes k-nearest neighbor queries by means of the approximate index. For this approach, we proposed a systematic way of mapping each moving object on a road network into the corresponding absolute position in the m-dimensional space. To meet the triangular inequality this paper proposes a new notion of average network distance, and uses FastMap to map moving objects to their corresponding points in the m-dimensional space. After then, we present an approximate indexing algorithm to build an R*-tree, a multidimensional index, on the m-dimensional points of moving objects. The proposed scheme presents a query processing algorithm capable of efficiently evaluating k-nearest neighbor queries by finding k-nearest points (i.e., k-nearest moving objects) from the m-dimensional index. Finally, a variety of extensive experiments verifies the performance enhancement of the proposed approach by performing especially for the real-life road network databases.