• The KIPS Transactions:PartC
• /
• v.15C no.4
• /
• pp.273-280
• /
• 2008

In WSN(Wireless Sensor Network) many routing algorithms such as LEACH, PEGASIS and PEDEP consisting of sensor nodes with limited energy have been proposed to extend WSN lifetime. Under the assumption of perfect fusion, these algorithms used convergecast that periodically collects sensed data from all sensor nodes to a base station. But because these schemes studied less energy consumption for a convergecast as well as fairly energy consumption altogether, the minimum energy consumption for a convergecast was not focused enough nor how topology influences to energy consumption. This paper deals with routing topology and energy consumption for a single convergecast in the following ways. We chose major WSN topology as MSC(Minimum Spanning Chain)s, MSTs, PEGASIS chains and proposed LECSEN chains. We solved the MSC length by Linear Programming(LP) and propose the LECSEN chain to compete with MST and MSC. As a result of simulation by Monte Carlo method for calculation of the topology length and standard deviation of link length, we learned that LECSEN is competitive with MST in terms of total energy consumption and shows the best with the view of even energy consumption at the sensor nodes. Thus, we concluded LECSEN is a very useful routing topology in WSN.

• Annual Conference on Human and Language Technology
• /
• 1999.10e
• /
• pp.55-62
• /
• 1999

교차언어 문서검색에서는 단일언어 문서 상황을 만들기 위하여 질의나 문서를 다른 언어로 변환하게 되는데, 일반적으로 간단하면서도 실용적인 질의 변환의 방법을 주로 사용하고 있다. 하지만 단순한 대역 사전을 사용한 질의 변환의 경우에 변환 모호성 때문에 40% 이상의 검색 효과의 감소를 가져온다. 본 논문에서는 이러한 변환 모호성을 해결하기 위하여 대역 코퍼스로부터 추출한 상호 정보를 이용하는 단순하지만 효과적인 사전 기반 질의 변환 방법을 제안한다. 본 연구에서는 변환 모호성으로 발생한 다수의 후보들에서 가장 좋은 후보를 선택하는 모호성 해소 뿐 아니라 후보 단어들에 적절히 가중치를 부여하는 방법을 사용한다. 본 질의 변환 방법은 단순히 가장 큰 상호 정보의 단어를 선택하여 모호성 해소만을 적용하는 방법과 Krushall의 최소 스패닝 트리 구성과 유사한 방법으로 상호 정보가 큰 순서대로 간선들을 연결하여 모호성 해소와 가중치 부여를 적용하는 방법들과 질의 변환의 검색 효과를 비교한다. 본 질의 변환 방법은 TREC-6 교차언어 문서검색 환경의 실험에서 단일 언어 문서검색의 경우의 85%, 수작업 모호성 해소의 경우의 96%에 도달하는 성능을 얻었다.

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.341-346
• /
• 2004

Recently A Hyper-Star Graph HS(m, k) has been introduced as a new interconnection network of new topology for parallel processing. Hyper-Star Graph has properties of hypercube and star graph, further improve the network cost of a hypercube with the same number of nodes. In this paper, we show that Hyper-Star Graph HS(m, k) is subgraph of hypercube. And we also show that regular graph, Hyper-Star Graph HS(2n, n) is node-symmetric by introduced mapping algorithm. In addition, we introduce an efficient one-to-all broadcasting scheme - takes 2n-1 times - in Hyper-Star Graph HS(2n, n) based on a spanning tree with minimum height.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05a
• /
• pp.289-292
• /
• 2003

