• ETRI Journal
• /
• v.32 no.1
• /
• pp.157-159
• /
• 2010

Tree-based routing Ethernet (TRE) is a recent Ethernet architecture that enables shortcut links to improve performance compared to spanning tree protocols. However, TRE can only use shortcuts that arrive directly at bridges located in the branch of the destination. TRE+ extends the topology knowledge of a bridge to 2 hops away, thus unveiling new shortcuts to the destination branch. Simulations show a major performance improvement of TRE+ compared to TRE, with results close to shortest paths in some topologies.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.587-590
• /
• 2019

This paper is about to improve the network life's reduction due to the deviation of sensor node and frequently change of network, the main problem of sensor network. The existing Scalable Topology Organization(STO)-based ZigBee Tree Topology Control Algorithm did not consider ways to consume power so the network lifetime is too short. Accordingly, per each round, electing a new parent node and consisting of the new network topology technique, The Cluster Header Selection, extending the network's overall lifetime. The OMNet++ Simulator yielded results from the existing STO Algorithm and the proposed Cluster Header Selection Technique in the same experimental environment, which resulted in an increase in overall network life by about 40% and an improvement of about 10% in performance in the remaining portion of the battery.

• Proceedings of the KAIS Fall Conference
• /
• 2003.11a
• /
• pp.223-230
• /
• 2003

