• Title/Summary/Keyword: road network

Search Result 962, Processing Time 0.034 seconds

Traffic Congestion Management on Urban Roads using Vehicular Ad-hoc Network-based V2V and V2I Communications (차량 애드혹 네트워크 기반 V2V와 V2I 통신을 사용한 시내 도로에서의 교통 체증 관리)

  • Ryu, Minwoo;Cha, Si-Ho
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.18 no.2
    • /
    • pp.9-16
    • /
    • 2022
  • The nodes constituting the vehicle ad hoc network (VANET) are vehicles moving along the road and road side units (RSUs) installed around the road. The vehicle ad hoc network is used to collect the status, speed, and location information of vehicles driving on the road, and to communicate with vehicles, vehicles, and RSUs. Today, as the number of vehicles continues to increase, urban roads are suffering from traffic jams, which cause various problems such as time, fuel, and the environment. In this paper, we propose a method to solve traffic congestion problems on urban roads and demonstrate that the method can be applied to solve traffic congestion problems through performance evaluation using two typical protocols of vehicle ad hoc networks, AODV and GPSR. The performance evaluation used ns-2 simulator, and the average number of traffic jams and the waiting time due to the average traffic congestion were measured. Through this, we demonstrate that the vehicle ad hoc-based traffic congestion management technique proposed in this paper can be applied to urban roads in smart cities.

Analysis of the right to sunshine for elevated structure construction (고가 구조물 건설에 따른 일조권 분석)

  • 강기수;김상석;양승태;강인준
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2004.04a
    • /
    • pp.485-490
    • /
    • 2004
  • Recently, distribution transfer velocity was extremely lowered by high supply rate of vehicle and low road rate. Therefore expansions of transfer network these were subway, road and railway to recover competitive power as a reform measure of physical distribution traffic were become preference previous subject. For reason of that, an expansion of transfer network is meeting competitive power as selected an elevated road in the ground road network that condition of location calm and get out of the existing urban than the underground road to connect oversensitive a large city and expanded small and medium satellite town. In the meantime, while elevated structures construct, they go through the civilian residential section, agriculture land, etc. The consequence is that it raises a vibration, noise, dust, an infringement of the right to a view and an infringement of the right to a sunshine. In this study, we analyzed Quantitatively sunshine quantity with building 3D simulation model of civil structure. Therefore, we present as planning data to reduce a civilian appeal for dispute of the right to sunshine and an economic and time loss between the government and construction company In addition to that, for the standard of the standard plan of usable sunshine quantity program in the practical business, the building of convenient user interface will be the project to be done.

  • PDF

DESIGN OF OPERATOR FOR SEARCHING TRAFFIC DEPENDENT SHORTEST PATH IN A ROAD NETWORK

  • Lee Dong Gyu;Lee Yang Koo;Jung Young Jin;Ryu Keun Ho
    • Proceedings of the KSRS Conference
    • /
    • 2005.10a
    • /
    • pp.759-762
    • /
    • 2005
  • Recently, Intelligent Transportation System(ITS) has been applied to satisfy increasing traffic demand every year and to solve many traffic problems. Especially, Advanced Traveller Information System(ATIS) is a transportation system to optimize the trip of each other vehicle. It is important to provide the driver with quick and comfortable path from source to destination. However, it is difficult to provide a shortest path in a road network with dynamic cost. Because the existing research has a static cost. Therefore, in this paper we propose an operator for searching traffic dependent shortest path. The proposed operator finds the shortest path from source to destination using a current time cost and a difference cost of past time cost. Such a method can be applied to the road status with time. Also, we can expect a predicted arrival time as well as the shortest path from source to destination. It can be applied to efficiently application service as ITS and have the advantages of using the road efficiently, reducing the distribution cost, preparing an emergency quickly, reducing the trip time, and reducing an environmental pollution owing to the saving the fuel.

  • PDF

