• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.2
• /
• pp.391-398
• /
• 2009

In this study, we introduce the design methodology of an optimized fuzzy cascade controller with the aid of hierarchical fair competition-based genetic algorithm(HFCGA) for ball & beam system. The ball & beam system consists of servo motor, beam and ball, and remains mutually connected in line in itself. The ball & beam system determines the position of ball through the control of a servo motor. The displacement change the position of ball leads to the change of the angle of the beam which determines the position angle of a servo motor. Consequently the displacement change of the position of the moving ball and its ensuing change of the angle of the beam results in the change of the position angle of a servo motor. We introduce the fuzzy cascade controller scheme which consists of the outer(1st) controller and the inner(2nd) controller as two cascaded fuzzy controllers, and auto-tune the control parameters(scaling factors) of each fuzzy controller using HFCGA. The inner controller controls the position of lever arm which corresponds to the position angle of a servo motor and the outer controller decides the set-point value of the inner controller. HFCGA is a kind of parallel genetic algorithms(PGAs), and helps alleviate the premature convergence being generated in conventional genetic algorithms (GAs). For a detailed comparative analysis from the viewpoint of the performance results and the design methodology, the proposed method for the ball & beam system which is realized by the fuzzy cascade controller based on HFCGA, is presented in comparison with the conventional PD cascade controller based on serial genetic algorithms.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.05a
• /
• pp.367-370
• /
• 2017

This paper proposes a method for selecting efficient relay nodes in stochastic DTN model. Delay Tolerant Network (DTN) uses the Carry and Forward method, which creates a bundle layer for efficient communication, selects relay nodes between different networks and heterogeneous networks, and forwards messages. DTN is basically composed of mobile nodes so DTN has no fixed routing route and it has long latency due to intermittent connection. Therefore, the nodes constituting the DTN necessarily have the characteristics to store the messages, and the capacity of the stored messages and nodes affects the performance of the network. Stochastic DTN model proposed a Markov model that changes randomly over time to analyze the performance of DTN. In this paper, we use stochastic message distribution and node contact probabilities using contact time analyzed through message generation and extinction in order to select efficient relay nodes in stochastic DTN model.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.1
• /
• pp.211-220
• /
• 2018

The standard data link layer encryption provided by CCSDS has a structure that encodes HDLC frame into it using an AES algorithm. However, CCSDS is standard method has a structure in which the receiving side cannot request a re-activation when noise interference occurs over an unstable channel. SES Alarmed has a structure that enables the receiving side to additionally detect errors and perform re-activation requests in an operational structure similar to that of link encryption in CCSDS. The SES Alarmed related paper was intended to identify the optimum range of thresholds and identify data corruption due to channel noise. In this paper, the focus was on reducing the re-activation process if the HDLC frame, excluding the password Sync code, consistently exceeds any threshold levels. The HDLC frame order was changed and the results of using SES Alarmed were proposed and compared.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.12 s.354
• /
• pp.89-94
• /
• 2006

In the Mobile IP, the movement of Mobile Host(MH) causes packets to be transmitted through a long route. A Correspond Node(CN) first communicate with a Home Agent(HA) when a Mobile Host moved from one subnet to another subnet. The HH-MIP algorithm reduces an inefficient transmission of packets by regarding a Foreign Agent(FA) near a mobile host as a Temporary Home Agent(THA). However, The algorithm costs the unnecessary signaling by measuring the distance of route between a FA and a THA for handover in the case that a Mobile host comes from a THA which a current FA never communicated. To solve this problem, we propose a scheme called Hierarchical Home Agent Handover in Mobile IP(HHH-MIP) algorithm. Our HHH-MIP algorithm only searches tables in a router by using the hierarchical structure between a FA and a THA. The simulation results show that the HHH-MIP algorithm reduces the additional signaling cost.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9A
• /
• pp.1332-1339
• /
• 2000

This paper presents the architecture and design of a high speed asymmetric data transmission baseband MODEM ASIC chip for CATV networks. The implemented MODEM chip supports the physical layer of the DOCSIS(Data Over Cable Service Interface Specification) standard in MCNS(Multimedia Cable Network System) The chip consists of a QPSK/16-QAM transmitter and a 64/256-QAM receiver which contain a symbol timing recovery circuit, a carrier recovery circuit, a blind equalizer using MMA and LMS algorithms. The chip can support data rates of 64Mbps at 256 QAM and 48Mbps at 64-QAM and can provide symbol rates up to 8MBaud. This symbol rate is faster than existing QAM receivers. We have performed logic synthesis using the $0.35\mu\textrm{m}$ standard cell library. The total number of gates is about 290,000 and the implemented chip is being fabricated and will be delivered soon.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5B
• /
• pp.509-516
• /
• 2009

