• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.5
• /
• pp.25-36
• /
• 2016

The goal of the SmartGrid is to maximize energy efficiency by exchanging bi-directional real-time power information with the help of ICT(Information and Communication Technology). In this paper, we propose a "JRS-MS" (Joint Routing and Scheduling for Multi-channel SmartGrid) algorithm that uses numerical modeling methods in IEEE 802.11s based STDMA multi-channel SmartGrid NAN networks. The proposed algorithm controls the amount of data transmission adaptively at the link layer and finds a high data-rate path which has the least interference between traffic flows in multi-channel SmartGrid NAN networks. The proposed algorithm improve transmission performance by enhancing network utilization. By comparing the results of performance analysis between the proposed algorithm and the JRS-SG algorithm in the previous paper, we showed that the JRS-MS algorithm can improve transmission performance by maximally utilizing given network resources when the number of flows are increasing in the multi-hop NAN wireless mesh networks.

• Journal of Korean Society of Transportation
• /
• v.21 no.2
• /
• pp.71-82
• /
• 2003

The shortest path problems(SPP) are critical issues in the military logistics such as the simulation of the War-Game. However, the existing SPP has two major drawbacks, one is its accuracy of solution and the other is for only one solution with focused on just link cost in the military transportation planning models. In addition, very few previous studies have been examined for the multi-shortest path problems without considering link capacity reflecting the military characteristics. In order to overcome these drawbacks, it is necessary to apply the multi-shortest paths algorithm reflecting un-expected military incidents. This study examines the multi-shortest paths in the real networks using Shier algorithm. The network contains both military link capacity and time-based cost. Also, the modes are defined as a platoon(group) rather than unit which is used in most of previous studies in the military logistics. To verify the algorithm applied in this study. the comparative analysis was performed with various sizes and routes of network which compares with Dijkstra algorithm. The major findings of this study are as follows ; 1) Regarding the unique characteristics of the military transportation plan, Shier algorithm, which is applied to this study, is more realistic than Dijkstra algorithm. Also, the time based concept is more applicable than the distance based model in the military logistics. 2) Based on the results from the various simulations of this study the capacity-constraint sections appeared in each scenarios. As a consequence, the alternatives are necessary such as measures for vulnerable area, improvement of vehicle(mode), and reflection of separated-marching column in the military manuals. Finally. the limits and future research directions are discussed : 1) It is very hard to compare the results found in this study. which is used in the real network and the previous studies which is used in arbitrary network. 2) In order to reflect the real military situations such as heavy tanks and heavy equipment vehicles. the other constraints such as the safety load of bridges and/or the height of tunnels should be considered for the future studies.

• Journal of Korean Society for Geospatial Information Science
• /
• v.1 no.1 s.1
• /
• pp.127-140
• /
• 1993

The purpose of this paper is to examine the possible benefits of combining transportation planning models with geographic information systems (GIS) in the hope that intergrating these systems can alleviate the inherent problems of transportation planning models such as user unfriendliness, labor intensiveness, and theoretical limitations. Specially, this paper focuses on the issue of incompatiblity between GIS and the conventional transportation planning models in dealing with network topologies. Resolving this conflict in topologies is a conerstone for eliminating the user-unfriendliness and labor-intensiveness issues. This paper presents the development of an algorithm that converts GIS topology into transportation network topology. The FORTRAN-based topology conversion algorithm generates transportation networks from the GIS cartographic file and establishes a communication charmel between the two systems.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.10
• /
• pp.30-39
• /
• 1999

In this paper, the size of IWU frame cell buffer is analyzed that receives FR frame cells from other FR networks through ATM backbone network. The frame cell buffer receives multiplexed ATM cells from other IWUs that provide interworking with ATM network for other FR networks A receiving IWU reassembles frames from multiplexed ATM cells by identifying the VPI/VCIs. The reassembled frames are transmitted on FR network links according to their destination. Therefore, IWU needs sufficient amount of buffers for the assembly of the frames and for providing the assembled frames with the queue to wait until the frame is transmitted by FR network link. In this paper, the probability of frame loss at the frame cell buffer is derived in terms of traffic parameters, the number of multiplexed FR connections, the number of FR links and the transmission capacity. By applying the derived results, we analyzed the required buffer size for a given probability of frame loss. Also, it is presented that how the probability and the required size are effected by the number of multiplexed FR connections and FR transmission links.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8B
• /
• pp.1105-1114
• /
• 2010

