• Journal of Electrical Engineering and information Science
• /
• v.3 no.1
• /
• pp.21-27
• /
• 1998

In this paper we apply routing algorithms in circuit switched networks to B-ISDN networks and investigate the performance. B-ISDN supports a wide range of services with hetrogeneous bandwidth requirements. We assume that the network supports D classes of traffic. It is modeled as a finite D dimensional Markov chain. A call is blocked on arrival if the required bandwidth is not available on the route. The shortest path routing, alternate routing and trunk reservation are considered for performance comparison. We also consider trunk reservation with restricted access control where the network reserves certain amount of bandwidths for one class of traffic that assumes a higher transmission priority. Through the method of successive iterations, we obtain the steady state equilibrium probabilities and call blocking probabilities for dynamic routing. The results can be used to design a B-ISDN network that improves network connection availability and efficiency while simultaneously reducing the network costs.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.3
• /
• pp.263-267
• /
• 2007

This study proposes a new methodology to estimate the traffic capacity of a personal rapid transit(PRT) system. The proposed method comprises three steps. The first step models the guideway network(GN) of PRT as a digraph, where its node and link represent a station and a one-way guideway link between two stations, respectively. Given local vehicle control strategies, the second step formulates the local traffic capacities through the nodes and links of the GN model. The third step estimates the worst-case local traffic demands based on a shortest-path routing algorithm and an empty vehicle allocation algorithm. By comparing the traffic estimates to the local traffic capacities, we can determine the feasibility of the given GN in traffic capacity.

• Journal of the Korea Society for Simulation
• /
• v.14 no.2
• /
• pp.25-34
• /
• 2005

Determination of component mounting sequence on printed circuit board assembly process is a typical NP-hard problem. It is a kind of traveling salesman problems, but it has one more hard to meet constraint of matching component type per mounting position as well as searching the shortest path. An efficient method is developed by separation of crowed area and allowing up to two slots per component type. A simulation model is constructed using Visual C++ for evaluation of the suggested heuristic.

• Journal of Korean Society of Transportation
• /
• v.22 no.5
• /
• pp.123-137
• /
• 2004

The study on traffic assignment is actively being performed which reflect networks status using time. Its background is increasing social needs to use traffic assignment models in not only hardware area of road network plan but also software area of traffic management or control. In addition, multi-class traffic assignment model is receiving study in order to fill a gap between theory and practice of traffic assignment model. This model is made up of two, one of which is multi-driver class and the other multi-vehicle class. The latter is the more realistic because it can be combined with dynamic model. On this background, this study is to build multidynamic model combining the above-mentioned two areas. This has been a theoretic pillar of ITS in which dynamic user equilibrium assignment model is now made an issue, therefore more realistic dynamic model is expected to be built by combining it with multi-class model. In case of multi-vehicle, FIFO would be violated which is necessary to build the dynamic assignment model. This means that it is impossible to build multi-vehicle dynamic model with the existing dynamic assignment modelling method built under the conditions of FIFO. This study builds dynamic network model which could relieve the FIFO conditions. At the same time, simulation method, one of the existing network loading method, is modified to be applied to this study. Also, as a solution(algorithm) area, time dependent shortest path algorithm which has been modified from existing shortest path algorithm and the existing MSA modified algorithm are built. The convergence of the algorithm is examined which is built by calculating dynamic user equilibrium solution adopting the model and algorithm and grid network.

• Journal of the Korean Geographical Society
• /
• v.45 no.1
• /
• pp.144-164
• /
• 2010

This study aims to reveal path selection strategies and individual differences in a navigation task. Two experiments were presented that studied human route planning performance as well as the cognitive strategies and processes involved. For the outdoor task, university students were asked to select a route based on the instruction, i.e. to find the best route from the campus main gate to the Education Building for conference visitors by locating eight signposts. Results indicate (1) that locations of signposts were selected preferably at decision points where the traveler needs to make a choice and starting/ending points of the navigation task and (2) a variety of route planning strategies considering efficiency goal (e.g., the shortest path), environmental characteristics (e.g., fewest turns), and aesthetic purpose (e.g., most scenic) were used. It is notable that some participants took into account more than one path by locating one or two signposts on an alternative route while others preferred a linear route connecting signposts between the start point and the destination. Prior to the main experiment, the same participants were asked to complete the same task inside the classroom to investigate changes in strategies between two tasks. Participants often tend to place signposts at more regular intervals for the indoor navigation task than the same task conducted outside.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.7
• /
• pp.754-764
• /
• 2016

To understand and analyze SNS(Social Network Service) two important classes of networks, small-world and scale-free networks have gained a lot of research interests. In this study, a generalized network generation method is developed, which can produce small-world network, scale-free network, or network with the properties of both small-world and scale-free by controlling two input parameters. By tuning one parameter we can represent the small-world property and by tuning the other one we can represent both scale-free and small-world properties. For the network measures to represent small-world and scale-free properties clustering coefficient, average shortest path distance and power-law property are used. Using the model proposed in this study we can have more clear understanding about relationships between small-world network and scale-free network. Using numerical examples we have verified the effects of two parameters on clustering coefficient, average shortest path distance and power-law property. Through this investigation it can be shown that small-world network, scale-free network or both can be generated by tuning two input parameters properly.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.31 no.3
• /
• pp.1-16
• /
• 2003

