• The KIPS Transactions:PartC
• /
• v.16C no.1
• /
• pp.83-90
• /
• 2009

Wireless Sensor Network (WSN) is a wireless network that gathers information from remote area with autonomously configured routing path. We propose a fusion based routing for a 'convergecast' in which all sensors periodically forward collected data to a base station. Previous researches dealt with only full-fusion or no-fusion case. Our Fusion rate based Spanning Tree (FST) can provide effective routing topology in terms of total cost according to all ranges of fusion rate f ($0{\leq}f{\leq}1$). FST is optimum for convergecast in case of no-fusion (f = 0) and full-fusion (f = 1) and outperforms the Shortest Path spanning Tree (SPT) or Minimum Spanning Tree (MST) for any range of f (0 < f < 1). Simulation of 100-node WSN shows that the total length of FST is shorter than MST and SPT nearby 31% and 8% respectively in terms of topology lengths for all range of f. As a result, we confirmed that FST is a very useful WSN topology.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5B
• /
• pp.421-429
• /
• 2006

In this paper, we suggest a new capability aware spanning tree(CAST) algorithm for Ethernet bridged network which consists of both legacy Ethernet bridges and synchronous Ethernet ones. The legacy spanning tree algorithm specified in IEEE 802.1D standard select root bridge and construct tree based on each bridge's identifier without consideration of each bridge's capability. Thus we note that if the legacy STP may assign a synchronous bridge as a root bridge, the bridge may become a bottleneck for asynchronous trafficbecause of bandwidth limitation for asynchronous traffic. In this paper, the CAST algorithm constructsmultiple spanning tree by using of bridge capability and makes different transmission path for each traffics, can removes this kind of defect. From the simulation results, we can see that the proposed CAST algorithm has better end-to-end delay performance than legacy spanning tree algorithm in high traffic load and multiple hops environment.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2024.05a
• /
• pp.522-523
• /
• 2024

상호의존성을 검증하기 위해 통계적 측정치를 사용한 심층 분석을 통해 섹터 기반 상장지수펀드를 중심으로 금융 네트워크의 불일치를 분석한다. 최소 스패닝 트리, p 값 기반 네트워크와 같은 방법론을 채택하여 가격 기반 불일치를 조사하여 금융 데이터 내의 기본 네트워크 구조를 파악합니다. 우리의 주요 기여는 다양한 측정치와 네트워크 분석을 사용하여 금융 시장에 대한 다양한 통찰력을 제공하는 방법을 보여주는 것이다.

• 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.

• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.367-376
• /
• 2003

This study deals with the DCMST (Delay constrained Capacitated Minimum Spanning Tree) problem applied in the topological design of local networks or finding several communication paths from root node. While the traditional CMST problem has only the traffic capacity constraint served by a port of root node, the DCMST problem has the additional mean delay constraint of network. The DCMST problem consists of finding a set of spanning trees to link end-nodes to the root node satisfying the traffic requirements at end-nodes and the required mean delay of network. The objective function of problem is to minimize the total link cost. This paper presents two-phased heuristic algorithm, which consists of node exchange, and node shift algorithm based on the trade-off criterions, and mean delay algorithm. Actual computational experience and performance analysis show that the proposed algorithm can produce better solution than the existing algorithm for the CMST problem to consider the mean delay constraint in terms of cost.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.6
• /
• pp.1538-1545
• /
• 1998

System reliability has been a major concern since the beginning age of the electronic digital computers. One of the modest ways of increasing reliability is to design fault-tolerant system. This paper propose a construction mechanism of fault-tolerant system for the general graph topology. This system has several spare nodes. Up to date, fault-tolerant system design is applied only to loop and tree networks. But they are very limited cases. New algorithm of this paper tried to have a capability which can be applied to any kinds of topologies without such a many restriction. the algorithm consist of several steps : minimal diameter spaning tree extraction step, optimal node decision step, original connectivity restoration step and finally redundancy graph construction step.

• 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.

• 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 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.