The Proxy Mobile IPv6 (PMIPv6) has been standardized by the IETF NETLMM WG for network-based mobility management. The PMIPv6 can provide IP mobility for Mobile Nodes (MNs) with low handover latency and less wireless resource usage. But, since the PMIPv6 is basically designed for local mobility management, it cannot support directly global mobility management between different PMIPv6 domains. In the PMIPv6, since all traffic is routed through a Local Mobility Anchor (LMA), it causes a long end-to-end delay and triangular routing problem. Therefore, in this paper, we propose a fast network-based global mobility management scheme and route optimization scheme with a new network entity, called Global Mobility Agent (GMA). Numerical analysis and simulation results show that the proposed scheme is able to support global mobility between different public domains with low handover latency and low end-to-end delay, compared with the PMIPv6.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2013.06a
• /
• pp.214-215
• /
• 2013

Current competition among companies than regional, the time constraints, it is globalization, Tilt the efforts of many to be operated by building the efficient distribution system to reduce logistics costs and improve customer service it is reality's there. Therefore, the need for industrial complexes environmentally friendly can be cost competitive companies perform cavitation region's increased. To build the distribution center these logistics system through a joint of freight and appropriate policy is required. In particular, efficient operation through the system construction of industrial complexes in the logistics system is very important in terms of friendly low-cost urban logistics, the environment. Since the traffic volume which is Jipufa and utilization of network is transported by a more appropriate technicians and means suitable operating model can efficiency is improved. However, despite these advantages, research network design has not been actively conducted due to the complexity of the problem. Therefore, in this study, by analyzing the logistics system, and presents the operating model through a simulation and basic settings for the model of the logistics complex based on the analysis result, the construction of infrastructure of logistics industry complex it is intended to present the article.

• The Journal of Bigdata
• /
• v.6 no.2
• /
• pp.139-149
• /
• 2021

Ddareungi, a public bicycle service in Seoul, establishes itself as a means of daily transportation for citizens in Seoul. We speculated that the pattern of using Ddareungi may have changed since COVID-19. This study explores changes in using Ddareungi after COVID-19 with descriptive statistical analysis and network analysis. The analysis results are summarized as follows. The average traveling distance and average traveling speed have decreased over the entire time in a day since COVID-19. The round trip rate has increased at dawn and morning and has decreased in the evening and night. The average weighted degree and average clustering coefficient have decreased, and the modularity has increased. The clusters, located north of the Han River in Seoul, had a similar geographic distribution before and after COVID-19. However, the clusters, located south of the Han River, had different geographic distributions after COVID-19. Traveling routes added to the top 5 traffic rankings after COVID-19 had an average traveling distance of fewer than 1,000 meters. We expect that the results of this study will help improve the public bicycle service in Seoul.

• 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.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.18 no.2
• /
• pp.29-43
• /
• 2019

The calibration of microscopic traffic simulation models has received much attention in the simulation field. Although no standard has been established for it, a genetic algorithm (GA) has been widely employed in recent literature because of its high efficiency to find solutions in such optimization problems. However, the performance still falls short in simulation analyses to support fast decision making. This paper proposes a new calibration procedure using a dual GA and central composite design (CCD) in order to improve the efficiency. The calibration exercise goes through three major sequential steps: (1) experimental design using CCD for a quadratic response surface model (RSM) estimation, (2) 1st GA procedure using the RSM with CCD to find a near-optimal initial population for a next step, and (3) 2nd GA procedure to find a final solution. The proposed method was applied in calibrating the Gipps car-following model with respect to maximizing the likelihood of a spacing distribution between a lead and following vehicle. In order to evaluate the performance of the proposed method, a conventional calibration approach using a single GA was compared under both simulated and real vehicle trajectory data. It was found that the proposed approach enhances the optimization speed by starting to search from an initial population that is closer to the optimum than that of the other approach. This result implies the proposed approach has benefits for a large-scale traffic network simulation analysis. This method can be extended to other optimization tasks using GA in transportation studies.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.1
• /
• pp.25-39
• /
• 1986

In this paper, we analyze the performance, particularly the flow control mechanism, of the CCITT X.25 protocol in a packet-switched network. In this analysis, we consider the link and packet layers separately, and investigate the performance in three measures; normalized channel throughput, mean transmission time, and transmission efficiency. Each of these measures is formulated in terms of given protocol parameters such as windos size, $T_1$ and $T_2$ values, message length, and so forth. We model the service procedure of the inpur traffic based on the flow control mechanism of the X.25 protocol, and investigate the mechanism of the sliding window flow control with the piggybacked acknowlodgment scheme using a discrete-time Markov chain model. With this model, we study the effect of variation of the protoccol parameters on the performance of the X.25 protocol. From the numerical results of this analysis one can select the optimal valuse of the protocol parameters for different channel environments. it has been found that to maintain the trasnmission capacity satisfactorily, the window size must be greater than or equal to 7 in a high-speed channel. The time-out value, $T_1$, must carefully be selected in a noisy channel. In a normal condition, it should be in the order of ls. The value of $T_2$ has some effect on the transmission efficiency, but is not critical.