Planning of Alternative Forest Road Network Using GIS (GIS를 이용한 대안별 임도노망의 계획에 관한 연구)

  • Jeon, Kwon-Seok
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.11 no.1 s.24
    • /
    • pp.21-28
    • /
    • 2003
  • This study was aimed at suggest a proper planning method to select a optimal forest road network in mountains forest using GIS(Geographic Information System). To examine the field applicability, the method was applied to the National Forest at Mt. Kumsan in Namhae-gun, Gyungsangnam-do. The main results from altogether six alternative road route plans were derived from these criteria obtained the alternative route plan No.2 has two layout criteria, longitudinal gradient and earth work volume, and it showed similar pattern of existing forest road network which was designed mainly ground slope and longitudinal gradient. The alternative route plan No.6 has four criteria, longitudinal gradient, earth work volume, investment effect and landscape impact. It was different for the lowest forest road density among the alternatives and the pattern of the forest road layout was radial form, which was also quite different to other alternatives. For optimal forest road network planning, GIS provide the efficient and resonable solutions for decision making to provide the support for evaluation about various alternative road networks. If detailed inventory and relevant data are provided and also clear and objective indicators for evaluations are set up, it could be applied to preliminary analysis and detail planning stage to prevent undesirable effect such the land slide and soil erosion due to inadequate planning for forest road network.

  • PDF

Adaptation Types of Urban Tissue in Ipjeong-dong Area, Seoul (서울 입정동 일대 도시조직의 적응 유형)

  • Woo, Don-Son;Cho, Yun-O
    • Journal of the Architectural Institute of Korea Planning & Design
    • /
    • v.34 no.7
    • /
    • pp.99-106
    • /
    • 2018
  • The purpose of this study is to examine adaptation types of urban tissue in Ipjeong-dong area, Seoul. Ipjeong-dong area has urban tissue those were made during Joseon dynasty and this is remaining even in the present time. This area was originally urban hanok residential districts till late 1950s. However, it has changed into machinery manufacture business area after demolition of Cheonggyechon shantytown. After several workshops and stores moved in this area, manufacturer and merchants required for more spaces due to lack of room for machinery. To place more workshops in the block, lot alteration were happened and accessibility to workshops inside the block were required. Adaptive road network which is main form of adaptative urban tissue were made to adapt in this kind of poor urban condition. To research about adaptive urban tissue making, distribution were explored and comparison tasks between various cadastral map of 1940, 1964, 1970s and 2017 were conducted. From these tasks, certain types of adaptive urban tissues and characteristics of these elements were found. First of all, forms of adaptive road depend on the surrounded environment. Connecting internal building corridor with original road system is categorized as Type A. Altering a portion of the buildings to make adaptive roads is categorized as Type B. Second, there were two types of formation of adaptive road. Type 1 is for adaptive road which is independent gesture from original road network. Type 2 is for adaptive road which is altering the form of original road network by lengthening or connecting two different dead-end roads.

Development of a Surface Temperature Prediction Model Using Neural Network Theory (신경망 이론을 이용한 노면온도예측모형 개발)

  • Kim, In Su;Yang, Choong Heon;Choi, Keechoo
    • Journal of Korean Society of Transportation
    • /
    • v.32 no.6
    • /
    • pp.686-693
    • /
    • 2014
  • This study presents a model that enables to predict road surface temperature using neural network theory. Historical road surface temperature data were collected from Road Weather Information System. They used for the calibration of the model. The neural network was designed to predict surface temperature after 1-hour, 2-hour, and 3-hour from now. The developed model was performed on Cheongwon-Sangju highway to test. As a result, the standard deviation of the difference of the predicted and observed was $1.27^{\circ}C$, $0.55^{\circ}C$ and $1.43^{\circ}C$, respectively. Also, comparing the predicted surface temperature and the actual data, R2 was found to be 0.985, 0.923, and 0.903, respectively. It can be concluded that the explanatory power of the model seems to be high.

