• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.3
• /
• pp.68-74
• /
• 2008

Ethernet is the very successful technology in private local area network. Therefore, we can obtain the advantage to reduce network overhead due to such as protocol translation when to apply Ethernet to the public backbone network. However, in order to do that, it is required to restore the network within 50msec when link failure occurs, in order to provide seamless connections to end users. Currently, ITU-T standardized the automatic protection switching (APS) based Ethernet protection switching system. In this paper, we propose the improved Ethernet protection switching system to minimize the number of Ethernet frames lost when the network is restored from the failure. The proposed mechanism is analyzed by using simulation based on ns-2 and numerical results show that the proposed one provides superior performance.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.64-75
• /
• 2007

Service discovery protocols is software components to find specific services or resources on network. The SLP defined by IETF protocol is a framework for automatic service discovery on IP based networks. Automatic service discovery is an important component on ubiquitous computing environment. This paper proposes a service discovery architecture named as SLPA(Service Location Protocol based on AMAAM). AMAAM(Mobility Agent Advertisement Mechanism) is an aggregation-based Mobile IP implementation in MANET. In SLPA, the role of the directory agent is assigned to the mobility agent in AMAAM. The mobility agent periodically beacons an advertisement message which contains both the advertisement of the directory agent in SLP and the advertisement of the mobility agent in Mobile IP. For evaluating the functional correctness of SLPA and the overhead of maintaining a service directory of SLPA. We simulate SLPA using ns-2 and analyze the overhead of control overheads for the aggregation. Through the simulation experiments we show the functional correctness of the proposed architecture and analyze the performance results.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.99-109
• /
• 2007