인터넷이 발전함에 따라 네트워크 시스템의 토폴로지 설계에 관한 여러 가지 문제들에 대한 관심이 증가하고 있다. 이러한 네트워크의 토폴로지 구조는 서비스 센터, 터미널(사용자), 연결 케이블로 이루어져 있다. 근래에 이런 네트워크 시스템들은 사용자들로부터의 요구사항이 많아지고 있기에 주로 광케이블로 구축하는 경우가 점차 늘어나고 있다지만, 광케이블의 비판 비용을 고려하면 네트워크의 구조가 스패닝 트리(spanning tree)로 구축되어 지는 것이 바람직하다고 볼 수 있다. 네트워크 토폴로지 설계 문제들은 연결비용, 평균 메시지 지연, 네트워크 신뢰도 등과 같은 설계 기준들을 최적으로 만족하는 토폴로지를 탐색하는 것으로 정의될 수 있다. 최근에 유전자 알고리즘(GA)은 네트워크 최적화 문제, 조합 최적화 문제, 다목적 최적화 문제 등과 같은 관련된 분야에서 많은 연구들이 이루어지고 있으며 또한, 많은 실세계의 문제를 위한 최적화 기술로서 그 잠재력을 매우 주목 받고 있다. 본 논문에서는 연결비용, 평균 메시지 지연, 네트워크 신뢰도를 고려하여, 광케이블로 구성되어 지는 광대역통신 네트워크의 2목적 네트워크 토폴로지 설계 문제들을 풀기 위한 GA를 제안한다. 또한, 후보 네트워크 토폴로지 구조를 염색체(chromosome)로 표현하기 위해 Prtifer수(PN_와 클러스터 스트링으로 구성되어지는 새로운 엔코딩 방법도 제안한다. 마지막으로 수치예를 통해 제안한 GA의 성능을 평가할 것이다.

• The KIPS Transactions:PartA
• /
• v.9A no.1
• /
• pp.19-28
• /
• 2002

A new class of applications based on event interactions are emerging for the wide-area network such as Internet, which is characterized as loose coupling, heterogeneity. and asynchrony. Content-barred publish/subscribe systems are widely being studied to implement the extent notification service for wide-area networks. In this paper, we analyze some problems of the content-based routing algorithm in SIENA, a recently developed as a representative event notification service architecture, and develop an enhanced routing algorithm.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.572-575
• /
• 2011

It is well known that spanning tree protocol (STP) is the most commonly used protocol in switching networks for smart grid. STP selectively blocks redundancy links of the network to prevent layer 2 loops in network, and it also has a functionality of backing up links. As with the other protocols, STP has been updated with the continuing development of the network. STP is a broad concept and it does not just refer in particular to defined STP protocol in IEEE 802.1D standards, it refers to updated spanning tree protocol based on STP. Because of uneven distribution of communication traffic in root bridge, STP cannot satisfy fast converge nce while the failure occurs near the root bridge or on the root bridge in tree topologies of STP. In this paper, we propose a novel method --- Hyper Cube Spanning Tree Protocol (HCSTP) to solve uneven distribution of communication traffic. Theoretically, hyper cube in our protocol increases throughput and improves the utilization of communication. The simulation results show that HCSTP can achieve comparative and considerably higher performance than other STP protocols in terms of reconnection.

• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.458-465
• /
• 2007

Wireless Sensor Network(WSN) is a special network that collects measured data by sensor nodes in the predefined sensor field and forwards them to the base station in a distance using their own routing scheme. WSN requires routing techniques to maximize energy efficiency because sensor nodes have non-rechargeable and thus limited energy. Characteristics of WSN are various according to applications, many of routing algorithms have been proposed. This paper proposes an algorithm called A-PEGASIS that basically bases on PEGASIS and enhances in two aspects - an elegant chain generation algorithm and periodical update of chains. We compare performance of the previous algorithm of LEACH, PEGASIS, PEDAP and PEDAP-PA with ours through simulation. It confirms that the A-PEGASIS is most superior in terms of average WSN lifetime and high probability of node survival rate during WSN life time.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.1-7
• /
• 2009

When constructing various mobile networks including sensor networks, the problem of finding the layout or graph to interconnect the terminals or nodes of the network may come up. Providing a common scheme that can be applied to the kind of problems, and formulating the bounds of the run time and the result of the algorithm from the scheme, one may evaluate precisely the plan of constructing analogous network systems. This paper, dealing with EMST(Euclidean Minimum Spanning Tree) that represents such problems, provides the scheme for constructing EMST by parallel processing over distributed environments, and the ground for determining the maximum difference of the layout or the graph produced from the scheme: the difference from EMST. In addition, it provides the upper bound of the run time of the algorithm from the scheme.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.42 no.6
• /
• pp.461-467
• /
• 2014

This paper investigates using small UAVs as communications relay nodes for expanding communications links and improving communications quality, primarily for a fleet of ground or navy vessels. An airborne relay in ground/maritime space can effectively connect to units operating over the horizon, beyond normal communication range, or under limited satellite communication environment. Even if the equipment development is mature for communications relay, where to locate UAVs for efficient relay is still a pending question. With this background, this paper will develop high-level deployment algorithms to optimize the location of UAVs for improving the connectivity of a wireless network among a fleet of ground or navy vessels.

• Journal of KIISE:Software and Applications
• /
• v.32 no.10
• /
• pp.963-973
• /
• 2005

Increasing attention is being recently devoted to various problems inherent in the topological design of networks systems. The topological structure of these networks can be based on service centers, terminals (users), and connection cable. Lately, these network systems are well designed with tiber optic cable, because the requirements from users become increased. But considering the high cost of the fiber optic cable, it is more desirable that the network architecture is composed of a spanning tree. In this paper, we present a GA (Genetic Algorithm) for solving bicriteria network topology design problems of wide-band communication networks connected with fiber optic cable, considering the connection cost, average message delay, and the network reliability We also employ the $Pr\ddot{u}fer$ number (PN) and cluster string in order to represent chromosomes. Finally, we get some experiments in order to certify that the proposed GA is the more effective and efficient method in terms of the computation time as well as the Pareto optimality.