Feature-based similarity retrieval has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects (e 'g', documents, images, video, music score, etc.). For example, images are represented by their color histograms, texture vectors, and shape descriptors, and are usually high-dimensional data. The performance of conventional multidimensional data structures(e'g', R- Tree family, K-D-B tree, grid file, TV-tree) tends to deteriorate as the number of dimensions of feature vectors increases. The R＊-tree is the most successful variant of the R-tree. In this paper, we propose a SOM-based R＊-tree as a new indexing method for high-dimensional feature vectors.The SOM-based R＊-tree combines SOM and R＊-tree to achieve search performance more scalable to high dimensionalities. Self-Organizing Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two dimensional space. The mapping preserves the topology of the feature vectors. The map is called a topological of the feature map, and preserves the mutual relationship (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. A best-matching-image-list. (BMIL) holds similar images that are closest to each codebook vector. In a topological feature map, there are empty nodes in which no image is classified. When we build an R＊-tree, we use codebook vectors of topological feature map which eliminates the empty nodes that cause unnecessary disk access and degrade retrieval performance. We experimentally compare the retrieval time cost of a SOM-based R＊-tree with that of an SOM and an R＊-tree using color feature vectors extracted from 40, 000 images. The result show that the SOM-based R＊-tree outperforms both the SOM and R＊-tree due to the reduction of the number of nodes required to build R＊-tree and retrieval time cost.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.6B
• /
• pp.1080-1087
• /
• 1999

High-speed network resources and large storage devices on video servers are necessary to Provide interactive VOD services to subscribers, therefore, building networks for VOD services requires a huge amount of cost. A number of studies on network hierarchy for distributed tree architecture, on optimized server allocation with a given network topology, and on program caching etc, are currently in progress. In this study, given specific network resources, a cost effective network architecture including the optimal number of tree levels and the optimal number of branches at a node are designed by modeling cost functions, and some restrictions on network design are discussed. The results of this study are expected to be applied to network architecture design for interactive VOD services

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3329-3350
• /
• 2017

Installing caching and computing facilities in mobile edge networks is a promising solution to cope with the challenging capacity and delay requirements imposed on future mobile communication systems. The problem of optimal facility placement in mobile edge networks has not been fully studied in the literature. This is a non-trivial problem because the mobile edge network has a unidirectional topology, making existing solutions inapplicable. This paper considers the problem of optimal placement of a fixed number of facilities in a mobile edge network with an arbitrary tree topology and an arbitrary demand distribution. A low-complexity sequential algorithm is proposed and proved to be convergent and optimal in some cases. The complexity of the algorithm is shown to be $O(H^2{\gamma})$, where H is the height of the tree and ${\gamma}$ is the number of facilities. Simulation results confirm that the proposed algorithm is effective in producing near-optimal solutions.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.4 s.334
• /
• pp.7-14
• /
• 2005

Earlier researches have typically concentrated on discovering IP network topology, which implies that the connectivity of all Ethernet devices is ignored. But automatic discovery of Physical topology Plays a crucial role in enhancing the manageability of modem Metro Ethernet mesh networks due to the benefits of Ethernet services, including: Ease of use, Cost Effectiveness and flexibility. Because of proprietary solutions targeting specific product families and related algorithm which depends on Layer 2 forwarding table information it is impossible to discover physical topology in the Ethernet mesh networks. To cope with these shortcomings, in this paper we propose a novel and practical algorithmic solution that can discover accurate physical topology in the Ethernet mesh networks. Our algorithm divides the Ethernet mesh networks into bridged networks and host networks and those bridges located in boundary are named edge bridges. Our algorithm uses the standard spanning tree protocol MIB information for the bridged networks and uses the standard Layer 2 forwarding table MIB information for the host networks. As using the standard MIB information to discover physical topology we can offer interoperability guarantee in the Ethernet mesh networks composed of the various vendors' products.

• Smart Media Journal
• /
• v.5 no.4
• /
• pp.41-48
• /
• 2016

In mobile ad hoc networks(MANETs), all the nodes in a network have limited resources. Therefore, communication topology which has long lifetime is suitable for nodes in MANETs. And MANETs are exposed to various threats because of a new node which can join the network at any time. There are various researches on security problems in MANETs and many researches have tried to make efficient schemes for reducing network power consumption. Power consumption is necessary to secure networks, however too much power consumption can be critical to network lifetime. This paper focuses on energy efficient monitoring node distribution for enhancing network lifetime in MANETs. Since MANETs cannot use centralized infrastructure such as security systems of wired networks, we propose an efficient IDS node distribution scheme using minimum spanning tree (MST) method to cover all the nodes in a network and enhance the network lifetime. Simulation results show that the proposed algorithm has better performance in comparison with the existing algorithms.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2005.11a
• /
• pp.830-833
• /
• 2005

SDM(Structural Dynamics Modification) is to improve dynamic characteristics of a structure, more specifically of a base structure, by adding or deleting auxiliary(modifying) structures. In this paper, I will focus on the optimal layout of the stiffeners which are attached to the plate to maximize 1st natural frequency. Recently, a new topology method was proposed by yamazaki. He uses growing and branching tree model. I modified the growing and branching tree model. The method is designated modified tree model. To expand the layout of stiffeners, I will consider non-matching problem. The problem is solved by using local lagrange multiplier without the mesh regeneration. Moreover The CMS(Component mode synthesis) method is employed to reduce the computing time of eigen reanalysis using reduced componet models.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.04a
• /
• pp.212-213
• /
• 2015

Data aggregation is a fundamental problem in wireless sensor networks that has attracted great attention in recent years. On constructing a robust algorithm for minimizing data aggregation delay in wireless sensor networks, we consider limited transmission range sensors and approximate the minimum-delay data aggregation tree which can only be built in networks of unlimited transmission range sensors. The paper proposes an adaptive method that can be applied to maintain the network structure in case of a sensor node fails. The data aggregation tree built by the proposed scheme is therefore self-healing and robust. Intensive simulations are carried out and the results show that the scheme could adapt well to network topology changes compared with other approaches.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.9
• /
• pp.65-73
• /
• 2014

Since Time synchronization is also critical in Wireless Sensor Networks (WSN) like other networks, a time synchronization protocol for WSN called IBS(Indirect-Broadcast Synchronization) has been already proposed in 2012. As IBS operates in cluster tree topology, network lifetime may be mainly shortened by cluster head node[s], which usually consumes more power than cluster member (i.e. non-cluster head) nodes. In this paper, I propose enhanced version of IBS (called EIBS) which saves overall energy and prolongs network lifetime by re-constructing partial cluster tree locally. Compared with other tree construction approaches, this tree reconstruction algorithm is not only simpler, but also more efficient in the light of overall power consumption and network lifetime.