• IE interfaces
• /
• v.9 no.3
• /
• pp.72-80
• /
• 1996

As the fiber optic technology is rapidly being deployed in telecommunication networks, particular emphasis is placed on the survivability in designing networks. Most of the survivable network design models proposed to date have connectivity constraints, which cannot precisely define a network topology owing to the multiplicity of feasible ones. In this paper, we propose a k-link survivable network design model incorporating traffic-based survivability constraints which restrict the lost traffic due to a network failure under a prescribed level. Our model is shown to include the existing connectivity models as special cases. Then we present its integer programming formulation, analyze the structural properties, and develop a heuristic for obtaining low cost survivable networks.

• Journal of KIISE:Software and Applications
• /
• v.32 no.10
• /
• pp.963-973
• /
• 2005

Increasing attention is being recently devoted to various problems inherent in the topological design of networks systems. The topological structure of these networks can be based on service centers, terminals (users), and connection cable. Lately, these network systems are well designed with tiber optic cable, because the requirements from users become increased. But considering the high cost of the fiber optic cable, it is more desirable that the network architecture is composed of a spanning tree. In this paper, we present a GA (Genetic Algorithm) for solving bicriteria network topology design problems of wide-band communication networks connected with fiber optic cable, considering the connection cost, average message delay, and the network reliability We also employ the $Pr\ddot{u}fer$ number (PN) and cluster string in order to represent chromosomes. Finally, we get some experiments in order to certify that the proposed GA is the more effective and efficient method in terms of the computation time as well as the Pareto optimality.

• Journal of Mechanical Science and Technology
• /
• v.18 no.11
• /
• pp.1923-1931
• /
• 2004

Manufacturing of complex surface plates in stern and stem is a major factor in cost of a preliminary ship design by computing process. If these hull plate parts are effectively classified, it helps to compute the processing cost and find the way to cut-down the processing cost. This paper presents a new method to classify surface plates effectively in the preliminary ship design using neural network. A neural-network-based ship hull plate classification program was developed and tested for the automatic classification of ship design. The input variables are regarded as Gaussian curvature distributions on the plate. Various applicable rules of network topology are applied in the ship design. In automation of hull plate classification, two different numbers of input variables are used. By observing the results of the proposed method, the effectiveness of the proposed method is discussed. As a result, high prediction rate was achieved in the ship design. Accordingly, to the initial design stage, the ship hull plate classification program can be used to predict the ship production cost. And the proposed method will contribute to reduce the production cost of ship.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.35 no.6
• /
• pp.367-374
• /
• 2022

This papter presents the use of the automatic differential method based on the backpropagation method to obtain the design sensitivity and its application to topology optimization considering the stress constraints. Solving topology optimization problems with stress constraints is difficult owing to singularities, the local nature of stress constraints, and nonlinearity with respect to design variables. To solve the singularity problem, the stress relaxation technique is used, and p-norm for stress constraints is applied instead of local stresses for global stress measures. To overcome the nonlinearity of the design variables in stress constraint problems, it is important to analytically obtain the exact design sensitivity. In conventional topology optimization, design sensitivity is obtained efficiently and accurately using the adjoint variable method; however, obtaining the design sensitivity analytically and additionally solving the adjoint equation is difficult. To address this problem, the design sensitivity is obtained using a backpropagation technique that is used to determine optimal weights and biases in the artificial neural network, and it is applied to the topology optimization with the stress constraints. The backpropagation technique is used in automatic differentiation and can simplify the calculation of the design sensitivity for the objectives or constraint functions without complicated analytical derivations. In addition, the backpropagation process is more computationally efficient than solving adjoint equations in sensitivity calculations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.3
• /
• pp.1260-1283
• /
• 2019

Low earth orbit (LEO) satellite broadband network is a crucial part of the space information network. LEO satellite constellation design is a top-level design, which plays a decisive role in the overall performance of the LEO satellite network. However, the existing works on constellation design mainly focus on the coverage criterion and rarely take network performance into the design process. In this article, we develop a unified framework for constellation optimization design in LEO satellite broadband networks. Several design criteria including network performance and coverage capability are combined into the design process. Firstly, the quality of service (QoS) metrics is presented to evaluate the performance of the LEO satellite broadband network. Also, we propose a network stability model for the rapid change of the satellite network topology. Besides, a mathematical model of constellation optimization design is formulated by considering the network cost-efficiency and stability. Then, an optimization algorithm based on non-dominated sorting genetic algorithm-II (NSGA-II) is provided for the problem of constellation design. Finally, the proposed method is further evaluated through numerical simulations. Simulation results validate the proposed method and show that it is an efficient and effective approach for solving the problem of constellation design in LEO satellite broadband networks.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.14 no.4
• /
• pp.165-175
• /
• 2019

