• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1994.06a
• /
• pp.30-34
• /
• 1994

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

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.195-197
• /
• 2013

본 논문에서는 이항트리에서의 선형적 에지번호매김방법과 변형된 에지번호매김방법을 제안한다. 이러한 연구결과는 최대 연결도를 갖는 신뢰성이 높은 상호연결망의 일종인 원형군 그래프(circulant graph)의 점프열(jump sequence)로 에지번호들을 사용하면 이항트리를 스패닝 트리로 갖고 최적방송이 가능한 위상설계를 할 수 있다.

• Journal of KIISE:Software and Applications
• /
• v.32 no.4
• /
• pp.247-257
• /
• 2005

Generally, the network topology design problem is characterized as a kind of NP-hard combinatorial optimization problem, which is difficult to solve with the classical method because it has exponentially increasing complexity with the augmented network size. In this paper, we propose the efficient approach with two phase that is comprised of evolutionary computation approach based on Prufer number(PN), which can efficiently represent the spanning tree, and a heuristic method considering 2-connectivity, to solve the highly reliable network topology design problem minimizing the construction cost subject to network reliability: firstly, to find the spanning tree, genetic algorithm that is the most widely known type of evolutionary computation approach, is used; secondly, a heuristic method is employed, in order to search the optimal network topology based on the spanning tree obtained in the first Phase, considering 2-connectivity. Lastly, the performance of our approach is provided from the results of numerical examples.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.5
• /
• pp.1149-1160
• /
• 2005

Generally, the network topology design problem, which is difficult to solve with the classical method because it has exponentially increasing complexity with the augmented network size, is characterized as a kind of NP-hard combinatorial optimization problem. The problem of this research is to design the highly reliable network topology considering the connection cost and all-terminal network reliability, which can be defined as the probability that every pair of nodes can communicate with each other. In order to solve the highly reliable network topology design problem minimizing the construction cost subject to network reliability, we proposes an efficient two phase approach to design reliable network topology, i.e., the first phase employs, a genetic algorithm (GA) which uses $Pr\ddot{u}fer$ number for encoding method and backtracking Algorithm for network reliability calculation, to find the spanning tree; the second phase is a greedy method which searches the optimal network topology based on the spanning ree obtained in the first phase, with considering 2-connectivity. finally, we show some experiments to demonstrate the effectiveness and efficiency of our two phase approach.

• Journal of Korea Multimedia Society
• /
• v.11 no.7
• /
• pp.986-996
• /
• 2008

The home network environment based on the power line communication has some unexpected events. The noise source from the home appliances makes the network impedance increased, and the transmission packets distorted. Therefore the packet transmission from the source node may not be delivered to the destination node directly. In this paper we propose a new self-healing mechanism which relays the packet to the directly unreachable destination automatically with the help of intermediate nodes. In order to choose the minimum required intermediate nodes our mechanism makes a spanning tree with both the directly reachable nodes and indirectly reachable nodes via the intermedia nodes. We developed the network simulator in order to compare its performance to the Echelon's repeater selecting mechanism. Though it required more packet relations than Echelon's but the reachable probability to the destination was highly increased about two times.

• Journal of the Korea Computer Industry Society
• /
• v.6 no.3
• /
• pp.539-550
• /
• 2005

The spanning tree, which is being used the most widely in indoor wiring network, is chosen for the network topology of the optimal LAN design. To apply a spanning tree to GA, the concept of $Pr\ddot{u}fer$ numbers is used. $Pr\ddot{u}fer$ numbers can express he spanning tree in an efficient and brief way, and also can properly represent the characteristics of spanning trees. This paper uses Pareto Stratum-Niche Cubicle(PS-NC) GA by complementing the defect of the same priority allowance in non-dominated solutions of pareto genetic algorithm(PGA). By applying the PS-NC GA to the LAN design areas, the optimal LAN topology design in terms of minimizing both message delay time and connection-cost could be accomplished in a relatively short time. Numerical analysis has been done for a hypothetical data set. The results show that the proposed algorithm could provide better or good solutions for the multi-objective LAN design problem in a fairly short time.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.1
• /
• pp.58-68
• /
• 2010

In this paper, we propose an efficient link protection switching scheme for provider backbone bridge systems with a spanning tree for backup links exclusively, and evaluate its performance. The proposed scheme offers guaranteed QoS flows even when a link fault occurrs in the primary link by flooding the flows over the profiled spanning tree. The flooding mechanism over the spanning tree can also provide low latency and remove the loopback flows. We also derive the efficiency of bandwidth usage for the normal flows and the number of lost frames during the link restoration. For evaluating its feasibility, we implement a prototype of PBB-TE systems based on the Linux bridge codes, which can support both link protection switching capability with CCM and MAC-in-MAC encapsulation. A related protocol analyzer is also developed. One can see that the proposed scheme and the prototype can be useful for developing carrier class Ethernet systems based on PBB-TE.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.5
• /
• pp.1089-1095
• /
• 2004

The genetic algorithms have been used to take a near optimal solution because The generation of the optimal Steiner tree from a given network is NP-hard problem,. The chromosomes in genetic algorithm are represented with the floating point representation instead of the existing binary string for solving this problem. A spanning tree was obtained from a given network using Prim's algorithm. Then, the new Steiner point was computed using genetic algorithm with the chromosomes in the floating point representation, and it was added to the tree for approaching the result. After repeating these evolving steps, the near optimal Steiner tree was obtained. Using this method, the tree is quickly and exactly approached to the near optimal Steiner tree compared with the existing genetic algorithms using binary string.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.418-420
• /
• 2003

최근에 하이퍼큐브의 망비용을 개선한 상호연결망 하이퍼-스타가 제안되었다. 본 논문에서는 상호연결 망 하이퍼-스타 HS(2n,n)의 평균거리가 (equation omitted)임을 보이고, 스패닝 트리를 이용한 일-대-다 방송 기법을 제안하고, 방송 수행 시간이 2n-1임을 보인다.