• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.5
• /
• pp.439-444
• /
• 2012

In this study, we address the formation control problem of coupled unicycle-type mobile robots, each of which can interact with its neighboring robots by communicating their position outputs. Each communication link between two mobile robots is assumed to be established according to the given time-varying interconnection topology that switches within a finite set of connected fixed undirected networks and has a non-vanishing dwell time. Under this setup, we propose a distributed formation control algorithm by using the dynamics extension and feedback linearization methods, and by employing a consensus algorithm for linear multi-agent systems which provides arbitrary fast convergence rate to the agreement of the multi-agent system. Finally, the proposed result is demonstrated through a computer simulation.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1188-1191
• /
• 2002

A number of studies have recently been published concerning neuron models and asynchronous neural networks. In the case of large-scale neural networks having neuron models, the neural network should be constructed using analog hardware, rather than by computer simulation via software, because of the limitation of the computational power, In this paper, we discuss the circuit structure of a synaptic section model having the spatio-temporal summation of inputs and utilizing CMOS processing.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.2
• /
• pp.50-58
• /
• 1996

This paper proposes the channel-access protocol suitable to a very high speed photonic WDM network with star configuration, which can provide a high channel utilization and insensitivity to the propagation delay. The proposed protocol employs a control channel and a simple status table to deal with the propagation delay which has been a major limiting factor in the performance of the very high speed optical communication networks. The control channel transmits control information in order to reserve access on data channels, and each node constitutes a status table after the reception of control pckets which holds information about the availbility of destination node and data channel. The proposed protocol is insensitive to the propagation delay time by removing necessity of the retransmission and by allowing parallel transmission of control packet and data packets. It is proved in analysis and discrete event simulation that the proposed protocol is superior in throughput and mean delay, especially at the high load conditions compared to the existing high speed channel-access protocols.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.36T no.4
• /
• pp.82-87
• /
• 1999

The Asynchronous Transfer Mode(ATM) networks are being adopted as backbones over various parts of Internet. TCP is one of the most widespread transport protocols and can be used with ATM. But, TCP shows poor end-to-end performance on ATM networks. Effective throughput of TCP over ATM can be quite low when cells are dropped at the congested ATM switch. As congested link transmits cells from corrupted packets, it wastes bandwidth and throughput becomes low. This paper examines the behavior of TCP over ATM-UBR using EPD switch in a broadband environment. As threshold value closes to the buffer size, the buffer can be used more efficiently, but more drops and retransmission occur. If the threshold value is much less than buffer size, efficiency becomes low, but few drops can be happen. Therefore, the decision of threshold value becomes important factor.

• International journal of advanced smart convergence
• /
• v.5 no.3
• /
• pp.47-55
• /
• 2016

Router main task is to provide routing of Internet Protocol (IP) packets. Routing is achieved with help of the IP lookup. Router stores information about the networks and interfaces in data structures commonly called as routing tables. Comparison of IP from incoming packet with the IPs stored in routing table for the information about route is IP Lookup. IP lookup performs by longest IP prefix matching. The performance of the IP router is based on the speed of prefix matching. IP lookup is a major bottle neck in the performance of Router. Various algorithms and data structures are available for IP lookup. This paper is about reviewing various tree based structure and its performance evaluation.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.791-794
• /
• 1999

A principle requirement and technical standardization for numbering plan is required to B-lSDN network planning. Especially, internetworking high speed network with other conventional networks like PSTN, PSDN and ISDN is generally considered for integration. This paper describes the numbering plan for operation between internet and ATM. And based on the ITU-U specification, numbering plan is compared between conventional and high speed networks. Additionally, numbering plan for ATM-forum is analyzed.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.8
• /
• pp.25-32
• /
• 2017

In this paper we propose a resource management method which enables to guarantee the quality of experience (QoE) for handover in the overlaid macro-femtocell networks. How to cope with the resource demand of handover calls is necessary to efficiently support the movement of mobile terminals, the QoE degradation or the load control. We attempt to satisfy the QoE requirements of users and maximize the capacity of the system at the same time. In order to achieve this goal, this scheme divides the shared resources into two part for the movement of MT and QoE degradation, and allocates those resources with the competition between four types of handovers. Simulation results show that our scheme provides better performances than the conventional one with respect to the outage probability, data transmission throughput.

• Journal of Digital Convergence
• /
• v.12 no.2
• /
• pp.321-326
• /
• 2014

The needs for IT accessibility for disabled persons has increased for recent years. So, it is very important to support multi-modal interfaces, such as voice and vision recognition, TTS, etc. for disabled persons. In this paper, we deal with IT accessibility issues of home networks and show our implemented home network control system model with multi-modal interfaces including voice recognition and animated user interfaces.

• Nuclear Engineering and Technology
• /
• v.41 no.1
• /
• pp.71-78
• /
• 2009

One of main concepts involved in regional small nuclear reactors is unmanned remote control. Internet-based virtual private networks provide environments for the remote monitoring and control of geographically-dispersed systems, and with the advances in communication technologies, the potential of networks for real time control and automation becomes enormous. However, networked control has some problems. The most critical is delay in signal transmission, which degrades system stability and performance. Therefore, a networked control system should be designed to account for delay. This paper proposes some design approaches for a delay-tolerant system that can guarantee predetermined stability margins and performance. To accomplish this, the reactor plant is modeled with consideration of uncertainties. With this model, three kinds of controllers are developed using different methods. The designed systems are compared with respect to stability and performance, and a second-order controller designed using the table lookup method was found to give the most satisfactory results.

• Journal of the Optical Society of Korea
• /
• v.20 no.1
• /
• pp.36-41
• /
• 2016

Visible Light Communication (VLC) using Light Emitting Diodes (LEDs) within the existing lighting infrastructure can reduce the implementation cost and may gain higher throughput than radio frequency (RF) or Infrared (IR) based wireless systems. Current indoor VLC systems may suffer from poor downlink resource allocation problems and small system throughput. To address these two issues, we propose an algorithm called a conflict graph scheduling (CGS) algorithm, including a conflict graph and a scheme that is based on the conflict graph. The conflict graph can ensure that users are able to transmit data without interference. The scheme considers the user fairness and system throughput, so that they both can get optimum values. Simulation results show that the proposed algorithm can guarantee significant improvement of system throughput under the premise of fairness.