• Journal of Internet Computing and Services
• /
• v.15 no.5
• /
• pp.107-121
• /
• 2014

Distributed systems are collection of physically distributed computers linked by a network. General use of wired/wireless Internet enables users to make use of distributed service anytime and anywhere. The explosive growth of distributed services strongly requires functional verification of services as well as verification of non-functional elements such as service quality. In order to verify distributed services it is necessary to build a test environment for distributed systems. Because, however, distributed systems are composed of physically distributed nodes, efforts to construct a test environment are required more than those in a test environment for a monolithic system. In this paper we propose a test framework to verify functional and non-functional features of distributed systems. The suggested framework automatically generates test cases through the message sequence charts, and includes a test driver composed of the virtual nodes which can simulate the physically distributed nodes. The test result can be checked easily through the various graphs and the graphical user interface (GUI). The test framework can reduce testing efforts for a distributed system and can enhance the reliability of the system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.10
• /
• pp.2105-2112
• /
• 2009

Recently RFID system has been adopted in various fields rapidly. However, we ought to solve the problem of privacy invasion that can be occurred by obtaining information of RFID Tag without any permission for popularization of RFID system To solve the problems, it is Ohkubo et al.'s Hash-Chain Scheme which is the safest method. However, this method has a problem that requesting lots of computing process because of increasing numbers of Tag. Therefore, We suggest the way (process) satisfied with all necessary security of Privacy Protection Shreme and decreased in Tag Identification Time in this paper. First, We'll suggest the SP-Division Algorithm seperating SPs using the Performance Measurement consequence of each node after framing the program to create Hash-Chain Calculated table to get optimized performance because of character of the grid environment comprised of heterogeneous system. If we compare consequence fixed the number of nodes to 4 with a single node, equal partition, and SP partition, when the total number of SPs is 1000, 40%, 49%, when the total number of SPs is 2000, 42%, 51%, when the total number of SPs is 3000, 39%, 49%, and when the total number of SPs is 4000, 46%, 56% is improved.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.11
• /
• pp.1966-1975
• /
• 2008

NEMO Basic Support Protocol standardized in IETF provides the seamless communication environment to all nodes within the mobile network regardless of the network movement while the network is moving. According to the standard, when the mobile network moves outside of its home network the network can make use of the binding update message or dynamic routing protocol in order to register the mobility information into the Home Agent(HA). But because these two methods don't consider the route optimization, all packets destined to Mobile Network Nodes(MNNs) attached into the Mobile Router(MR) have to go through HAs of MRs so that they bring on the transmission delay and the waste of the bandwidth. This situation is to be worse and causes the packet fragmentation problem if MRs within the mobile network are nested. Even though there have been some researches about the route optimization to recover the problems, they have problems in the packet transmission performance side. In this paper, we propose a new scheme to improve the network performance by using a dynamic routing protocol and minimizing the number of HAs on the end-to-end path. Various performance evaluations show that the proposed mechanism gives better performance in view of the packet transmission compared to the existing schemes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.10
• /
• pp.2281-2287
• /
• 2013

Network Coding(NC) is a new paradigm for network communication. In network coding, intermediate nodes create new packets by algebraically combining ingress packets and send it to its neighbor node by broadcast manner. Network Coding has rapidly emerged as a major research area in information theory due to its wide applicability to communication through real networks. Network coding is expected to improve throughput and channel efficiency in the wireless multi-hop network. Prior researches have been carried out to employ network coding to wireless ad-hoc network. In our study, intermediate nodes identify one-hop bidirectional flows for network coding decision. We expect that the proposed scheme shall improve decoding success rate of network coded packet. From the simulation, the proposed network coding scheme achieved better performance in terms of coding gain and packet delivery rate than traditional network coding scheme.

• The KIPS Transactions:PartA
• /
• v.10A no.6
• /
• pp.635-642
• /
• 2003

The radical development of recent network technology provides the basic foundation which can establish a high speed and cheap cluster system. It is a general trend that conventional cluster systems are built as the system over a fixed level based on stabilized and high speed local networks. A multi-distributed web cluster group is a web cluster model which can obtain high performance, high efficiency and high availability through mutual cooperative works between effective job division and system nodes through parallel performance of a given work and shared memory of SC-Server with low price and low speed system nodes on networks. For this, multi-distributed web cluster group builds a sub-cluster group bound with single imaginary networks of multiple system nodes and uses the web distributed shared memory of system nodes for the effective data transmission within sub-cluster groups. Since the presented model uses a load balancing and parallel computing method of large-scale work required from users, it can maximize the processing efficiency.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.48 no.4
• /
• pp.32-38
• /
• 2011

