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

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.3
• /
• pp.341-345
• /
• 2010

WMN is one of efficient solutions to provide Internet services for users by forming wireless backbone networks with wireless links. The dominant technology for WMNs is the IEEE 802.11, which provides multi-channel and multi-rate capabilities. One of important issues in WMNs is the network capacity and it is essential to design a multi-channel protocol that leverages the network capacity. However, when wireless links that use different data rates operate on the common channel, the performance of high-rate links is severely degraded by the presence of the low-rate links, which is often referred as performance anomaly. In this paper, we propose a Tree-based Channel Assignment (TreeCA) protocol to mitigate the performance anomaly problem by distributing data rates over multiple channels. TreeCA performs channel assignments based on the tree WMN architecture to accommodate the Internet traffics efficiently. Parent nodes on the tree distribute their child nodes over multiple channels so that the performance anomaly is reduced. Through simulations, we observed that the proposed TreeCA outperforms the existing multi-channel protocols for WMNs.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.2
• /
• pp.234-243
• /
• 2000

We design a modified network architecture with condsidering current Internet network model and traffic characteristics, and propose EDCBT(Enhanced Dispersed Core-based Tree) multicast routing protocol, which enhances scalabity, reliability, end-to-end delay and resource utilization EDBCT adopts bidirectional dispersed shared trees and manages both of intradomain and interdomain multicast trees for a multicast group. Each regional multicast tree is estabilshed from its core router and they are interconnected by the operation between border routers on edges of each regional network. As a result, interdomain multicast tree can be easily established. We introduce a new concept named RBTS(Region-based Tree Switching), which dramatically enhances QoS and network utilization. Finally, protocol performance and the effect of core router location are evaluated with MIL3 OPNet network simulator, in terms of end-to-end delay, packet loss and throughput.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.1
• /
• pp.39-45
• /
• 2014

This paper proposes an architecture of a sensor network for gathering data under a powerful beam cluster tree architecture. This architecture is used when there is a need to gather data from sensor node where there is no sink node connected to an existing network, or it is required to get a series of data specific to an event or time. The transmit distance of the beam signal is longer than that of the usual sensor node. The nodes of the network make a tree network when receiving a beam message transmitting from the powerful root node. All sensor nodes in a sink tree network synchronize to the superframe and know exactly the sequence value of the current superframe. When there is data to send to the sink node, the sensor node sends data at the corresponding allocated channel. Data sending schemes under the guaranteed time slot are tested and the delay and jitter performance is explained.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.171-192
• /
• 2017

The change of any element in the network is possible to cause performance degradation of the multicast network. So it is necessary to optimize the topology path through the multicast update strategy, which directly affects the performance and user experience of the overlay multicast. In view of the above, a new multicast tree update strategy based on perturbation theory Musp (Multicast Update Strategy based on Perturbation theory) is proposed, which reduces the data transmission interruption caused by the multicast tree update and improves user experiences. According to the multicast tree's elements performance and the topology structure, the Musp strategy defines the multicast metric matrix and based on the matrix perturbation theory it also defines the multicast fluctuation factor. Besides it also demonstrates the calculability of the multicast fluctuation factor presents the steps of the Musp algorithm and calculates the complexity. The experimental results show that compared with other update strategies, as for the sensitivity of the multicast fluctuation factor's energized multicast tree to the network disturbance, the maximum delay of the Musp update strategy is minimal in the case of the local degradation of network performance.

• Journal of Electrical Engineering and Technology
• /
• v.8 no.4
• /
• pp.889-898
• /
• 2013

