• 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
• /
• 2000.11b
• /
• pp.51-54
• /
• 2000

This paper presents an efficient method for estimating maximum simultaneous switching noise(SSN) of ground interconnection networks in CMOS systems. For the derivation of maximum SSN expression we use ａ-power law MOS model and an iterative method to reduce error that may occur due to the assumptions used in the derivation process. The accuracy of the proposed method is verified by comparing the results with those of previous researches and HSPICE simulations under the present process parameters and environmental conditions. Our method predicts the maximum SSN values more accurately as compared to existing approaches even in more practical cases such that there exist some of output drivers not in transition.

• Journal of information and communication convergence engineering
• /
• v.8 no.6
• /
• pp.682-686
• /
• 2010

In this paper, we propose the fast wakeup and connection mechanisms for various energy saving schemes in order to improve QoS. First, we offer the interconnection of heterogeneous access networks via the Media Independent Information Server/Service (MIIS). Then, we propose the fast wakeup and connection mechanism for multi-interface communication systems. The proposed novel mechanism focuses on the fast provision of incoming service destined to the interface currently in energy saving mode by using MIIS-assisted interconnection. We further evaluate the performance of proposed mechanism through the numerical and experimental analysis.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.3
• /
• pp.788-798
• /
• 2000

We can consider the interconnection structure suing WDM from two different levels, physical and virtual topologies. In the virtual topology, various channels on physical links can be established between transmitters and the receivers of the nodes. It is important to design efficient virtual topologies, because they have a benefit of performance improvement in interconnection networks depending on traffic matrices without changing physical topologies. In this paper we suggest a way to design virtual topologies that minimize average packet delays for given traffic matrices using genetic algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10B
• /
• pp.676-688
• /
• 2005

We introduced mathematical economic analysis model for understanding the fairness of charge from VoIP providers for interconnection of access network. In order to set up this model we made four assumptions predictable in the real world. Also we proposed two accounting method that is flat-rate-pricing and usage-based-pricing and tried to propose which method is more desirable to charge for interconnection on the basis of social welfare and activation of market competitiveness. The outcome of this study includes the reasonable accounting method for interconnection between telephone network and IP Phone network which is most effective to ensure the social welfare and market competitiveness

• The KIPS Transactions:PartA
• /
• v.17A no.3
• /
• pp.113-120
• /
• 2010

Even networks were introduced as a class of fault-tolerant multiprocessor networks and analyzed so many useful properties and algorithms such as simple routing algorithms, maximal fault tolerance, node disjoint path. Introduced routing algorithms and node disjoint path algorithms are proven to be optimal. However, it has not been introduced to constructing scheme for edge-disjoint spanning trees in even networks. The design of edge-disjoint spanning trees is a useful scheme to analyze for measuring the efficiency of fault tolerant of interconnection network and effective broadcasting. Introduced routing algorithm or node disjoint path algorithm are for the purpose of routing or node disjoint path hence they are not applicable to constitute edge disjoint spanning tree. In this paper, we show a construction algorithm of edge-disjoint spanning trees in even network $E_d$.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.467-470
• /
• 1998

In this paper, we propose a matrix star graph which improves the network cost of the well-known star grah as an interconnection network. We analyze its characteristics in terms of the network parameters, such as degree, scalability, routing, and diameter. The proposed matrix star graph MS2,n has the half degrees of a star graph S2n with the same number of nodes and is an interconnection network with the properties of node symmetry, maximum fault tolerance, and recursive structure. In network cost, a matrix star graph MS2,n and a star graph S2n are about 3.5n2 and 6n2 respectively which means that the former has a better value by a certain constant than the latter has.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.4
• /
• pp.473-484
• /
• 1998

The current interconnection charge regimes is based in fully distributed costing method. Basically this method doesn't give the incument carrier the incentive to promote efficient business operations. In this paper, 1 suggest the adoption of price cap regulation to interconnection charge as incentive schemes and review important considerations in its applications. Additionally I suggest the basic structure of the network costing model for applications of incremental costing method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.14 no.6
• /
• pp.675-685
• /
• 1989

The interconnection network is an integral part of parallel processing system. The multistage interconnection networks(MINs) have been the objects of intense research in recent years. In this paper, simulation techniques for circuit switchign MIN are extended to allow the performance evaluation of partitioned ADM/IADM network. Based on simulation data, the relationship between the netwrok performance, the partitioning scheme employed, and the conflict resolution strategies used within the network is enumerated. It is shown that IADM network coupled with the use of the hold strategy produces the best network operation in terms of RST (Request Service Time).

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.5
• /
• pp.344-350
• /
• 2009

In this paper, we propose a new interconnection network, hierarchical odd network HON($C_d,C_d$), which used the odd network as basic modules. We investigate various topological properties of HON($C_d,C_d$), including connectivity, routing algorithm, diameter and broadcasting. We show that HON($C_d,C_d$) outperforms the three networks, i.e. the odd network, HCN(m,m), and HFN(m,m).