• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.1
• /
• pp.21-27
• /
• 2012

We can efficiently collect crops or minerals by operating multi-robot foraging. As foraging spaces become wider, control algorithms demand scalability and reliability. Swarm robotics is a state-of-the-art algorithm on wide foraging spaces due to its advantages, such as self-organization, robustness, and flexibility. However, high initial and operating costs are main barriers in performing multi-robot foraging system. In this paper, we propose a novel method to improve the energy efficiency of the system to reduce operating costs. The idea is to employ a new behavior model regarding role division in concert with the search space division.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2014.02a
• /
• pp.356.2-356.2
• /
• 2014

Spin Transfer Torque (STT) is of great interest in data writing scheme for the Magneto-resistive Random Access Memory (MRAM) using Magnetic Tunnel Junction (MTJ). Scalability for high density memory requires ferromagnetic electrodes having the perpendicular magnetic easy axis. We investigated CoZr as the ferromagnetic electrode. It is observed that interfacial magnetic anisotropy is preferred perpendicular to the plane with thickness dependence on the interfaces with Pt layer. The anisotropy energy (Ku) with thickness dependence shows a change of magnetic-easy-axis direction from perpendicular to in-plane around 1.2 nm of CoZr. The interfacial anisotropy (Ki) as the directly related parameters to switching and thermal stability, are estimated as $1.64erg/cm^2$ from CoZr/Pt multilayered system.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.1271-1274
• /
• 2005

Fast long-distance network 에서 기존 TCP 의 혼잡 제어 (congestion control) 알고리즘은 대역폭을 효과적 사용하지 못하는 문제점을 가지고 있다. 대역폭을 효과적으로 사용하기 위해서 TCP 혼잡 제어를 수정한 다양한 프로토콜들이 제안되었다. 이러한 프로토콜들은 디자인 시 주로 bandwidth scalability, TCP friendliness, 그리고 RTT fairness 와 같은 세 가지의 특성을 고려하고 있다. 하지만 제안된 프로토콜들은 어떤 것도 trade-off 관계로 있는 이 세 가지 특성을 동시에 만족시키지 못한다. 본 논문에서는 혼잡 제어 알고리즘의 증가 규칙 (increase rule)에 RTT 를 직접 반영함으로써 위 세가지 요구사항을 동시에 만족시키는 EIMD (Exponential Increase/ Multiplicative Decrease)라고 하는 새로운 TCP 혼잡 제어 알고리즘을 제안한다. EIMD 는 패킷 손실이 없는 한, 지수적으로 윈도우를 증가시켜 효과적으로 대역폭을 사용하면서도, 패킷손실 직전의 윈도우 크기, $W_{max}$ 에 반비례하게 윈도우를 증가시킴으로써 fair share 에 빠르게 수렴할 수 있다는 특성을 갖는다. 모의실험을 통해 제안된 프로토콜이 fast long-distance network 에서 위 4 가지 특성들을 모두 만족하는지 검증한다

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1996.06b
• /
• pp.29-34
• /
• 1996

This paper proposes a new concept in video called Graphical Video. Graphical Video is a content-based and scalable video representation. A video consists of several elements such as moving images, still images, graphics, characters and charts. All of these elements can be represented graphically except moving images. It is desirable to transform these moving images graphical elements so that they can be treated in the same way as other graphical elements. To achieve this, we propose a new graphical representation of moving images using spatio-temporal clusters, which consist of texture and contours. The texture is described by three-dimensional fractal coefficients, while the contours are described by polygons. We propose a method that gives domain pool location and size as a means to describe cluster texture within or near a region of clusters. Results of an experiment on texture quality confirm that the method provides sufficiently high SNR as compared to that in the original three-dimensional fractal approximation.

• Journal of Powder Materials
• /
• v.24 no.2
• /
• pp.153-163
• /
• 2017