Line Matching Method for Linking Wayfinding Process with the Road Name Address System (길찾기 과정의 도로명주소 체계 연계를 위한 선형 객체 매칭 방법)

  • Bang, Yoon Sik;Yu, Ki Yun
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.24 no.4
    • /
    • pp.115-123
    • /
    • 2016
  • The road name address system has been in effect in Korea since 2012. However, the existing address system is still being used in many fields because of the difference between the spatial awareness of people and the road name address system. For the spatial awareness based on the road name address system, various spatial datasets in daily life should be referenced by the road names. The goal of this paper is to link the road name address system with the wayfinding process, which is closely related to the spatial awareness. To achieve our goal, we designed and implemented a geometric matching method for spatial data sets. This method generates network neighborhoods from road objects in the 'road name address map' and the 'pedestrian network data'. Then it computes the geometric similarities between the neighborhoods to identify corresponding road name for each object in the network data. The performance by F0.5 was assessed at 0.936 and it was improved to 0.978 by the manual check for 10% of the test data selected by the similarity. By help of our method, the road name address system can be utilized in the wayfinding services, and further in the spatial awareness of people.

Indices Characterizing Road Network on Geo-Spatial Imagery as Transportation Network Analysis

  • Lee, Ki-Won
    • Korean Journal of Remote Sensing
    • /
    • v.20 no.1
    • /
    • pp.57-64
    • /
    • 2004
  • In GIS-based network analysis, topological measure of network structure can be considered as one of important factors in the urban transportation analysis. Related to this measure, it is known that the connectivity indices such as alpha index and gamma index, which mean degree of network connectivity and complexity on a graph or a circuit, provide fundamental information. On the other hand, shimbel index is one of GIS-based spatial metrics to characterize degree of network concentration. However, the approach using these quantitative indices has not been widely used in practical level yet. In this study, an application program, in complied as extension, running on ArcView- GIS is implemented and demonstrated case examples using basic layers such as road centerline and administrative boundary. In this approach, geo-spatial imagery can be effectively used to actual applications to determine the analysis zone, which is composed of networks to extract these indices. As the results of the implementation and the case examples, it is notified that alpha and gamma indices as well as shimbel index can be used as referential data or auxiliary information for urban planning and transportation planning.

A Study on Road Detection Based on MRF in SAR Image (SAR 영상에서 MRF 기반 도로 검출에 관한 연구)

  • 김순백;김두영
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.2 no.2
    • /
    • pp.7-12
    • /
    • 2001
  • In this paper, an estimation method of hybrid feature was proposed to detect linear feature such as the road network from SAR(synthetics aperture radar) images that include speckle noise. First we considered the mean intensity ratio or the statistical properties of locality neighboring regions to detect linear feature of road. The responses of both methods are combined to detect the entire road network. The purpose of this paper is to extract the segments of road and to mutually connect them according to the identical intensity road from the locally detected fusing images. The algorithm proposed in this paper is to define MRF(markov random field) model of the priori knowledge on the roads and applied it to energy function of interacting density points, and to detect the road networks by optimizing the energy function.

  • PDF

Road Aware Information Sharing in VANETs

  • Song, Wang-Cheol;Rehman, Shafqat Ur;Awan, Muhammad Bilal
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.9
    • /
    • pp.3377-3395
    • /
    • 2015
  • Recently, several approaches to share road conditions and/or digital contents through VANETs have been proposed, and such approaches have generally considered the radial distance from the information source as well as the TTL to provision an ephemeral, geographically-limited information sharing service. However, they implement general MANETs and have not been tailored to the constrained movement of vehicles on roads that are mostly linear. In this paper, we propose a novel application-level mechanism that can be used to share road conditions, including accidents, detours and congestion, through a VANET. We assign probabilities to roads around each of the intersections in the neighborhood road network. We then use the graph representation of the road network to build a spanning tree of roads with the information source as the root node. Nodes below the root represent junctions, and the edges represent inter-connecting road segments. Messages propagate along the branches of the tree, and as the information propagates down the branches, the probability of replication decreases. The information is replicated until a threshold probability has been reached, and our method also ensures that messages are not delivered to irrelevant vehicles, independently of their proximity to the source. We evaluated the success rate and performance of this approach using NS-3 simulations, and we used IDM car following and MOBIL lane change models to provide realistic modeling of the vehicle mobility.