IEEE 802.lie is being proposed to improve QoS by IEEE 802.11 working group. HCCA (HCF Controlled Channel Access) a centralized polling based mechanism of IEEE 802.11e, needs a scheduling algorithm that decides on how the available radio resources are allocated to the polled STAs. In IEEE 802.l1e standard Reference Scheduler is presented. Reference Scheduler Polls all STAs in a polling list by the same interval that causes ineffectively frequent polling. It increases not only the overhead but it decreases the TXOP (Transmission Opportunity) utilization. In this paper, we propose the scheduling and admission control algorithm that poll stations depending on the MSI (Maximum Service Interval)o( stations to solve these shortcomings. In our proposed algorithm a station is polled by an interval close to its MSI, so polling overhead decrease and TXOP utilization increases than Reference Scheduler. Simulation results show that our algorithm outperforms Reference Scheduler. Our algorithm maintains higher aggregate throughput and services mere stations than Reference Scheduler.

• Bulletin of the Korean Chemical Society
• /
• v.35 no.8
• /
• pp.2494-2504
• /
• 2014

P38 mitogen activated protein (MAP) kinase is an important anti-inflammatory drug target, which can be activated by responding to various stimuli such as stress and immune response. Based on the conformation of the conserved DFG loop (in or out), binding inhibitors are termed as type-I and II. Type-I inhibitors are ATP competitive, whereas type-II inhibitors bind in DFG-out conformation of allosteric pocket. It remains unclear that how these allosteric inhibitors stabilize the DFG-out conformation and interact. Organosilicon compounds provide unusual opportunity to enhance potency and diversity of drug molecules due to their low toxicity. However, very few examples have been reported to utilize this property. In this regard, we performed docking of an inhibitor (BIRB) and its silicon analog (Si-BIRB) in an allosteric binding pocket of p38. Further, molecular dynamics (MD) simulations were performed to study the dynamic behavior of the simulated complexes. The difference in the biological activity and mechanism of action of the simulated inhibitors could be explained based on the molecular mechanics/generalized Born surface area (MM/GBSA) binding free energy per residue decomposition. MM/GBSA showed that biological activities were related with calculated binding free energy of inhibitors. Analyses of the per-residue decomposed energy indicated that van der Waals and non-polar interactions were predominant in the ligand-protein interactions. Further, crucial residues identified for hydrogen bond, salt bridge and hydrophobic interactions were Tyr35, Lys53, Glu71, Leu74, Leu75, Ile84, Met109, Leu167, Asp168 and Phe169. Our results indicate that stronger hydrophobic interaction of Si-BIRB with the binding site residues could be responsible for its greater binding affinity compared with BIRB.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.3
• /
• pp.55-62
• /
• 2014

This paper has proposed Hybrid QoS Routing Link State Update(LSU) Algorithm that has had a both advantage of LSU message control in periodic QoS routing LSU algorithm and QoS routing performance in adaptive LSU algorithm. Hybrid LSU algorithm can adapt the threshold based network traffic information and has the mechanism that calculate LSU message transmission priority using the flow of statistical request bandwidth and available bandwidth and determine the transmission of the message according to update rate per a unit of time. We have evaluated the performance of the proposed algorithm and the existing algorithms on MCI simulation network using the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm that it can diminish to 10% of the LSU message count.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.6
• /
• pp.2160-2179
• /
• 2015

In many Radio Frequency Identification (RFID) applications, the reader recognizes the tags within its scope repeatedly. For these applications, some algorithms such as the adaptive query splitting algorithm (AQS) and the novel semi-blocking AQS (SBA) were proposed. In these algorithms, a staying tag retransmits its ID to the reader to be identified, even though the ID of the tag is stored in the reader's memory. When the length of tag ID is long, the reader consumes a long time to identify the staying tags. To overcome this deficiency, we propose a slot allocated blocking anti-collision algorithm (SABA). In SABA, the reader assigns a unique slot to each tag in its range by using a slot allocation mechanism. Based on the allocated slot, each staying tag only replies a short data to the reader in the identification process. As a result, the amount of data transmitted by the staying tags is reduced greatly and the identification rate of the reader is improved effectively. The identification rate and the data amount transmitted by tags of SABA are analyzed theoretically and verified by various simulations. The simulation and analysis results show that the performance of SABA is superior to the existing algorithms significantly.

• Journal of Internet Computing and Services
• /
• v.11 no.2
• /
• pp.1-15
• /
• 2010

The damage of safety accidents at home can be minimized by preventing accidents in advance as well as by coping with the accidents promptly through the help of safety management system. In this paper, we identify several services to prevent and cope with the accidents that may occur at home by leveraging sensors and wireless network technology available at home network environments. In order to provide these services, we propose a context-aware system for safety management at home. The proposed system awares the dangerous situations through the information collected by the sensors in home network environment. The proposed system tries to not only prevent the accidents but also to cope with the situations using the information of rescue targets and the location where the accident occurs. We evaluate the appropriateness of sensors by implementing the proposed environments. Through OPNET simulation experiments, we also measure the amount of network traffic in order to confirm that the bandwidth of IEEE 802.15.4 is enough for the proposed system. Finally, we determine more appropriate wireless data transmission mechanism with respect to the end-to-end delay and battery consumption for the proposed system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.227-247
• /
• 2018

For intermittently connected wireless sensor networks deployed in hash environments, sensor nodes may fail due to internal or external reasons at any time. In the process of data collection and recovery, we need to speed up as much as possible so that all the sensory data can be restored by accessing as few survivors as possible. In this paper a novel redundant data storage algorithm based on minimum spanning tree and quasi-randomized matrix-QRNCDS is proposed. QRNCDS disseminates k source data packets to n sensor nodes in the network (n>k) according to the minimum spanning tree traversal mechanism. Every node stores only one encoded data packet in its storage which is the XOR result of the received source data packets in accordance with the quasi-randomized matrix theory. The algorithm adopts the minimum spanning tree traversal rule to reduce the complexity of the traversal message of the source packets. In order to solve the problem that some source packets cannot be restored if the random matrix is not full column rank, the semi-randomized network coding method is used in QRNCDS. Each source node only needs to store its own source data packet, and the storage nodes choose to receive or not. In the decoding phase, Gaussian Elimination and Belief Propagation are combined to improve the probability and efficiency of data decoding. As a result, part of the source data can be recovered in the case of semi-random matrix without full column rank. The simulation results show that QRNCDS has lower energy consumption, higher data collection efficiency, higher decoding efficiency, smaller data storage redundancy and larger network fault tolerance.

• Journal of the Korean Society for Nondestructive Testing
• /
• v.28 no.1
• /
• pp.9-15
• /
• 2008

A new ECT probe to separate the ECT signal distortion due to PVC (permeability variation clusters) and ordinary defects created in SG tubes has been developed. The hystersis loops of PVC which are extracted from retired SG (steam generator) tubes of Kori-1 NNP were measured. The tensile tests were performed to identify the mechanism of PVC creation. The conditions detecting the PVC created in 56 tubes were investigated using computer simulation, and the signal processing circuits were inserted in the probe for the digital signal transmission. The new Probe can measure and separate the PVC signal which is created in the SG tubes, and also measures the defects in Ni-sleeving part of SG tubes. furthermore the new ECT probe can measure the defects as fast as bobbin probe, and enhance the testing speed as well as reliability of the defect detection of SG tubes.

• The Korean Journal of Applied Statistics
• /
• v.21 no.3
• /
• pp.361-375
• /
• 2008

We propose proper methods to impute the item nonresponse in 4-8-4 rotation sample survey. We consider nonignorable nonresponse mechanism that can happen when survey deals with sensitive question (e.g. income, labor force). We utilize modeling imputation method based on Bayesian approach to avoid a boundary solution problem. We also estimate a interview time bias using imputed data and calculate cell expectation and marginal probability on fixed time after removing estimated bias. We compare the mean squared errors and bias between maximum likelihood method and Bayesian methods using simulation studies.