• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.1
• /
• pp.33-42
• /
• 2013

This paper presents a multihop range-free localization algorithm to estimate the physical location of a normal node with local connectivity information in anisotropic sensor networks. In the proposed algorithm, a normal node captures the detour degree of the shortest path connecting an anchor pair and itself by comparing the measured hop count and the expected hop count, and the node estimates the distances to the anchors based on the detour degree. The normal node repeats this procedure with all anchor combinations and pinpoints its location using the obtained distance estimates. The proposed algorithm requires fewer anchors and less communication overhead compared to existing range-free algorithms. We showed the superiority of the proposed algorithm over existing range-free algorithms through MATLA simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.7B
• /
• pp.886-891
• /
• 2011

Multicast has been a key routing service for efficient data dissemination in underwater acoustic sensor networks. In sensor networks, there are several multicast routing protocol which reflects sensor network nature. However, existing routing scheme was not targeted at underwater acoustic sensor networks which is hard to provide battery continually. Therefore, a specialized routing algorithm is essential for acoustic sensor networks. In this paper, we propose angle aided multicast routing algorithm for decreasing routing computation complexity, including virtual Euclidean Steiner point. Simulation results show better performance than exist routing Position Based Multicast, Geographic Multicast Routing. such as low computation capability and limited power consumption.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.793-794
• /
• 2009

In recent years a significant increase in computing resources, the Internet, many computing resources associated with multiple users using the service and how it will do for cloud computing or grid computing technology is attracting attention from the networks on physical networks and virtual network links You can configure the virtual network of nodes to configure the virtual network environment, research is being made. Virtualization technology, rather than the actual network operating system is being developed in the field of research for a long time, but this paper is applied to the network field is applied to a mobile network based virtualization technology for virtual mobile network will explore.

• Review of KIISC
• /
• v.28 no.3
• /
• pp.18-25
• /
• 2018

최근 블록체인 기술을 응용한 가상화폐에 대한 관심이 높아지면서 자본금이 많지 않은 사람들도 블록체인 네트워크에 참여하기 시작했다. 가장 유명한 가상화폐인 비트코인이 채택한 PoW 방식은 고성능 하드웨어의 과열된 열풍을 불어왔고 PoS 방식은 기존 지분이 많은 참여자들이 많이 존재하여 소수의 자본금을 가진 신규 참여자들이 네트워크에 새로 참여하기 어려운 환경이다. 따라서 본 논문에서는 기존 블록체인 증명방식인 PoW, PoS 방식보다 네트워크 참여를 위한 자본금이 적고 신규로 참여하더라도 리스크가 적은 PoP(Proof-of-Probability) 방식을 소개한다. PoP 방식은 블록을 생성할 시 실제 암호화된 해쉬와 수많은 가짜 해쉬를 각 노드들이 정렬하여 진짜 해쉬를 복호화하여 찾은 노드가 블록을 생성하는 방식이다. 또한 1개의 해쉬를 복호화하여 검증받을 때 1분의 대기시간을 두어 과열된 컴퓨팅파워 경쟁을 제한한다. 지분(Stake)이 많을수록 블록을 생성할 확률은 높아지지만 이는 PoS 방식처럼 절대적이지 않다. 이 방식을 이용한다면 지분을 많이 가진 유효성 검증자(Validators)에 의한 집중화를 피하며 블록체인 네트워크에 참여하려는 진입장벽도 낮출 수 있을 것 이다.

• Annual Conference of KIPS
• /
• 2018.10a
• /
• pp.71-73
• /
• 2018

소프트웨어 애플리케이션의 가상화를 지원하는 컨테이너(container)는 일반적인 가상머신과 같은 운영체제의 격리된 인스턴스 형태이지만 VM과는 달리 호스트 OS자원을 공유하여 자원을 효율적으로 사용할 수 있고 이식성이 좋으며 배포를 쉽게 할 수 있는 등 장점이 있다. 컨테이너의 중요성과 활용도가 높아지면서 그것을 관리하고 통제하는 오케스트레이션 솔루션도 각광을 받고 있다. 본 논문에서는 Docker에 내장된 오케스트레이션 기능 중 하나인 Docker Swarm이 과도하게 메모리를 사용하는 문제점을 해결하고자 한다. 먼저, Docker Swarm의 구조에서 Manager 노드와 Worker 노드의 서비스를 증가시켜 실행시킨 후 성능을 평가한 후 과점유의 원인을 파악한다. 실험 결과 메모리 과점유의 원인은 컨테이너가 작동을 멈춘 후에도 여전히 메모리를 점유하고 있어 컨테이너를 증가시킬수록 메모리 이용률이 줄어들지 않는 것이 증명되었다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.8
• /
• pp.31-37
• /
• 2016

