• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.1035-1037
• /
• 2009

Common to use fixed-node sensor network and wireless sensor networks, unlike the recent move of the node happens frequently. These wireless sensor networks by taking into account the mobility of sensor nodes dynamically self-configurable routing protocol is required. In this paper, a fixed-node configuration and energy efficiency in the self-LEACH protocol is based on the useful movement of the nodes of the cluster is dynamically self-configuring routing protocols offer M-LEACH.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1256-1275
• /
• 2014

As one of the new self-organizing and self-configuration broadband networks, wireless mesh networks are being increasingly attractive. In order to solve the load balancing problem in wireless mesh networks, this paper proposes a novel multi-path routing algorithm based on clustering (Cluster_MMesh) for wireless mesh networks. In the clustering stage, on the basis of the maximum connectivity clustering algorithm and k-hop clustering algorithm, according to the idea of maximum connectivity, a new concept of node connectivity degree is proposed in this paper, which can make the selection of cluster head more simple and reasonable. While clustering, the node which has less expected load in the candidate border gateway node set will be selected as the border gateway node. In the multi-path routing establishment stage, we use the intra-clustering multi-path routing algorithm and inter-clustering multi-path routing algorithm to establish multi-path routing from the source node to the destination node. At last, in the traffic allocation stage, we will use the virtual disjoint multi-path model (Vdmp) to allocate the network traffic. Simulation results show that the Cluster_MMesh routing algorithm can help increase the packet delivery rate, reduce the average end to end delay, and improve the network performance.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.5
• /
• pp.9-17
• /
• 2013

This paper presents the design of the educational router system. This system is designed and implemented to support network configuration and embedded programming technology of the user on Internet. Not only Static routing protocol but also a kind of dynamic routing protocols such as OSPF and RIP and firewall have been programmed for education based on ethernet interface. ADS 1.2 as debugging environment, uC/OS-ii as RTOS and C language as development language are used. The educational procedures is compile, loading of static routing protocol, a kind of dynamic routing protocols such as OSPF and RIP and firewall program already supplied. Thereafter the verification is checked by using "ping" test to allow for demo operation such as hands-on training procedure. Finally programming procedure similar with demo operation of static routing protocol, a kind of dynamic routing protocols such as OSPF and RIP and packet filtering function is educated step by step.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.12
• /
• pp.1720-1725
• /
• 2019

In this paper, we consider the efficiency of the scheme for for routing summary algorithms in discontiguous networks. Router than updating and transmitting the entire subnet information in the routing protocol, only the shortened update information is sent and the routing table is shortened to make the router resources more efficient and improve network stability and performance. However, if a discontiguous network is formed in the network design process, a problem arises due to the network contraction function and does not bring about the result of fundamental router efficiency. Using different major networks subnets one major network, causing problems in communication and routing information exchange if the configuration is incorrect. The algorithm proposed in this paper removes only the auto-summary algorithm from the existing algorithm, which increases the complexity and stability of the routing table and reduces the CPU utilization of network equipment from 16.5% to 6.5% Confirmed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.2
• /
• pp.378-384
• /
• 2008

The sensor network for the health care application service has the man or movable object as the main sensing object. In order to support inter-node interaction by the movement of such sensing objects, the node's dynamic function modification, dynamic self-configuration and energy efficiency must be considered. In this paper, the Agilla model which supports the dynamic function modification through the agent migration between nodes and LEACH protocol which guarantees the dynamic self-configuration and energy efficiency through the configuration of inter-node hierarchical cluster configuration are analyzed. Based on the results of the analysis, the Mobility Agent Middleware which supports the dynamic function modification between nodes is designed, and LEACH_Mobile protocol which guarantees the node nobility as the weakness of the existing LEACH protocol is suggested. Also, the routing module which supports the LEACH_Mobile protocol is designed and the interface for conjunction with Mobility Agent Middleware is designed. Then, it is definitely increase performance which un mobility node of transfer data rate through LEACH_Mobile protocol of simulation result.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.11
• /
• pp.2441-2446
• /
• 2009

