• The KIPS Transactions:PartC
• /
• v.12C no.5 s.101
• /
• pp.623-632
• /
• 2005

In ad-hoc network, there is no fixed infrastructure such as base stations or mobile switching centers. The security of ad-hoc network is more vulnerable than traditional networks because of the basic characteristics of ad-hoc network, and current muting protocols for ad-hoc networks allow many different types of attacks by malicious nodes. Malicious nodes can disrupt the correct functioning of a routing protocol by modifying routing information, by fabricating false routing information and by impersonating other nodes. We propose a routing suity mechanism based on one-time digital signature. In our proposal, we use one-time digital signatures based on one-way hash functions in order to limit or prevent attacks of malicious nodes. For the purpose of generating and keeping a large number of public key sets, we derive multiple sets of the keys from hash chains by repeated hashing of the public key elements in the first set. After that, each node publishes its own public keys, broadcasts routing message including one-time digital signature during route discovery and route setup. This mechanism provides authentication and message integrity and prevents attacks from malicious nodes. Simulation results indicate that our mechanism increases the routing overhead in a highly mobile environment, but provides great security in the route discovery process and increases the network efficiency.

• The KIPS Transactions:PartC
• /
• v.13C no.5 s.108
• /
• pp.627-634
• /
• 2006

Overlay network eliminates the need to change the application-layer tree when the underlying network changes and enables the overlay network to survive in environments where nonmember nodes do not support multicast functionality. An overlay protocol monitors group dynamics, while underlying unicast protocols track network dynamics, resulting in more stable protocol operation and low control overhead even in a highly dynamic environment. But, if overlay multicast protocols does not know the location information of node, this makes it very difficult to build an efficient multicasting tree. So, we propose a Hierarchical Overlay Multicast Architecture (HOMA) with the location information. Because proposed architecture makes static region-based dynamic group by multicast members, it is 2-tired overlay multicasts of application layer that higher layer forms overlay multicast network between members that represent group, and support multicast between multicast members belonging to region at lower layer. This use GPS, take advantage of geographical region, and realizes a region-sensitive higher layer overlay multicast tree which is impervious to the movements of nodes. The simulation results show that our approach solves the efficiency problem effectively.

• The KIPS Transactions:PartC
• /
• v.14C no.6
• /
• pp.519-524
• /
• 2007

One of the most important issues on the sensor network with resource limited sensor nodes is prolonging the network lifetime by effectively utilizing the limited node energy. The most representative mechanism to achieve a long lived sensor network is the clustering mechanism which can be further classified into the single hop mode and the multi hop mode. The single hop mode requires that all sensor nodes in a cluster communicate directly with the cluster head(CH) via single hop md, in the multi hop mode, sensor nodes communicate with the CH with the help of other Intermediate nodes. One of the most critical factors that impact on the performance of the existing multi hop clustering mechanism is the cluster size and, without the assumption on the uniform node distribution, finding out the best cluster size is intractable. Since sensor nodes in a real sensor network are distributed non uniformly, the fixed size mechanism may not work best for real sensor networks. Therefore, in this paper, we propose a new dynamic size multi hop clustering mechanism in which the cluster size is determined according to the distance from the sink to relieve the traffic passing through the CHs near the sink. We show that our proposed scheme outperforms the existing fixed size clustering mechanisms by carrying out numerical analysis and simulations.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.947-960
• /
• 1996

The primary goal for developing high performance ATM switching systems is to minimized the probability of cell loss, cell delay and deterioration of throughput. ATM switching element that is the most suitable for this purpose is the shared buffer memory switch executed by common random access memory and control logic. Since it is difficult to manufacture VLIS(Very Large Scale Integrated circuit) as the number of input ports increased, the used of switching module method the realizes 32$\times$32, 150 Mb/s switch utilizing 8$\times$8, 600Mb/s os 16$\times$16, 150Mb/s unit switch is latest ATM switching technology for small and large scale. In this paper, buffer capacity satisfying total-memory-reduction effect by buffer sharing in a shared buffer memory switch are analytically evalu ated and simulated by computer with cell loss level at traffic conditions, and also features of switching network utilizing the switching module methods in small and large-capacity ATM switching system is analized. Based on this results, the structure in outline of 32$\times$32(4.9Gb/s throughput), 150Mb/s switches under research in many countries is proposed, and eventually, switching-network structure for ATM switching system of small and large and capacity satisfying with above primary goals is suggested.

• Journal of KIISE:Information Networking
• /
• v.35 no.6
• /
• pp.497-509
• /
• 2008

Various algorithms and architectures for efficient packet classification have been widely studied. Packet classification algorithms based on a decision tree structure such as HiCuts and HyperCuts are known to be the best by exploiting the geometrical representation of rules in a classifier. However, the algorithms are not practical since they involve complicated heuristics in selecting a dimension of cuts and determining the number of cuts at each node of the decision tree. Moreover, the cutting is not efficient enough since the cutting is based on regular interval which is not related to the actual range that each rule covers. In this paper, we proposed a new efficient packet classification algorithm using a range cutting. The proposed algorithm primarily finds out the ranges that each rule covers in 2-dimensional prefix plane and performs cutting according to the ranges. Hence, the proposed algorithm constructs a very efficient decision tree. The cutting applied to each node of the decision tree is optimal and deterministic not involving the complicated heuristics. Simulation results for rule sets generated using class-bench databases show that the proposed algorithm has better performance in average search speed and consumes up to 3-300 times less memory space compared with previous cutting algorithms.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.3
• /
• pp.662-668
• /
• 2018

