• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10A
• /
• pp.972-979
• /
• 2008

Two-way relay channel is a bidirectional cooperative communication channel that two terminals communicate each other with the help of a relay. In the previous cooperative communication schemes, a relay uses two divided resources for bidirectional transmission. When a network coding is used at a relay, the relay can transmit bidirectional data to two terminals simultaneously using one resource only. Thus the throughput of this scheme is greater than that of the previous scheme. In this paper, we showa two-way cooperative ARQ protocol using network coding and the throughput of this protocol is analyzed using a state diagram.

• Journal of Information Processing Systems
• /
• v.8 no.1
• /
• pp.175-190
• /
• 2012

Shuffling is an effective method to build a publicly verifiable mix network to implement verifiable anonymous channels that can be used for important cryptographic applications like electronic voting and electronic cash. One shuffling scheme by Groth is claimed to be secure and efficient. However, its soundness has not been formally proven. An attack against the soundness of this shuffling scheme is presented in this paper. Such an attack compromises the soundness of the mix network based on it. Two new shuffling protocols are designed on the basis of Groth's shuffling and batch verification techniques. The first new protocol is not completely sound, but is formally analyzed in regards to soundness, so it can be applied to build a mix network with formally proven soundness. The second new protocol is completely sound, so is more convenient to apply. Formal analysis in this paper guarantees that both new shuffling protocols can be employed to build mix networks with formally provable soundness. Both protocols prevent the attack against soundness in Groth's scheme. Both new shuffling protocols are very efficient as batch-verification-based efficiency-improving mechanisms have been adopted. The second protocol is even simpler and more elegant than the first one as it is based on a novel batch cryptographic technique.

• Journal of Communications and Networks
• /
• v.15 no.4
• /
• pp.422-429
• /
• 2013

Advances in wireless sensor network (WSN) technology have enabled small and low-cost sensors with the capability of sensing various types of physical and environmental conditions, data processing, and wireless communication. In the WSN, the sensor nodes have a limited transmission range and their processing and storage capabilities as well as their energy resources are limited. A triple umpiring system has already been proved for its better performance in WSNs. The clustering technique is effective in prolonging the lifetime of the WSN. In this study, we have modified the ad-hoc on demand distance vector routing by incorporating signal-to-noise ratio (SNR) based dynamic clustering. The proposed scheme, which is an efficient and secure routing protocol for wireless sensor networks through SNR-based dynamic clustering (ESRPSDC) mechanisms, can partition the nodes into clusters and select the cluster head (CH) among the nodes based on the energy, and non CH nodes join with a specific CH based on the SNR values. Error recovery has been implemented during the inter-cluster routing in order to avoid end-to-end error recovery. Security has been achieved by isolating the malicious nodes using sink-based routing pattern analysis. Extensive investigation studies using a global mobile simulator have shown that this hybrid ESRP significantly improves the energy efficiency and packet reception rate as compared with the SNR unaware routing algorithms such as the low energy aware adaptive clustering hierarchy and power efficient gathering in sensor information systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1A
• /
• pp.28-36
• /
• 2005

Wireless Sensor Networks are the technology, in which various applications such as surveillance and information gathering are possible in the uncontrollable area of human. And numerous studies are being processed for the application of ubiquitous network environment. One of major issues in sensor network is the research for prolonging the lifetime of nodes through the use of various algorithms, suggested in the mac and routing layer. In this paper, aiming at reducing energy waste, caused by redundant transmission and receipt message, we propose the mac protocol using active signal and analysis performance through simulation.

• Imaging Science in Dentistry
• /
• v.48 no.1
• /
• pp.41-44
• /
• 2018