The ultimate goal of this research is to establish the movement rights of people with physical disabilities. To achieve this goal, the authors have investigated the regulation and restrictions of physical facilities to guarantee the movement rights and investigated how well these facilities were constructed. The authors then have analyzed and compared the results. The purposes of this research are as follows. First, the authors investigated and analyzed the present conditions of selected public facilities to propose improvement measures for the disabled, pregnant and seniors so that they could actively participate in cultural activities as normal people do. Second, the designs resulting from this research are provided so as to be helpful to disabled people in everyday life, which is different from previously conducted research. Third, the authors have selected facilities with outdoor areas to differentiate the results from those reported recently through research conducted on indoor buildings. The final step of this research is to provide basic design data on outdoor areas to establish true movement rights for the disabled. According to these research findings, the shortest moving distance cannot be guaranteed only by establishing facilities that follow the Article 3 law about guarantee of convenience improvement for the disabled. If the movement path is not regulated, the facility standards may not exist in one part and the part itself may become obscured and the distance could become longer than necessary. Accordingly, for real movement rights the movement path should be guaranteed not to be violated by other obstacles. The results of this study offer convenience when moving within the outdoor space of cultural facilities by providing direct information for the disabled. The value of this study is that it is the first study on movement rights and movement paths for people with physical disabilities.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.219-228
• /
• 2007

End-to-end path setup and maintenance are very important for mobile ad-hoc wireless communications, because of the mobility and the limited battery capacity of the nodes in the networks. the AODV routing protocol is the one of mary proposed protocols. However, there are route failure problem with the Proposed protocols between intermediate nodes due to such mobility and exhausted battery characteristics, and this is because only the shortest hop count is considered for the route setup. If route failure happens. Problem such as the waste of bandwidth and the increment of the energy consumption occur because of the discarding data packets in the intermediate nodes and the path re-setup process required by the source node. In addition, it obviously causes the network lifetime to be shortened. This paper proposes a routing protocol based on the AODV routing protocol that it makes use of the remaining energy, signal strength and SNR of the MAC layer resources to setup a path.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.9
• /
• pp.829-840
• /
• 2012

Recently, in network communication environments, it is changing very fast from wired to wireless. The open shortest path firtst (OSPF), one of link state routing protocols, mainly used in wired networks, is the routing method to select optimal traffic path as identifying the link state of neighbor routers. The traditional OSPF cost functions performs with first fixed cost permanently, unless the router link is changed. However, in wireless networks, the performance of links show big difference by other environment factors. The bit error rate (BER), a parameter which can quite affect link state in wireless networks, is not considered in the traditional OSPF cost functions. Only a link bandwidth is considered in the traditional OSPF cost functions. In this paper, we verify the various parameters which can affect link performance, whether it is permissible to use as the parameter of proposed cost functions. To propose new cost functions, we use the effective bandwidth. This bandwidth is calculated by proposed formula using the BER of the network link and link bandwidth. As applied by the proposed triggering condition, the calculated effective bandwidth decrease the unstable of network by generating less link state update messages in wireless networks that frequently changes the link state. Simulation results show that the proposed cost functions significantly outperforms the traditional cost functions in wireless networks in terms of the services of VoIP and data transmission.

• Proceedings of the International Union of Geodesy And Geophysics Korea Journal of Geophysical Research Conference
• /
• 2003.05a
• /
• pp.14-14
• /
• 2003

SAR (Synthetic Aperture Radar) is an imaging radar which can scan and image Earth System targets without solar illumination. Most Earth observation Shh systems operate in X-, C-, S-, L-, and P-band frequencies, where the shortest wavelength is approximately 1.5 cm. This means that most opaque objects in the SAR signal path become transparent and SAR systems can image the planetary surface targets without sunlight and through rain, snow and/or even volcanic ash clouds. Most conventional SAR systems in operation, including the Canada's RADARSAT-1, operate in one frequency and in one polarization. This has resulted in black and with images, with which we are familiar now. However, with the launching of ENVTSAT on March 1 2002, the ASAR system onboard the ENVISAT can image Earth's surface targets with selected polarimetric signals, HH+VV, HH+VH, and VV+HV. In 2004, Canadian Space Agency will launch RADARSAT-II, which is C-band, fully polarimetric HH+VV+VH+HV. Almost same time, the NASDA of Japan will launch ALOS (Advanced land Observation Satellite) which will carry L-band PALSAR system, which is again fully polarimetric. This means that we will have at least three fully polarimetric space-borne SAR system fur civilian operation in less than one year. Are we then ready for this new all weather Earth Observation technology\ulcorner Actual imaging process of a fully polarimetric SAR system is not easy to explain. But, most Earth system scientists, including geologists, are familiar with polarization microscopes and other polarization effects in nature. The spatial resolution of the new generation of SAR systems have also been steadily increased, almost to the limit of highest optical resolution. In this talk some new applications how they are used for Earth system observation purpose.