Most electric rooms are located in the underground spaces of buildings. When a fire occurs in electrical equipment, the fire expands to cable insulation material, resulting in toxic smoke and combustion products. If the smoke and combustion products quickly move vertically and horizontally, the evacuation of occupants and firefighting activities will be hindered. Therefore, it is necessary to design optimal equipment for smoke control in cases of fires in electric rooms. This study analyzes the characteristics of smoke and combustion products in fires in a cubicle-type switchboard in an electric room using PyroSim, which is based on the program Fire Dynamics Simulator (FDS). The fire modeling consists of four scenarios according to the operation mode of the mechanical ventilation equipment, the amount of air supply and exhaust, and the location of the air supply slot. The analysis shows that the mechanical ventilation equipment improves the smoke density, visibility, carbon monoxide concentration, and temperature characteristics. The visibility and temperature characteristics were improved when the air flow rate and the location of the air supply slot from fire defense regulations were applied.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.3 no.4
• /
• pp.795-804
• /
• 1999

The increasing number of users of mobile communication systems and the corresponding need for increased system capacity require the use of a modulation scheme which is both power and spectrally efficient. In this paper, we numerically calculate the BER performance of DS/CDMA-BPSK system in different fading channel (Rayleigh, Rician, Shadow Rician). Also, we calculate BER performance and the channel capacity of DS/CDMA-BPSK system which is constant or nearly constant envelopes in 3-state fading channel model. The Shadow Rician fading model described in this paper apply the parameters of the Canadian Mobile Satellite (MSAT). And we assume that the 3-state fading channel model is consist of Rayleigh fading state, Rician fading state, and shadow Rician fading state. This model can be used as a basis for the simulation of the land mobile satellite channel. The dynamic 3-state fading channel model is considered corresponding to different environments and the transitions between these environments. From the numerically calculate results, the DS/CDMA-BPSK system with MUI-20, PG-511 can not achieve the BER performance ($P_b\leq10^{-5}$). And the channel capacity did not meet the system requirement. Also, we know that the BER performance is depend m the occupancy probability of radio channel and the degree of shadow. From the results, we how that during shadowed time intervals it is necessary to use some form of error control coding and receiver diversity in order to support reliable data communication.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.4 no.1
• /
• pp.26-34
• /
• 1999

According to increase of nonlinear power electronics equipment, active power filters have been researched and developed for many years to compensate harmonic disturbances and reactive power. However the commercial of active power filter is being proceeded slowly, because the cost of active power filter compared to the passive filter for harmonic and reactive power compensation is expensive. Especially, the use of DSP (Digital Signal Processing) chip, which is frequently used to control 3-phase active power filter, is a factor of increasing the cost of active power filters. On the other hand, the use of only analog controller makes the controller's circuits much more complicate and depreciates the flexibilities of controller. In this paper, a controller with low cost for 5[kVA] 3-phase active power filter system is designed. To reduce the expense of active filter system, the presented controller is composed of digital control part using Intel 80C196KC $\mu$P and analog control part using hysteresis controller for current control. Characteristic analysis of designed controller for active filter system is performed by computer simulation and compensating characteristics of the designed controller are verified by experiment.tegy can apply to the vector control, leading to better output torque capability in the ac motor drive system. This strategy is that in the overmodulation range, the d-axis output current is given a priority to regulate the flux well, instead the q-axis output curent is sacrificed. Therefore, the vector control even in the overmodulation PWM operation can be achieved well. For this purpose, the d-axis output voltage of a current controller to control the flux is conserved. the q-axis output voltage to control the torque is controlled to place the reference voltage vector on the hexagon boundary in case of the overmodulation. The validity of the proposed overall scheme is confirmed by simulation and experiments for a 22[kW] induction motor drive system.

• The KIPS Transactions:PartA
• /
• v.13A no.1 s.98
• /
• pp.45-52
• /
• 2006

To perform on-line maintenance for Distributed Information System, it is indispensable to disseminate files to participant nodes in the network. When users' requests for file deployment occur simultaneously in a short period a deployment server falls into overload phase, which is often called Flash Crowds. h common solution to avoid Flash Crowds is to increase hardware capacity. In this paper, we propose a software solution based on P2P, which does not cost any additional expense. In the proposed solution, nodes in the network are grouped into subnetworks one of which is composed of only neighboring nodes. In each subnetwork, copies of deployment files can be transferred to each other. Consequently, it brings about the effect of load balancing in deployment server. To raise the effectiveness, target files for deployment are packed into one package. Before being transferred, each package is divided into multiple equal-sized segments. A deployment server in a normal phase transmits a package requested from nodes in segment units. However a deployment server is overloaded, if segments already exist in the subnetwork participant nodes in the subnetwork receive necessary segments from neighboring nodes. In this paper, we propose data structures and algorithm for this approach and show performance improvement through simulation.

• The KIPS Transactions:PartC
• /
• v.14C no.2
• /
• pp.139-146
• /
• 2007

Mobile Sensor Network(MSN) is actively studied due to the advent of mobile sensors such as Robomote and Robotic Sensor Agents(RSAs), However, existing studies on MSN have mainly focused on coverage hole problem which occurs in Stationary Sensor Network(SSN). To address coverage hole problem, these studies make mobile sensors move temporarily so that they do not make the best use of the mobility of mobile sensors, Thus, a mechanism utilizing the continuous movement of mobile sensors is proposed to improve the network coverage performance. However, this mechanism is presently immature and does not explain how to make routing path and send data from mobile sensors to a sink node, Therefore, to efficiently make routing path and send data from mobile sensors to a sink node, we propose a communication protocol for mobile sensor network where mobile sensors continuously move. The proposed protocol deploys not only mobile sensors but also stationary sensors which send sensing data to a sink node instead of mobile sensors. Simulation results show that the proposed protocol improves the performance in terms of network coverage and traffic overhead, compared to conventional SSN protocols.