• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1133-1141
• /
• 2009

In this paper, we present a distributed fault-tolerant topology control protocol that configure a wireless sensor network to achieve k-connectivity and (k+1)-coverage. One fundamental issue in sensor networks is to maintain both sensing coverage and network connectivity in order to support different applications and environments, while some least active nodes are on duty. Topology control algorithms have been proposed to maintain network connectivity while improving energy efficiency and increasing network capacity. However, by reducing the number of links in the network, topology control algorithms actually decrease the degree of routing redundancy. Although the protocols for resolving such a problem while maintaining sensing coverage were proposed, they requires accurate location information to check the coverage, and most of active sensors in the constructed topology maintain 2k-connectivity when they keep k-coverage. We propose the fault-tolerant topology control protocol that is based on the theorem that k-connectivity implies (k+1)-coverage when the sensing range is at two times the transmission range. The proposed distributed algorithm does not need accurate location information, the complexity is O(1). We demonstrate the capability of the proposed protocol to provide guaranteed connectivity and coverage, through both geometric analysis and extensive simulation.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.22 no.2
• /
• pp.50-64
• /
• 2019

According to the Maritime Safety Act, there are all 34 routes including 5 traffic safety zones, 3 traffic separation schemes, 26 routes designated by regional maritime affairs departments in the Republic of Korea. In the SOLAS convention, the route information should be is effectively used for the safe navigation. However, the route information is complicatedly composed of the location of the route, the navigation rule by each route, the restriction of the navigation, and the anchorages. Moreover, the present method of providing information using the navigational chart and other publications is not effective for users to grasp the navigational information. Therefore, it was conducted to study the design of the S-100 based routing information data model developed by the International Hydrographic Organization to find ways to more effectively provide route information. To do this, the analysis of route requirement, selection of items, encoding test and users' review were carried out. Through expert user review, it was evaluated that the study on the design of the route information data model can be utilized as a good basic data for the route information integration service. Future research on the development of route information data models is expected to provide integrated route information services.

• Journal of Korean Society of Transportation
• /
• v.29 no.5
• /
• pp.121-138
• /
• 2011

More affordable and available cutting-edge technologies (e.g., wireless vehicle communication) are regarded as a possible alternative to the fixed infrastructure-based traffic information system requiring the expensive infrastructure investments and mostly implemented in the uninterrupted freeway network with limited spatial system expansion. This paper develops an advanced decentralized traveler information System (ATIS) using vehicle-to-vehicle (V2V) communication system whose performance (drivers' travel time savings) are enhanced by three complementary functions (autonomous automatic incident detection algorithm, reliable sample size function, and driver behavior model) and evaluates it in the typical $6{\times}6$ urban grid network with non-recurrent traffic state (traffic incident) with the varying key parameters (traffic flow, communication radio range, and penetration ratio), employing the off-the-shelf microscopic simulation model (VISSIM) under the ideal vehicle communication environment. Simulation outputs indicate that as the three key parameters are increased more participating vehicles are involved for traffic data propagation in the less communication groups at the faster data dissemination speed. Also, participating vehicles saved their travel time by dynamically updating the up-to-date traffic states and searching for the new route. Focusing on the travel time difference of (instant) re-routing vehicles, lower traffic flow cases saved more time than higher traffic flow ones. This is because a relatively small number of vehicles in 300vph case re-route during the most system-efficient time period (the early time of the traffic incident) but more vehicles in 514vph case re-route during less system-efficient time period, even after the incident is resolved. Also, normally re-routings on the network-entering links saved more travel time than any other places inside the network except the case where the direct effect of traffic incident triggers vehicle re-routings during the effective incident time period and the location and direction of the incident link determines the spatial distribution of re-routing vehicles.

• Journal of the Korean Geographical Society
• /
• v.47 no.4
• /
• pp.606-624
• /
• 2012

The main objective of this paper is to provide an adequate and comprehensive review of what has been done in South Korea in the field of geospatial analysis and modeling. This review focuses on spatial data analysis and spatial statistics, spatial optimization, and geosimulation among various aspects of the field. It is recognized that geospatial analysis and modeling in South Korea got through the initial stage during the 1990s when computer and analytical cartography and GIS were introduced, moved to the growth stage during the first decade of the $21^{st}$ century when there was a surge of relevant researches, and now is heading for its maturity stage. In spatial data analysis and spatial statistics, various topics have been addressed for spatial point pattern data, areal data, geostatistical data, and spatial interaction data. In spatial optimization, modeling and applications related to facility location problems, districting problems, and routing problems have been mostly researched. Finally, in geosimulation, while most of research has focused on cellular automata, studies on agent-based model and simulation are in beginning stage. Among all these works, some have fostered methodological advances beyond simple applications of the standard techniques.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.2
• /
• pp.73-86
• /
• 2018

The increase in the number of private automobiles has incurred various traffic problems. Globally, studies on MaaS(Mobility as a Service) has already been initiated to mobilize the use of public transportation in reducing private passenger cars in roads. This study aims to analyze the passenger's optimal route considering the transfer between different transportation modes through simulation, and analyze the effect of available route through the connected transportation modes. Sejong Special Self-Governing City was chosen as the study area due to its extensive transportation network. As a result of the analysis, the predominant obtainable route is derived either from using public transportation (i.e. bus and subway) only or by bicycle. However, it is also possible to use the car sharing and public bicycle to reach their final destination efficiently when paths that can be traversed were more scrutinized. When various transportation information and location-based services are introduced in smart phone applications, they can provide very useful information to passengers, and also promote social problems such as traffic congestion and environmental issues in the future.

• Journal of IKEEE
• /
• v.11 no.4
• /
• pp.348-357
• /
• 2007

Due to the improved performance and cost of personal mobile devices and rapid progress of wireless communication technology, the number of users who utilize these devices is increasing. This trend requires various types of services be available to users. So far, there have been many solutions provided for the shortest path problem. But, technologies which can offer various recommendation services to user depending on user’s current location are focused on Euclidean spaces rather than road network. Thus, in this paper, we extend the previous work to satisfy this requirement on road network database. Our proposed scheme requires pre-computation for the efficient query processing. In the preprocessing step, we first partition the input road network into a fixed number of Voronoi polygons and then pre-compute routing information for each polygon. In the meantime, we select the number of Voronoi polygons in proposition to the scale of road network. Through this selection, the required size of pre-computation is linearly increasing to the size of road network. Using this pre-computated information, we can process queries more quickly. Through experiments, we have shown that our proposed scheme can achieve excellent performance in terms of scheduling time and the number of visited nodes.