Networks use relatively slow heartbeat mechanisms, usually in routing protocols, to detect failures when there is no hardware signaling to help out. The time to detect failures available in the existing protocols is no better than a second, which is far too long for some applications and represents a great deal of lost data at 10 Gigabit rates. We compare the convergence time of routing protocol applying Bidirectional Forwarding Detection (BFD) protocol in wired mesh network topology. This paper suggests the combinations of protocols improving fail-over performance. Through the performance analysis, we contribute to reduce convergence time when system is fail-over.

• Journal of Korea Multimedia Society
• /
• v.12 no.9
• /
• pp.1297-1308
• /
• 2009

The life time of a wireless sensor network composed of numerous sensor nodes depend on ones of its sensor nodes. The energy efficiency operation of nodes, therefore, is one of the crucial factors to design the network. Researches based on the hierarchical network topology have been proposed and evolved in terms of energy efficiency. However, in existing researches, application layer data obtained from sensor nodes are not considered properly to compose cluster, including issue that nodes communicate with their cluster heads in TDMA scheduling. In this paper, we suggest an energy-efficient topology control scheme based on application layer data in wireless sensor networks. By using application layer data, sensor nodes form a section which is defined as the area of adjacent nodes that retain similar characteristics of application environments. These sections are further organized into clusters. We suggest an algorithm for selecting a cluster head as well as a way of scheduling to reduce the number of unnecessary transmissions from each node to its cluster head, which based on the degree and the duration of similarity between the node's data and its head's data in each cluster without seriously damaging the integrity of application data. The results show that the suggested scheme can save the energy of nodes and increase the life time of the entire network.

• Journal of information and communication convergence engineering
• /
• v.9 no.6
• /
• pp.683-688
• /
• 2011

The wireless sensor network (WSN) is well known for an enabling technology for the ubiquitous environment such as real-time surveillance system, habitat monitoring, home automation and healthcare applications. However, the WSN featuring wireless communication through air, a resource constraints device and irregular network topology, is threatened by malicious nodes such as eavesdropping, forgery, illegal modification or denial of services. For this reason, security in the WSN is key factor for utilizing the sensor network into the commercial way. There is a series of symmetric cryptography proposed by laboratory or industry for a long time. Among of them, recently proposed HUMMINGBIRD algorithm, motivated by the design of the well-known Enigma machine, is much more suitable to resource constrained devices, including smart card, sensor node and RFID tags in terms of computational complexity and block size. It also provides resistance to the most common attacks such as linear and differential cryptanalysis. In this paper, we implements ultra-lightweight cryptography, HUMMINGBIRD algorithm into the resource constrained device, sensor node as a perfectly customized design of sensor node.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.3
• /
• pp.537-543
• /
• 2012

Smart home System is shirt-sleeve, the automatic control systems, computer network system and network communication technology in the integration of network intelligent home control system. Intelligent household will let users have a more convenient means to management of domestic equipment, for example, through the house, wireless remote control, touch screen phone and Internet or speech recognition control household devices, more can perform scene operation, make more equipment form linkage. In this paper, we propose the intelligent household various kinds of equipment within each other can communication, do not need to user command according to different state interactive operation, thus to bring the greatest degree of user efficient and convenient, comfortable and safe.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.2875-2893
• /
• 2015

Existing coding aware routing algorithms focused on novel routing metric design that captures the characteristics of network coding. However, in packet coding algorithm, they use opportunistic coding scheme which didn't consider the queue state of the coding node and are equivalent to the conventional store-and-forward method in light traffic load condition because they never delay packets and there are no packets in the output queue of coding node, which results in no coding opportunity. In addition, most of the existing algorithms assume that all flows participating in the network have equal rate. This is unrealistic since multi-rate environments are often appeared. To overcome above problem and expand network coding to light traffic load scenarios, we present an enhanced coding-aware routing algorithm based on queue state and local topology (OQMCAR), which consider the queue state of coding node in packet coding algorithm where the control policy is of threshold-type. OQMCAR is a unified framework to merge single rate case and multiple rate case, including the light traffic load scenarios. Simulations results show that our scheme can achieve higher throughput and lower end-to-end delay than the current mechanisms using COPE-type opportunistic coding policy in different cases.