This paper describes implementation of the 5.0GHz RF frequency synthesizer with 0.18${\mu}m$ silicon CMOS technology being used as an application of the IEEE802.15.4 USN sensor node transceiver modules. To get good performance of speed and noise, design of the each module like VCO, prescaler, 1/N divider, fractional divider with ${\Sigma}-{\Delta}$ modulator, and common circuits of the PLL has been optimized. Especially to get excellent performance of high speed and wide tuning range, N-P MOS core structure and 12 step cap banks have been used in design of the VCO. The chip area including pads for testing is $1.1{\times}0.7mm^2$, and the chip area only core for IP in SoC is $1.0{\times}0.4mm^2$. Through analysing of the fabricated frequency synthesizer, we can see that it has wide operation range and excellent frequency characteristics.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.6
• /
• pp.87-93
• /
• 2008

This paper describes implementation of the 5.0GHz RF frequency synthesizer with $0.18{\mu}m$ silicon CMOS technology being used as an application of the IEEE802.15.4 USN sensor node transceiver modules. To get good performance of speed and noise, design of the each module like VCO, prescaler, 1/N divider, fractional divider with ${\Sigma}-{\Delta}$ modulator, and common circuits of the PLL has been optimized. Especially to get good performance of speed, power consumption, and wide tuning range, N-P MOS core structure has been used in design of the VCO. The chip area including pads for testing is $1.1*0.7mm^2$, and the chip area only core for IP in SoC is $1.0*0.4mm^2$. Through comparing and analysing of the designed two kind of the frequency synthesizer, we can conclude that if we improve a litter characteristics there is no problem to use their as IPs.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.6
• /
• pp.558-569
• /
• 2017

In this paper, a 256Kb EEPROM IP aimed at battery applications using a single supply of 1.5V which is embedded into an MCU is designed. In the conventional cross-coupled VPP (boosted voltage) charge pump using a body-potential biasing circuit, cross-coupled PMOS devices of 5V in it can be broken by the junction or gate oxide breakdown due to a high voltage of 8.53V applied to them in exiting the program or erase mode. Since each pumping node is precharged to the input voltage of the pumping stage at the same time that the output node is precharged to VDD in the cross-coupled charge pump, a high voltage of above 5.5V is prevented from being applied to them and thus the breakdown does not occur. Also, all erase, even program, odd program, and all program modes are supported to reduce the times of erasing and programming 256 kilo bits of cells. Furthermore, disturbance test time is also reduced since disturbance is applied to all the 256 kilo bits of EEPROM cells at once in the cell disturb test modes to reduce the cell disturbance testing time. Lastly, a CG driver with a short disable time to meet the cycle time of 40ns in the erase-verify-read mode is newly proposed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.8B
• /
• pp.482-491
• /
• 2007

This paper proposes a k-disjoint-path routing algorithm that provides energy efficient and reliable message transmission in wireless sensor networks. The proposed algorithm sends messages through a single path without the occurrence of critical events. However, it sends through k disjoint paths(k>1) under the occurrence of critical events. The proposed algorithm detects the occurrence of critical events by monitoring changing data patterns, and calculates k from a well-defined fault model and the target-delivery ratio. Our simulations reveal that the proposed algorithm is more resilient to node failure than other routing algorithms, and it also decreases energy consumption and reduces the average delay much more than multi-path and path-repair algorithms.

• Electronics and Telecommunications Trends
• /
• v.32 no.4
• /
• pp.67-77
• /
• 2017

최근 이슈가 되고 있는 자율주행차(Autonomous vehicle 또는 Self-driving car)를 실현하기 위해서는, 다양한 환경에서도 차량에 대한 끊김 없는 연결을 제공하는 커넥티드카(Connected car) 기술이 필수적이다. 현재 커넥티드카를 구현하기 위한 차량 네트워크(Vehicular network) 기술은 교통시스템 인프라 기반의 단일홉(Single-hop) 무선통신 기술이 주를 이루고 있다. 이러한 단일홉 통신은 커버리지가 교통시스템 인프라가 구축된 지역으로 제한된다. 따라서 차량 네트워크가 현재보다 더욱 넓은 지역을 커버하기 위해서는 차량 자체가 이동형 라우터 역할을 수행하여 차량 간의 전달을 통해 정보를 원거리로 전달할 수 있는 다중홉(Multi-hop) 통신 도입이 필요하다. 다중홉 차량 네트워크는 차량의 높은 동적 특성으로 인해 다수의 도전적인 기술적 이슈들을 가진다. 본고에서는 이러한 기술 이슈 중 차량 네트워크의 높은 이동성으로 발생할 수 있는 종단 노드 간 비연결성을 해결할 수 있는 기술인 지연감내형 차량 네트워킹(Delay-tolerant vehicular networking) 기술에 대한 주요 연구 동향을 살펴보고자 한다. 이를 위해 먼저 지연감내형 차량 네트워킹의 기술적 배경 및 주요 관련 기술들을 분석하고 이를 기반으로 향후 연구개발이 필요한 기술 이슈들을 정리한다.