The Stream Control Transmission Protocol(SCTP) is a reliable transport layer protocol that provides several features. Multihoming is the one of the features and allows an association(SCTP's term for a connection) between two endpoints to use multiple paths. One of the paths, called a primary path, is used for initial data transmission and in the case of retransmission an alternate path is used. SCTP's current retransmission policy attempts to improve the chance of success by sending all retransmissions to an alternate destination address. However, SCTP's current retransmission policy has been shown to actually degrade performance in many circumstances. It is because that, due to Karn's algorithm, successful retransmissions on the alternate path cannot be used to update RTT(Round-Trip Time) estimation for the alternate path. In this paper we propose a scheme to avoid such performance degradation. We utilize 2bits which is not used in the flag field of DATA and SACK chunks to disambiguate original transmissions from retransmissions and to keep RTT and RTO(Retransmission Time-Out) values more accurate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.9
• /
• pp.561-569
• /
• 2014

In wireless ad hoc networks, neighbor discovery is essential in the network initialization and the design of routing, topology control, and medium access control algorithms. Therefore, efficient neighbor discovery algorithms should be devised for self-organization in wireless ad hoc networks. In this paper, we propose a probabilistic neighbor discovery (PND) algorithm, which aims at reducing the neighbor discovery time by adjusting the transmission probability of advertisement messages through the multiplicative-increase/multiplicative-decrease (MIMD) policy. To further improve PND, we consider the collision detection (CD) capability in which a device can distinguish between successful reception and collision of advertisement messages. Simulation results show that the transmission probabilities of PND and PND with CD converge on the optimal value quickly although the number of devices is unknown. As a result, PND and PND with CD can reduce the neighbor discovery time by 15.6% to 57.0% compared with the ALOHA-like neighbor discovery algorithm.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.17 no.3
• /
• pp.64-72
• /
• 2003

Comparing with transmission networks, the faults in distribution networks more often occurs because of the complicated structure and the adjacency to customers. Moreover the faults give direct damage to customers. So fault diagnosis and blackout restoration in distribution networks are very important elements to reduce the damage of customers and to maintain the stability. The restoration problem of distribution networks is subject to time. Minimizing the switching numbers in restoration process is the crucial element. In other words. the best restoration is to restore all blackout area through just one switching, if not the restoration has to be accomplished through several switching. This paper proposes the efficient restoration system in distribution networks to minimize the switching numbers. The proposed system uses the dynamic division method of hierarchical structure which consists of heuristic searching method and meta algorithm. The proposed system is applied to the sample networks, and the results showed a promising possibility.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.573-577
• /
• 2005

Recently there are increasing needs for Internet and various kinds of contents. These traffics for various contents need more amount of data to provide high-quality information and require various QoS depending on the characteristics of contents. However, current Internet service supports BE (Best Effort) service only, therefore IntServ (Integrated Service) scheme and DiffServ (Differentiated Service) scheme are represented to support QoS in IP layer. Moreover, while wireless Internet is getting popular, MAC(Medium Access Control)is also becoming important. This is due to the fact that wireless access, resource allocation and packet scheduling, which are done in another layers before, are performed in MAC layer in many new wireless systems. This paper describes new scheme that provides QoS taking into account the traffic characteristics over Mobile IPv6 network based on IEEE 802.11e EDCF and evaluates the performance through computer simulation.

• Journal of KIISE:Software and Applications
• /
• v.31 no.7
• /
• pp.911-921
• /
• 2004

Accurate minutiae extraction from input fingerprint images is one of the critical modules in robust automatic fingerprint identification system. However, the performance of a minutiae extraction is heavily dependent on the quality of the input fingerprint images. If the preprocessing is performed according to the fingerprint image characteristics in the image enhancement step, the system performance will be more robust. In this paper, we propose a knowledge-based preprocessing method, which extracts S features (the mean and variance of gray values, block directional difference, orientation change level, and ridge-valley thickness ratio) from the fingerprint images and analyzes image quality with Ward's clustering algorithm, and enhances the images with respect to oily/neutral/dry characteristics. Experimental results using NIST DB 4 and Inha University DB show that clustering algorithm distinguishes the image Quality characteristics well. In addition, the performance of the proposed method is assessed using quality index and block directional difference. The results indicate that the proposed method improves both the quality index and block directional difference.