Wireless Sensor Network collects a data from the specific area and the control is composed of small sensor nodes. Like this sensors to after that is established at the beginning are operated with the battery, the operational duration until several years must be continued from several months and will be able to apply the resources which is restricted in efficiently there must be. In this paper RHC (rounting history cache) applies in Directed Diffusion which apply a data central concept a reliability and an efficiency in data transfer course set. RHC algorithms which proposes each sensor node updated RHC of oneself with periodic and because storing the optimization course the course and, every event occurrence hour they reset the energy is wasted the fact that a reliability with minimization of duplication message improved.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.1018-1021
• /
• 2009

Wireless Sensor Network collects a data from the specific area and the control is composed of small sensor nodes. Like this sensors to after that is established at the beginning are operated with the battery, the operational duration until several years must be continued from several months and will be able to apply the resources which is restricted in efficiently there must be. In this paper RHC (rounting history cache) applies in Directed Diffusion which apply a data central concept a reliability and an efficiency in data transfer course set. RHC algorithms which proposes each sensor node updated RHC of oneself with periodic and because storing the optimization course the course and, every event occurrence hour they reset the energy is wasted the fact that a reliability with minimization of duplication message improved.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.4
• /
• pp.500-509
• /
• 1999

In this paper, we consider an optimal routing problem when point-to-point and point-to-multipoint connection traffics are offered in an ATM network. We propose a mathematical model for cost-minimizing configuration of a logical network for a given ATM-based BISDN. Our model is essentially identical to the previous one proposed by Kim(Kim, 1996) which finds a virtual-path configuration where the relevant gains obtainable from the ATM technology such as the statistical multiplexing gain and the switching/control cost-saving gain are optimally traded-off. Unlike the Kim's model, however, ours explicitly considers the VP's QoS(Quality of Service) for more efficient utilization of bandwidth. The problem is a large-scale, nonlinear, and mixed-integer problem. The proposed algorithm is based on the local linearization of equivalent-capacity functions and the relaxation of link capacity constraints. As a result, the problem can be decomposed into moderate-sized shortest path problems, Steiner arborescence problems, and LPs. This fact renders our algorithm a lot faster than the previous nonlinear programming algorithm while the solution quality is maintained, hence application to large-scale network problems.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.489-491
• /
• 2009

Recently, a range of diverse networks are undergoing speedy evolution and inspiring variety applications. Among many networks, mobile Ad-Hoc networks (MANETs) are active working with a part of routing protocols. But, the majority of routing protocols have required a unique identifier, such as an IP address. At this while, IP address assignment scheme in MANET remains unsolved. When a centralized agent server is not exist, IP address is an critical issue such as a single MANET. This paper look over previous work about basic principles, also we suggest simple solution to overcome the power of two ($2^m$).

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.5
• /
• pp.737-748
• /
• 1995

In this paper, we studyed the variables in the design of multichip memory modules with 4M$\times$1bit DRAM chips to construct high capacity and high speed memory modules. The configuration of the module was 8 bit, 16 bit, and 32 bit DRAM modules with employing 0.6 W, 70 nsec 4M$\times$1 bit DRAM chips. We optimized routing area and wiring density by performing the routing experiment with the variables of the chip allocation, module I/O terminal, the number of wiring, and the number of mounting side of the chips. The multichip module was designed to be able to accept MCM-L techiques and low cost PCB materials. The module routing experiment showed that it was an efficient way to align chip I/O terminals and module I/O terminals in parallel when mounting bare chips, and in perpendicular when mounting packaged chips, to set module I/O terminals in two sides, to use double sided substrates, and to allocate chips in a row. The efficient number of wiring layer was 4 layers when designing single sided bare chip mounting modules and 6 layers when constructing double sided bare chip mounting modules whereas the number of wiring layer was 3 layers when using single sided packaged chip mounting substrates and 5 layers when constructing double sided packaged chip mounting substrates. The most efficient configuration was to mount bare chips on doubled substrates and also to increase the number of mounting chips. The fabrication of memory multichip module showed that the modules with bare chips can be reduced to a half in volume and one third in weight comparing to the module with packaged chips. The signal propagation delay time on module substrate was reduced to 0.5-1 nsec.