Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of Korean Institute of Industrial Engineers
Journal Basic Information
Journal DOI :
Korean Institute of Industrial Engineers
Editor in Chief :
Volume & Issues
Volume 34, Issue 4 - Dec 2008
Volume 34, Issue 3 - Sep 2008
Volume 34, Issue 2 - Jun 2008
Volume 34, Issue 1 - Mar 2008
Selecting the target year
Performance and Robustness of Control Charting Methods for Autocorrelated Data
Chin, Chang-Ho ; Apley, Daniel W. ;
Journal of Korean Institute of Industrial Engineers, volume 34, issue 2, 2008, Pages 122~139
With the proliferation of in-process measurement technology, autocorrelated data are increasingly common in industrial SPC applications. A number of high performance control charting techniques that take into account the specific characteristics of the autocorrelation through time series modeling have been proposed over the past decade. We present a survey of such methods and analyze and compare their performances for a range of typical autocorrelated process models. One practical concern with these methods is that their performances are often strongly affected by errors in the time series models used to represent the autocorrelation. We also provide some analytical results comparing the robustness of the various methods with respect to time series modeling errors.
Study of Dynamic Polling in the IEEE 802.11 PCF
Kim, Che-Soong ; Lyakhov, Andrey ;
Journal of Korean Institute of Industrial Engineers, volume 34, issue 2, 2008, Pages 140~150
Point Coordination Function (PCF) of the IEEE 802.11 protocol providing a centrally-controlled polling-based multiple access to a wireless channel is very efficient in high load conditions. However, its performance degrades with increasing the number of terminals and decreasing the load, because of wastes related to unsuccessful polling attempts. To solve the problem, we propose and study analytically the generic dynamic polling policy using backoff concept. For this aim, we develop Markov models describing the network queues changes, what allows us to estimate such performance measures as the average MAC service time and the average MAC sojourn time, to show the dynamic polling efficiency and to tune optimally the backoff rule.
Performance Evaluation of Distance-based Registration Considering Cell-by-Cell Location Area
Baek, Jang-Hyun ; Park, Jin-Won ;
Journal of Korean Institute of Industrial Engineers, volume 34, issue 2, 2008, Pages 151~159
An efficient location registration scheme is essential to accommodate continuously increasing mobile subscribers and to offer a variety of multimedia services with good quality. In this study, we consider a distance-based registration scheme where the number of location areas varies on the basis of cell-by-cell, not of ring-by-ring, to analyze the optimal size of the location area. Using our proposed cell-by-cell distance-based registration scheme with random walk mobility model, we analyze a variety of circumstances to obtain the optimal number of cells for location area that minimizes total signaling traffic on radio channels. From our analysis results, we show that the optimal number of cells for location area is between 4 and 6 in most cases, and our cell-by-cell distance-based location registration scheme has less signaling traffic than optimal ring-by-ring distance-based location registration scheme where optimal distance threshold is 2 (thus the optimal number of cells for location area is 7).
An Analysis of Location Management Cost by Predictive Location Update Policy in Mobile Cellular Networks
Ko, Han-Seong ; Hong, Jung-Sik ; Chang, In-Kap ; Lie, Chang-Hoon ;
Journal of Korean Institute of Industrial Engineers, volume 34, issue 2, 2008, Pages 160~171
MU's mobility patterns can be found from a movement history data. The prediction accuracy and model complexity depend on the degree of application of history data. The more data we use, the more accurate the prediction is. As a result, the location management cost is reduced, but complexity of the model increases. In this paper, we classify MU's mobility patterns into four types. For each type, we find the respective optimal number of application of history data, and predictive location area by using the simulation. The optimal numbers of four types are shown to be different. When we use more than three application of history data, the simulation time and data storage are shown to increase very steeply.
Improvement and Performance Evaluation of Zone-based Registration in Mobile Communication Network
Park, Jin-Won ;
Journal of Korean Institute of Industrial Engineers, volume 34, issue 2, 2008, Pages 172~180
Many strategies have been proposed to reduce mobility management cost. Among them, in this paper, we study three schemes of zone-based registrationthat have been adopted by most of mobile systems. These special schemes are referred to as the single-zone-based registration (SZR), the two-zone-based registration (TZR) and the two-zone-based registration with outgoing call (TZRC) respectively. We propose a mathematical model to evaluate the performance of TZRC in order to compare with those of SZR and TZR. Numerical results show that TZRC outperforms not only SZR but also TZR in most cases.
A Survey on Network Survivability Models
Myung, Young-Soo ;
Journal of Korean Institute of Industrial Engineers, volume 34, issue 2, 2008, Pages 181~189
Survivability of a network is one of the most important issues in designing present-day communication networks. For the past few decades, a lot of researches have proposed the mathematical models to evaluate the survivability of networks. In this paper, we attempt to survey such researches and classify them based on how these researches measure the survivability of a network.
Design of DEA/(AR-I, ARGM) Models and Sensitivity Analysis for Performance Evaluation on Governmental Funding Projects for IT Small and Medium-sized Enterprises
Park, Sungmin ; Kim, Heon ; Baek, Donghyun ;
Journal of Korean Institute of Industrial Engineers, volume 34, issue 2, 2008, Pages 190~204
Recently, it has been strongly required to establish a systematic and sustainable performance investigation and evaluation framework on governmental funding projects for IT small and medium-sized enterprises. In this paper, Data Envelopment Analysis (DEA) models are adopted for performance evaluation on governmental funding projects for IT small and medium-sized enterprises. A new data structure is proposed for the DEA performance evaluation. Generally, in using DEA models, DEA multipliers restriction is critical to achieve the reliability of DEA optimal solutions. Based on the outputs and inputs considered in this study, Acceptance Region (AR) constraints are generated and incorporated into the DEA models so as to improve the reliability of DEA efficiency scores. Associated with AR Type I (AR-I), AR Global Model (ARGM) constraints, DEA/ (AR-I, ARGM) models are designed and then sensitivity analysis follows investigating the robustness of DEA efficiency scores relating to AR constraints adjustment. Finally, a performance evaluation is illustrated regarding governmental direct funding projects from Ministry of Information and Communication (MIC) in Korea where each project unit (i.e. Decision Making Unit (DMU)) is determined whether it is efficient or not. By using DEA/(AR-I, ARGM) models designed in this paper, robustly efficient DMUs are gradually identified according to the successive AR constraints adjustment. Among 25 DMUs, results show that 6 DMUs such as B, E, G, Q, S, Y are determined as robustly efficient against AR constraints intermediate adjustment.
Tabu Search Heuristic Algorithm for Designing Broadband Convergence Networks
Lee, Youngho ; Yun, Hyunjung ; Lee, Sunsuk ; Park, Noik ;
Journal of Korean Institute of Industrial Engineers, volume 34, issue 2, 2008, Pages 205~215
convergence networks (BcN). The problem seeks to minimize the total cost of switch and cable while satisfying the requirement of demand and quality of service (QoS). We develop mixed integer programming models to obtain the optimal switch location of the access network. We develop a Tabu Search (TS) heuristic algorithm for finding a good feasible solution within a reasonable time limit. We propose real networks with up to 25 nodes and 180 demands. In order to demonstrate the effectiveness of the proposed algorithm, we generate lower bounds from nonlinear QoS relaxation problem. Computational results show that the proposed heuristic algorithm provides upper bounds within 5% optimality gap in 10 seconds.
Analysis of Radio Spectrum Charges based on Economic Value
Jang, Hee-Seon ; Yeo, Jae-Hyun ; Lee, Kwang-Hee ; Choi, Ki-Seok ;
Journal of Korean Institute of Industrial Engineers, volume 34, issue 2, 2008, Pages 216~222
The determination of spectrum charges for the operators is a main issue to efficiently manage the limited radio spectrum resources. In this paper, we propose a model to compute the optimal charges for radio spectrum usage. The objective is to determine that will maximize the spectrum charges, and decision variables of ratios for actual or estimated revenues are considered. The spectrum charges are maximized under satisfying the least profit for operators based on Log-Linear demand function. The parameters of actual sales and minimum profit of operators are analyzed to make an efficient management for radio spectrum. The results show that the spectrum charges increase as the actual sales increase, but it decrease as the required minimum profit of operator increases. It is also observed that the government should increase the ratio for estimated sales if anticipating the poor market in the future, otherwise they should increase the ratio for actual sales to maximize the spectrum charges.
Cost-Effective Deployment and Operation of the IEEE802.16j based WiBro MMR Network
Ryu, Seungwan ; Choi, Go-Bong ; Myung, Kwangsik ; Park, Seikwon ; Cho, Choong-Ho ; Lee, Hyong-Woo ;
Journal of Korean Institute of Industrial Engineers, volume 34, issue 2, 2008, Pages 223~234
Mobile multi-hop relaying (MMR) technology is being considered as a promising solution capable to enhance coverage, user throughput, and system capacity of the current wired backbone dependent wireless access networks. Since the relaying nodes do not need a wired backbone access, MMR technology offers easy and low-cost deployment, flexible cell planning, and adaptive traffic handling performance. In this paper, we investigate performance and cost effectiveness of the MMR technology deployment in the IEEE802.16j based WiBro/WiMAX systems. We first introduce standardization activities and research issues of MMR WiBro/ WiMAX systems. Since the coverage extension problem may occur in metropolitan areas as well as suburban or rural areas where user density is relatively low or moderate, we introduce several MMR topologies and analyze cost-effectiveness of MMR based coverage extension with respect to the user traffic density. Then, we argue cost effect on MMR technology deployment and throughput performance, Finally, we introduce further study issues including sectorized base station based MMR deployment approaches and the single and multi-frame structure MMR approaches.
Optimal topology in Wibro MMR Network Using a Genetic Algorithm
Oh, Dongik ; Kim, Woo-Je ;
Journal of Korean Institute of Industrial Engineers, volume 34, issue 2, 2008, Pages 235~245
The purpose of this paper is to develop a genetic algorithm to determine the optimal locations of base stations and relay stations in Wibro MMR Network. Various issues related to the genetic algorithm such as solution representation, selection method, crossover operator, mutation operator, and a heuristic method for improving the quality of solutions are presented. The computational results are presented for determining optimal parameters for the genetic algorithm, and show the convergence of the genetic algorithm.
MAC Performance Enhancement by Efficient Hidden Node Detection in Infrastructure Mode IEEE 802.11 Wireless LANs
Choi, Woo-Yong ;
Journal of Korean Institute of Industrial Engineers, volume 34, issue 2, 2008, Pages 246~254
In this paper, a new efficient hidden node detection method is proposed to decide whether the RTS/CTS mechanism is necessary to resolve the hidden node problem for the data transmission of each node in infrastructure mode IEEE 802.11 wireless LANs. The nodes, for which the RTS/CTS mechanism is found to be not necessary by the hidden node detection method, can transmit their data frames without performing the RTS/CTS exchange. Only the nodes, for which the RTS/CTS mechanism is found to be necessary by the hidden node detection method, perform the RTS/CTS exchange before their data frame transmissions.
Functional Design of Manufacturing Quote Services for Collaboration between Designer and Manufacturer
Joo, Jaekoo ; Jeong, Buhwan ; Ko, Jee-Hoon ;
Journal of Korean Institute of Industrial Engineers, volume 34, issue 2, 2008, Pages 255~269
The increasing dynamic and distributed nature of a business and manufacturing environment makes it hard to collaborate between design and manufacturing parties. The seamless collaboration necessitates a manufacturing quote service (MQS) that delivers manufacturing quotes timely for designer's requests. After envisioning a SOA-inherited collaboration framework, the paper details MQS' functionalities, and syntax and semantics of collaboration messages (i.e., RFQ and manufacturing quote). The MQS is implemented as a Web Service so as to be accessible by designers. For each RFQ, the MQS adaptively generates a responding manufacturing quote by using the DPM library and real-time shop status information. The paper also presents an evolution process that shows the whole process of RQF generation from given product design data. The proposed framework enabled partners to exchange engineering data rapidly and adaptively during the dynamic collaboration, and also increased the benefits of distributed and global production.