The shortest-path searching algorithm must not only find a global solution to the destination, but also solve a turn penalty problem (TPP) in an urban road transportation network (URTN). Although the Dijkstra algorithm (DA) as a representative node-based algorithm secures a global solution to the shortest path search (SPS) in the URTN by visiting all the possible paths to the destination, the DA does not solve the TPP and the slow execution speed problem (SEP) because it must search for the temporary minimum cost node. Potts and Oliver solved the TPP by modifying the visiting unit from a node to the link type of a tree-building algorithm like the DA. The Multi Tree Building Algorithm (MTBA), classified as a representative Link Based Algorithm (LBA), does not extricate the SEP because the MTBA must search many of the origin and destination links as well as the candidate links in order to find the SPS. In this paper, we propose a new Link-Based Single Tree Building Algorithm in order to reduce the SEP of the MTBA by applying the breaking rule to the LBA and also prove its usefulness by comparing the proposed with other algorithms such as the node-based DA and the link-based MTBA for the error rates and execution speeds.

• Journal of Korean Society on Water Environment
• /
• v.31 no.1
• /
• pp.19-28
• /
• 2015

The purpose of this research is reconstruction of annual precipitation based on Tree-ring series at Seorak mountain and examine its effectiveness. To do so we performed nonlinear time series characteristics test of Tree-ring series and reconstructed annual precipitation of Gangneung from 1687 to 1911 using Artificial neural network and Nonlinear autoregressive exogeneous input (NARX) model which reflects stochastic properties. As a result, Tree-ring series at Seorak Mountain shows nonlinear time series property and reconstructed annual precipitation series drawn from NARX is similar in statistical characteristics of observed annual time series.

• Journal of Communications and Networks
• /
• v.13 no.4
• /
• pp.385-392
• /
• 2011

A loop can take place in the process of managing tree topology for mobility management of mobile nodes in infrastructure-based mobile ad hoc networks. The formation of a loop degrades an effective bandwidth of the wireless network by passing an identical message repeatedly within the same loop. Therefore, the loop should be resolved to revert the system back to the normal state. In this paper, we propose a simple and novel mechanism that detects and resolves a loop quickly by tracking the depth of trees. The mobility management approach that employs the loop resolution method is evaluated comparatively with the original tree-based one and the hybrid one. It is shown that the proposed approach far outperforms the other approaches, and it is robust against the rapid changes in network topology.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1475-1482
• /
• 2009

In ZigBee network, using energy efficiently is necessary because ZigBee node works by battery. To use energy efficiently, it is one of the way to reduce unnecessary network traffic. In this paper, it presents efficient shortcut routing algorithm using depth of destination node in ZigBee network. In traditional tree routing, each node transfers data only to its own parent or child node, which is inefficient way. Efficient shortcut routing algorithm is also based on tree routing. However, we suggests the algorithm with using neighbor table and depth of destination that is able to transfer data to other neighbor node, not only to parent or child node. It minimizes coordinator bottleneck state and unnecessary intermediate routing path which happens in traditional tree routing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9B
• /
• pp.751-759
• /
• 2008

Carrier Ethernet backbone network integrates distributed layer-2 based metro networks. In this networks, Multiple Spanning Tree Protocol (MSTP) has been uscd as a main routing protocol that allows multiple spanning trees in a network. A better routing protocol called IEEE802.1aq - Shortest Path Bridging (SPB) is recently proposed, that generates the shortest spanning tree per a destination node. As SPB provides a routing path per a destination node, there is no way to adapt network traffic at normal condition. If we are free from the principle of "a spanning tree per a destination node", we can achieve adaptive routing. Based on this philosophy, we propose a new spanning tree based protocol - Edge Node Divided Spanning Tree (ENDIST). ENDIST divides an edge node into sub-nodes as many as connecting links from the node and each sub-node generates a single shortest path tree based on SPB. Depending on network or nodal status, ENDIST chooses a better routing path by flow-basis. This added traffic engineering ability contributes to enhanced throughput and reduced delay in backbone networks. The simulation informs us that ENDIST's throughput under heavy load performs about 3.4-5.8 and 1.5-2.0 times compared with STP's and SPB's one respectively. Also, we verified that ENDIST's throughput corresponds to the theoretical upper bound at half of cases we investigated. This means that the proposed ENDIST is a dramatically enhanced and the close-to-perfect spanning tree based routing schemes.