• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제27권8C호
• /
• pp.729-740
• /
• 2002

This paper studies the issues arising in the virtual topology reconfiguration phase of Multi-wavelength Routed Optical Networks. This reconfiguration process means to change the virtual topology in response to the changing traffic patterns in the higher layer. We formulate the optimal reconfiguration policy as a multi-stage decision-making problem to maximize the expected reward and cost function over an infinite horizon. Then we propose a new heuristic algorithm based on node-exchange to reconfigure the virtual topology to meet the traffic requirement. To counter the continual approximation problem brought by heuristic approach, we take the traffic prediction into consideration. We further propose a new heuristic reconfiguration algorithm called Prediction based Multi-stage Reconfiguration approach to realize the optimal reconfiguration policy based on predicted traffic. Simulation results show that our reconfiguration policy significantly outperforms the conventional one, while the required physical resources are limited.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제18권9호
• /
• pp.2243-2250
• /
• 2014

In wireless sensor networks(WSNs), geographical routing algorithms can enhance the network capacity. However, in real WSNs, it is difficult for each node to know its physical location accurately. Especially, indoor environments contain various obstacles such as concrete wall, furniture which cause non-line-of-sight(NLOS) conditions. To solve the problem, we propose location error compensation algorithm by using two difference topology constructions. First topology is based on mobile node's location which is obtained from anchor nodes. Second topology is based on mutual distance from neighbor nodes. The proposed algorithm efficiently detects and corrects the location errors and significantly enhances the network performance of geographic routing in the presence of location errors.

• Journal of KIISE:Information Networking
• /
• 제30권1호
• /
• pp.1-8
• /
• 2003

In this paper. we develop an analytical model to evaluate the virtual topology reconfiguration phase of optical Internet networks. To counter the continual approximation problem brought by traditional heuristic approach, we take the traffic prediction into consideration and propose a new heuristic reconfiguration algorithm called Prediction based Multi-stage Reconfiguration approach. We then use this analytical model to study the different configuration operation policies in response to the changing traffic patterns in the higher layer and the congestion level on the virtual topology. This algorithm persists to decide the optimal instant of reconfiguration easily based on the network state. Simulation results show that our virtual topology management Policy significantly outperforms the conventional one, while the required physical resources are limited.

• Journal of KIISE:Information Networking
• /
• 제34권3호
• /
• pp.226-238
• /
• 2007

In this paper, we present a novel fully distributed topology control protocol that can construct the multiple-ring topology of Minimal Connected Dominating Set (MCDS) as the transport backbone for mobile ad hoc networks. It makes a topology from the minimal nodes that are chosen from all the nodes, and the constructed topology is comprised of the minimal physical links while preserving connectivity. This topology reduces the interference. The all nodes work as the nodes of the distributed parallel Boltzmann machine, of which the objective function is consisted of two Boltzmann factors: the link degree and the connection domination degree. To define these Boltzmann factors, we extend the Connected Dominating Set into a fuzzy set, and also define the fuzzy set of nodes by which the multiple-ring topology can be constructed. To construct the transport backbone of the mobile ad hoc network, the proposed protocol chooses the nodes that are the strong members of these two fuzzy sets as the clusterheads. We also ran simulations to provide the quantitative comparison against the related works in terms of the packet loss rate and the energy consumption rate. As a result, we show that the network that is constructed by the proposed protocol has far better than the other ones with respect to the packet loss rate and the energy consumption rate.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권1호
• /
• pp.157-176
• /
• 2011

An interest-based P2P constructs the peer connections based on similarities for efficient search of resources. A clustering technique using peer similarities as data is an effective approach to group the most relevant peers. However, the separation of groups produced from clustering lowers the scalability of a P2P network. Moreover, the interest-based approach is only concerned with user-level grouping where topology-awareness on the physical network is not considered. This paper proposes an efficient scalable search for the interest-based P2P system. A scalable multi-ring (SMR) based on fuzzy clustering handles the grouping of relevant peers and the proposed scalable search utilizes the SMR for scalability of peer queries. In forming the multi-ring, a minimized route function is used to determine the shortest route to connect peers on the physical network. Performance evaluation showed that the SMR acquired an accurate peer grouping and improved the connectivity rate of the P2P network. Also, the proposed scalable search was efficient in finding more replicated files throughout the peer network compared to other traditional P2P approaches.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권1호
• /
• pp.145-164
• /
• 2014

