• Journal of KIISE:Information Networking
• /
• v.29 no.4
• /
• pp.386-396
• /
• 2002

This paper presents a neural network-based near-optimal routing algorithm. It employs a modified Hopfield Neural Network (MHNN) as a means to solve the shortest path problem. It uses every piece of information that is available at the peripheral neurons in addition to the highly correlated information that is available at the local neuron. Consequently, every neuron converges speedily and optimally to a stable state. The convergence is faster than what is usually found in algorithms that employ conventional Hopfield neural networks. Computer simulations support the indicated claims. The results are relatively independent of network topology for almost all source-destination pairs, which nay be useful for implementing the routing algorithms appropriate to multi -hop packet radio networks with time-varying network topology.

• Journal of Advanced Navigation Technology
• /
• v.27 no.5
• /
• pp.561-567
• /
• 2023

In this study, the collision risk of the UAM (Urban Air Mobility) corridor was analyzed using a collision risk model applied to the manned aircraft corridor. According to the K-UAM roadmap and operating concept, UAM is expected to fly on a designated route similar to existing manned aircraft operations and operate on two routes, traveling back and forth between the departure point and the destination point. Among domestic manned aircraft routes, the manned aircraft operation between Gimpo Airport and Jeju Airport is similar to this and takes the form of a parallel route with a lateral separation distance between the two routes. In this study, we analyzed the collision risk of the UAM corridor according to the lateral separation distance using a collision risk model used to analyze the collision risk of manned aircraft parallel routes for a similar type of UAM corridor. Based on this, we finally analyzed how many parallel routes could be installed within the width of the Han River, considering the K-UAM demonstration route.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8C
• /
• pp.1149-1158
• /
• 2004

In this thesis, we created a Fuzzy rule in a Fuzzy logic that are Fuzzy logic which is composed of linguistic rules and Fuzzy inference engine for effective traffic control in ATM networks. The parameters of the Fuzzy rules are adapted to minimize the given performance index in both cases. In other words, the difuzzification value controls the threshold in the buffer to arrival ratio to traffic priority (low or high) using fuzzy set theory for traffic connected after reasoning. Also, show experiment result about rule by MATLAB6.5 and on-line bulid-up to verify validity of created Fuzzy rule. As a result, we can verify that threshold value in buffer is efficiently controlled by the traffic arrival ratio.

• Archives of design research
• /
• v.11 no.3
• /
• pp.47-55
• /
• 1998

Homepage design on the Web is incredibly growing fast as the integrative information method than any other media. At the beginning the homepage was designed by text mostly, however, it has been changed to use the multimedia. Design in the Web is changed by the development of computer technology. Rnal destination of Web is an user platform that consists of pixel of monitor screen. Monitor requires different approach from printing material because of the limited of range of presentation and the property of light. This paper has studied to find the possibilities of expression of type which can be the basic structure for HTML. By the case study of homepage, it has analyzed the kind of types, presentation method, the number of frequency, and variation of design.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06a
• /
• pp.164-165
• /
• 2008

전장에서 임무 수행중인 병력이나 탱크 등을 지원하거나 보호 동물의 활동을 모니터링 하는 센서 네트워크에서는 전송 정보뿐만 아니라 그러한 대상들의 위치를 악의적 추적자로부터 보호할 수 있어야 한다. 본 논문에서는 활동 소오스 노드처럼 메시지 전송은 진행하고 있지 않지만 위치가 보호되어야 할 대상과 근접한 휴면(dormant) 소오스 노드들을 고려한 소오스 위치 보호 라우팅 기법 GSLP(GPSR-based Source-Location Privacy)를 제안한다. GSLP는 알고리즘의 간결성과 신장성(scalability)이 뛰어난 GPSR(greedy perimeter stateless routing)을 확장하여 메시지 전달 노드를 선정할 때 일정 확률로 임의의 이웃 노드를 선택하는 한편, perimeter 라우팅을 적용하여 소오스 노드들을 우회하도록 하여 위치를 보호하도록 하였다. 시뮬레이션 결과, 기존의 대표적인 소오스 위치 보호 라우팅 프로토콜인 PR-SP(Phantom Routing-Single Path)에 비해 GSLP는 휴면 소오스 노드들의 수에 거의 관계없이 높은 안전 기간(전송 메시지 수)을 일정하게 제공하면서도 전달 지연(경로의 평균 홉(hop) 수)은 도착지와의 최단 홉 수의 약 두 배 이내에 머물러 대규모 센서 네트워크에서의 소오스의 위치를 보호하기 위한 방안으로 적합한 것으로 평가되었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.10
• /
• pp.1508-1517
• /
• 1993

In this paper, we propose the modeling of a wireless communication system using CSMA protocol, present analytical evalution and simulation as a function of arrival rate and mean END-to-END delay in the distributed packet radio network. Asynchronous 1-persistent CSMA protocol is used in wireless communication system with half duplex. We assume that all terminals are to be in the close range of each other, suitably located in the local area. The traffic presented to a common channel is assumed to be poisson distribution. Analytical model is based on a M/D/1 with breakdown. In conclusion for wireless network model proposed in this paper is suitable for packet arrival rate of 2 packet/sec with mean packet delay time less than 2 times the packet transmission time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1491-1497
• /
• 2009

Existing methods to measure are based on ToA (Timer of Arrival), RSS (Received Signal Strength), AoA(Angle of Arrival) and other methods. In this paper, we propose a compensation of ToA and RSS methods to measure more precisely the distance of nodes. The comparison experiments with the traditional ToA method show that the average error value of proposed method is reduced 30%. We believe that this proposal can improve location estimation of sensor nodes in wireless sensor networks.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.10
• /
• pp.137-144
• /
• 2014

The Electronic Support System collects and analyzes the received radar signals in order to cope with the electronic attack in real-time. The radar-pulse clustering system classifies the radar signals that are considered to be emitted by a single source. This paper proposed a radar-pulse clustering algorithm based on four kinds of features: the direction, frequency, pulse width, and the difference of arrival time between two successive pulses. The experiment results show that the proposing algorithm could trace the moving emitter and classify the timely separated signals into different classes.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.1
• /
• pp.76-84
• /
• 2003

Now days, It is based on GIS and GPS, it can search for the shortest path and estimation of arrival time by using the internet and cell phone to driver. But, even though good car navigation system does not create which is the shortest path when there average vehicle speed is 10 -20 Km. Therefore In order to reduce vehicle waiting time and average vehicle speed, we suggest optimal green time algorithm using fuzzy adaptive control, where there are different traffic intersection length and lane. In this paper, it will be able to forecast the optimal traffic information, estimation of destination arrival time, under construction road, and dangerous road using internet.

• Journal of the Korea Society for Simulation
• /
• v.16 no.2
• /
• pp.75-81
• /
• 2007

Previous queue inference has been studied with some limits. Larson's inference engine, which is the basis for this paper, also processed with basic assumption that arrival process is poisson process. Our inference method, which relaxes the poisson process assumption, must be a useful tool for looking into unobservable inside of queueing systems, as well as calculating accurate system performance. This paper employs these inference methods and proves the validity. Then we apply this method to system analysis for more complicated models. At first, we suggest methods to system with known number of servers, then expand to unknown number of servers. For validating our inference approach, we run some simulation models and compare true values with our results.