Ranging is divided into a synchronous scheme and an asynchronous scheme according to the presence of global synchronization between nodes. In general, the asynchronous ranging is preferred over synchronous ranging because it does not require an expensive high-precision oscillator for the global synchronization. On the other hand, in a conventional asynchronous ranging scheme, the packets, which are generated by all nodes in a positioning system of a large-scale infrastructure and need to be sent for localization by reference nodes, are considerable, which cause an increase in network traffic as the number of nodes increases. The traffic congestion lowers the throughput of the network leading to a considerable loss of energy. To solve this problem, this paper proposes a ranging scheme, in which virtual transmission slots randomly and discretely selected by a plurality of nodes are used to reduce the overheads needed in synchronizing the nodes, and the ranging is performed asynchronously based on the virtual transmission slots, thereby decreasing the network traffic. In addition, a performance test proved that the proposed ranging scheme was stronger than the TWR and SDS-TWR on an error range, even though the intensity of traffic was very low.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06a
• /
• pp.146-148
• /
• 2012

임베디드 환경에서의 가상화 연구는 분산 되었던 노드들을 통합할 수 있게 해주면서도, 기존의 시스템 소프트웨어를 수정 없이 사용할 수 있다는 장점으로 인해 각광 받고 있다. 하지만 기존 VMM(Virtual Machine Monitor)의 I/O 가상화 기술은 임베디드 환경에 바로 적용하기에는 비효율적인 구조를 취하고 있다. 본 논문에서는 임베디드 시스템을 위한 전가상화 VMM인 ViMo를 기반으로 virtio를 적용하여 기존 VMM들의 I/O 가상화보다 효율적인 구조의 임베디드 I/O 가상화 기법을 제안한다.

• Annual Conference of KIPS
• /
• 2012.04a
• /
• pp.134-136
• /
• 2012

클라우드 컴퓨팅 서비스 시장이 성장하면서, 서비스 제공자들은 전력 사용량 감소와 서비스 수준을 보장하는 등의 여러 가지 문제와 맞딱드리게 되었다. 이런 문제에 대한 원인 중 하나는 자원 효율성을 높이기 위해 도입한 가상머신 기반의 서버 통합 정책이다. 현재의 가상머신 기술들은 아직까지 완벽한 격리수준을 제공하지 못하기 때문에, 같은 노드에 배치된 가상머신들은 자원을 공유하면서 서로 간에 간섭을 일으키게 된다. 본 연구에서는 가상머신끼리 공유하는 자원 중 프로세서의 말단 캐시(Last-level Cache, LLC)에서의 간섭을 최대한 줄여서 성능을 극대화하기 위한 방법을 제안한다.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.4
• /
• pp.1033-1043
• /
• 1998

In this paper, we present an improved multicasting path assignment algorithm based on the minimum cost spanning tree. In the method presented in this paper, a multicasting path is assigned preferentially when a node to be received is found among the next degree nodes of the searching node in the multicasting path assignment of the constrained steiner tree (CST). If nodes of the legacy group exist between nodes of the new group, a new path among the nodes of new group is assigned as long as the nodes may be excluded from the new multicasting path assignment taking into consideration characteristics of nodes in the legacy group. In assigning the multicasting path additionally, where the source and destination nodes which can be set for the new multicasting path exist in the domain of identical network (local area network) and conditions for degree constraint are satisfied, a method of producing and assigning a new multicasting path is used. The results of comparison of CST with MCSTOP, MCSTOp algorithm enhanced performance capabilities about the communication cost, the propagation delay, and the computation time for the multicasting assignment paths more than CST algorithm. Further to this, research activities need study for the application of the international standard protocol(multicasting path assignment technology in the multipoint communication service (MCS) of the ITU-T T.120).

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.2
• /
• pp.77-85
• /
• 2013

Recently, location information based routing protocol has been studied to estimate end-to-end path in wireless ad-hoc network. This protocol assumes all nodes can get heir location information via GPS devices and floods only limited area with routing message through acquired location information. Therefore, this protocol has advantage that can reduce the number of routing message than the existing IP-based routing protocols. In addition, all nodes enabling this protocol must acquire their own location information to participate in the location-based routing. However, recent because of the miniaturization of sensor node, sensor node without GPS function has been launched. Therefore in case of the sensor node that does not know location information, it is impossible to participate in the ad hoc network configuration and location information based routing. In this paper, a virtual location information based routing scheme is proposed for wireless nodes without GPS function to be able to participate in location information based routing within ad hoc network environments consisting of wireless nodes with GPS function and wireless nodes without GPS function. Therefore, the proposed protocol has the advantage that a wireless node without a GPS function is able to participate in ad hoc network configuration and the location information based routing.