Network virtualization provides a promising tool to allow multiple heterogeneous virtual networks to run on a shared substrate network simultaneously. A long-standing challenge in network virtualization is the Virtual Network Embedding (VNE) problem: how to embed virtual networks onto specific physical nodes and links in the substrate network effectively. Recent research presents several heuristic algorithms that only consider single topological attribute of networks, which may lead to decreased utilization of resources. In this paper, we introduce six complementary characteristics that reflect different topological attributes, and propose three topology-aware VNE algorithms by leveraging the respective advantages of different characteristics. In addition, a new KS-core decomposition algorithm based on two characteristics is devised to better disentangle the hierarchical topological structure of virtual networks. Due to the overall consideration of topological attributes of substrate and virtual networks by using multiple characteristics, our study better coordinates node and link embedding. Extensive simulations demonstrate that our proposed algorithms improve the long-term average revenue, acceptance ratio, and revenue/cost ratio compared to previous algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권8호
• /
• pp.4041-4059
• /
• 2019

Key establishment method based on channel reciprocity for time division duplex (TDD) system has earned a vital consideration in the majority of recent research. While most of the cellular systems rely on frequency division duplex (FDD) systems, especially the 5G network, which is not characterized by the channel reciprocity feature. This paper realizes the generation of a group secret key for multi-terminals communicated through a wireless network in FDD mode, by utilizing the nature of the physical layer for the wireless links between them. I consider a new group key generation approach, which using bitwise XOR with a modified pairwise secret key generation approach not based on the channel reciprocity feature. Precisely, this multi-node secret key agreement technique designed for three wireless network topologies: 1) the triangle topology, 2) the multi-terminal star topology, and 3) the multi-node chain topology. Three multi-node secret key agreement protocols suggest for these wireless communication topologies in FDD mode, respectively. I determine the upper bound for the generation rate of the secret key shared among multi-node, for the three multi-terminals topologies, and give numerical cases to expose the achievement of my offered technique.

• Journal of Korea Multimedia Society
• /
• 제24권11호
• /
• pp.1526-1537
• /
• 2021

Due to the difference between the underwater communication environment and the terrestrial communication environment, the radio communication mainly used on the ground cannot be used in underwater. For this reason, in the underwater communication environment, various communication media such as acoustic waves, infrared rays, light and so on has been studied, but there exist several difficulties in operating them individually due to their physical limitations. The concept for overcoming these difficulties is the very underwater multi-media communication, a method to select a communication medium best suitable for the current underwater environment among underwater communication multimedia whenever there occurs underwater communication failure. In this paper, we present an underwater multi-media communication network based on star topology and a fragmentation and reassembly technique to solve the problems caused by the different MTU (Maximum Transmission Unit) sizes among different underwater communication media. We also present the estimations and analysis on processing times in each of fragmentation and reassembly and the total data amount for transmitting fragments in our proposed underwater multi-media communication network.

• Journal of the Korean Geographical Society
• /
• 제39권5호
• /
• pp.804-818
• /
• 2004

As spatial data resources become more abundant, the potential for conflict among them increases. Those conflicts can exist between two or many spatial datasets covering the same area and categories. Therefore, it becomes increasingly important to be able to effectively relate these spatial data sources with others then create new spatial datasets with matching geometry and topology. One extensive spatial dataset is US Census Bureau's TIGER file, which includes census tracts, block groups, and blocks. At present, however, census maps often carry information that conflicts with municipally-maintained detailed spatial information. Therefore, in order to fully utilize census maps and their valuable demographic and economic information, the locational information of the census maps must be reconciled with the more accurate municipally-maintained reference maps and imagery. This paper formulates a conceptual framework and two map models of map conflation to make geometrically and topologically consistent source maps according to the reference maps. The first model is based on the cell model of map in which a map is a cell complex consisting of 0-cells, 1-cells, and 2-cells. The second map model is based on a different set of primitive objects that remain homeomorphic even after map generalization. A new hierarchical based map conflation is also presented to be incorporated with physical, logical, and mathematical boundary and to reduce the complexity and computational load. Map conflation principles with iteration are formulated and census maps are used as a conflation example. They consist of attribute embedding, find meaning node, cartographic 0-cell match, cartographic 1-cell match, and map transformation.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 한국소음진동공학회 2008년도 추계학술대회논문집
• /
• pp.343-347
• /
• 2008

Design of shape for visco-elastic vibration isolation elements, which are very cost-effective and so popular in many applications is frequently based on experiences, intuitions, or trial and errors. Such traditions in shape design make it difficult for drastic changes or new concepts to come out. In this paper, both topological method and shape optimization method are combined together to find out a most desirable isolator shape efficiently by using two commercial engineering programs. ABAQUS and MATLAB. The procedure is divided into two steps. At the first step, a topology optimization method is employed to find an initial shape. where density of either 0 or 1 for finite elements is used for physical realizability. At the second step, based on the initial shape, finer tuning of the shape is done by boundary movement method. An illustration of the procedure will be presented for a mount of an air-conditioner compressor system and the effectiveness will be discussed.