Purpose: To evaluate the effect of different numbers of basis images and the use of metal artifact reduction (MAR) on the production and reduction of artifacts in cone-beam computed tomography images. Materials and Methods: An acrylic resin phantom with a metal alloy sample was scanned, with 450 or 720 basis images and with or without MAR. Standard deviation values for the test areas (around the metal object) were obtained as a way of measuring artifact production. Two-way analysis of variance was used with a 5% significance level. Results: There was no significant difference in artifact production among the images obtained with different numbers of basis images without MAR (P=.985). MAR significantly reduced artifact production in the test areas only in the protocol using 720 basis images (P=.017). The protocol using 450 basis images with MAR showed no significant difference in artifact production when compared to the protocol using 720 basis images with MAR (P=.579). Conclusion: Protocols with a smaller number of basis images and with MAR activated are preferable for minimizing artifact production in tomographic images without exposing the patient to a greater radiation dose.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.14 no.3
• /
• pp.197-206
• /
• 1989

In this paper, we represent an improved algorithm of performance evaluation for communication protocol. It is an algorithm that analyzes Extended Timed Perti Net models including time which have been successfully used to model and evaluate the performance of distributed system. While Timed Petri Nets generally limted to free-choice and safe nets, our algorithm permits the construnction of elegant models of restricted concurrent processing. Furthermore, to reduce the state space size of Timed Reachability Graph, we improve the algorithm by using Maximum Firing Rule and sets of simultaneously firing transitions. Procedures for constructing of Timed Reachability Graphs and analyzing are presented, and we demonstrate the usefulness of this algorithm by applying it to the analysis of the communication protocol.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.951-954
• /
• 2005

IMPP service has been a promising technology as Internet grows fast and the requirements are increasing. IETF standardize requirements, model and data format for IMPP service via IMPP WG and SIMPLE WG. In this paper, we analysis SIMPLE WG in IETF and design consideration of XCAP server for IMPP services based on SIP.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.105-108
• /
• 2005

To support abruptly increasing data traffic in these days. network management is needed. And also to maintain the steady infra, there is MPLS need which can support traffic engineering. It's necessary that MPLS doesn't only manage network to support recently booming data traffic, but has capacity to support traffic engineering to keep static infrastructure. Traffic engineering, method that a large-scale user shifts traffic to the beforehand designated routes that pass through specific nodes on network, is operation that is mapping traffic flow to the physical network topology. In this paper, we supplement the defect of the traditional RSVP traffic engineering and to construct far more steady infra, we suggest the way of its development of ERSVP signaling protocol.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.8 no.6
• /
• pp.1410-1418
• /
• 2007

This paper analyzes the throughput of DCF protocol at the MAC layer in the 802.11a wireless LAN. The throughput of DCF protocol is related on probability of backoff, depends on retransmission of each terminal. This paper applied to nonmarcov discrete model for each terminal BER in the base station versus the packet throughput is progressing with the data rate of 6,12,24,54 Mbps, We find the fact that the less the data rate be the higher the throughput. We also find from the throughput calculation by means of traffic intensity in OFDM wireless LAN.

• Journal of Communications and Networks
• /
• v.11 no.3
• /
• pp.287-296
• /
• 2009

Although asymptotic bounds of wireless network capacity have been heavily pursued, the answers to the following questions are still critical for network planning, protocol and architecture design: Given a three-dimensional (3D) network space with the number of active users randomly located in the space and using the wireless communication technology, what are the expected per-flow throughput, network capacity, and network transport capacity? In addition, how can the protocol parameters be tuned to enhance network performance? In this paper, we focus on the ultra wideband (UWB) based wireless personal area networks (WPANs) and provide answers to these questions, considering the salient features of UWB communications, i.e., low transmission/interference power level, accurate ranging capability, etc. Specifically, we demonstrate how to explore the spatial multiplexing gain of UWB networks by allowing appropriate concurrent transmissions. Given 3D space and the number of active users, we derive the expected number of concurrent transmissions, network capacity and transport capacity of the UWB network. The results reveal the main factors affecting network (transport) capacity, and how to determine the best protocol parameters, e.g., exclusive region size, in order to maximize the capacity. Extensive simulation results are given to validate the analytical results.