Transparent conducting electrodes (TCEs) are attracting considerable attention as an important component for emerging optoelectronic applications such as liquid crystal displays, touch panels, and solar cells owing to their attractive combination of low resistivity (<$10^{-3}{\Omega}cm$) and high transparency (>80%) in the visible region. The solution-based process has unique properties of an easy fabrication procedure, scalability, and low cost compared to the conventional vacuum-based process and may prove to be a useful process for fabricating TCEs for future optoelectronic applications demanding large scale and flexibility. In this paper, we focus on the introduction of a solution-based process for TCEs. In addition, we consider the powder materials used to fabricate solution-based TCEs and strategies to improve their transparent conducting properties.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.3-4
• /
• 2006

Fast IP address lookup in routers is essential to achieve packet forwarding in wire-speed. The longest prefix matching for IP address lookup is more complex than exact matching because of its dual dimensions, length and value. By thoroughly studying the current proposals for IP address lookup, we find out that the binary search could be a low-cost solution while providing high performance. Most of the existing binary search algorithms based on trie have simple data structures which can be easily implemented, but they have some problems because of empty internal nodes. The proposed algorithm is based on trie structure, but empty internal nodes are replaced by priority prefixes. The best-matching-prefix search in the proposed algorithm is more efficiently performed since search can be finished earlier when input is matched with a priority prefix. The performance evaluation results show that the constructed priority-trie has very good performance in the lookup speed and the scalability.

• ETRI Journal
• /
• v.37 no.3
• /
• pp.512-522
• /
• 2015

Recent developments in identity-based cryptography (IBC) have provided new solutions to problems related to the security of mobile ad hoc networks (MANETs). Although many proposals to solve problems related to the security of MANETs are suggested by the research community, there is no one solution that fits all. The interdependency cycle between secure routing and security services makes the use of IBC in MANETs very challenging. In this paper, two novel methods are proposed to eliminate the need for this cycle. One of these methods utilizes a key pool to secure routes for the distribution of cryptographic materials, while the other adopts a pairing-based key agreement method. Furthermore, our proposed methods utilize threshold cryptography for shared secret and private key generation to eliminate the "single point of failure" and distribute cryptographic services among network nodes. These characteristics guarantee high levels of availability and scalability for the proposed methods. To illustrate the effectiveness and capabilities of the proposed methods, they are simulated and compared against the performance of existing methods.

• Journal of Communications and Networks
• /
• v.15 no.6
• /
• pp.614-634
• /
• 2013

The proliferation of real-time multimedia services requires huge amounts of data transactions demanding strict quality-of-service (QoS) guarantees. Multicast transmission is a promising technique because of its efficient network resource utilization. However, high head-of-line (HOL) blocking probability and lack of service-specific QoS control should be addressed for practical implementations of multicast networks. In this paper, a topology aware fanout set division (TAFD) scheme is proposed to resolve these problems. The proposed scheme is composed of two techniques that reduce HOL blocking probability and expedite packet delivery for large-delay branches regarding multicast tree topology. Since management of global topology information is not necessary, scalability of the proposed scheme is guaranteed. Mathematical analysis investigates effects of the proposed scheme and derives optimal operational parameters. The evaluation results show that the TAFD scheme achieves significant delay reduction and satisfies required delay bounds on various multicast networks.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.19 no.8
• /
• pp.138-143
• /
• 2005

A hierarchical tree structure of clusters has advantages for the network design due to its scalability and simple routing protocol. In this paper, the cluster tree routing protocol is studied for the wireless sensor network. From the numerical analysis results, the data aggregation in the intermediate nodes reduces the number of communication message and saves the energy of sensor nodes, but it may result in increased data traffic latency. And also the selection of cluster head can increase the relaying hops very high.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.1183-1186
• /
• 2014

Our research is different form traditional to have some large LED screen grouping together to constitute multi-vision technique. In this paper, we purpose a method of using k-path diffusion method to build connect between the devices and find an optimal data transmission path. In second half of this paper, through practical application, we using this technique transmitting data successfully and achieving a simple Multi-vision effect. This technique possess smart devices and Wifi P2P's features, these features improve system's dynamic and decentralized processing ability make our technique has high scalability.