• Communications for Statistical Applications and Methods
• /
• v.22 no.5
• /
• pp.435-443
• /
• 2015

Two phase sampling design is useful to increase estimation efficiency using deep stratification, improved non-response adjustment and reduced coverage bias. The same sampling units are commonly used for the first and the second phases in complex two-phase sampling design. In this paper we consider a sampling scheme where the first phase sampling units are clusters and the second phase sampling units are list samples. Using selected clusters in first phase requires that we list up elements in the selected clusters from the first phase and then use the list as a secondary sampling frame for the second phase sampling design. Then we select second phase samples from the listed sampling frame. We suggest an estimator based on the complex two-phase sampling design with different sampling units of each phase. Also the estimated variances of the estimator obtained by using classic and replication variance methods are considered and compared using simulation studies. For real data analysis, 2010 Korea Farm Household Economy Survey (KFHES) and 2011 Korea Agriculture Survey (KAS) are used.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.1
• /
• pp.5-25
• /
• 2009

In recent years the popularity of multi-hop wireless networks has been growing. Its flexible topology and abundant routing path enables many types of applications. However, the lack of a centralized controller often makes it difficult to design a reliable service in multi-hop wireless networks. While packet routing has been the center of attention for decades, recent research focuses on data discovery such as file sharing in multi-hop wireless networks. Although there are many peer-to-peer lookup (P2P-lookup) schemes for wired networks, they have inherent limitations for multi-hop wireless networks. First, a wired P2P-lookup builds a search structure on the overlay network and disregards the underlying topology. Second, the performance guarantee often relies on specific topology models such as random graphs, which do not apply to multi-hop wireless networks. Past studies on wireless P2P-lookup either combined existing solutions with known routing algorithms or proposed tree-based routing, which is prone to traffic congestion. In this paper, we present two wireless P2P-lookup schemes that strictly build a topology-dependent structure. We first propose the Ring Interval Graph Search (RIGS) that constructs a DHT only through direct connections between the nodes. We then propose the ValleyWalk, a loosely-structured scheme that requires simple local hints for query routing. Packet-level simulations showed that RIGS can find the target with near-shortest search length and ValleyWalk can find the target with near-shortest search length when there is at least 5% object replication. We also provide an analytic bound on the search length of ValleyWalk.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.4
• /
• pp.135-143
• /
• 2015

A Multiplayer Online Game(MOG) is a game capable of supporting hundreds or thousands of players and is mostly played using the Internet. P2P(peer-to-peer) architectures for MOGs can potentially achieve high scalability, low cost, and good performance. The basic idea of many P2P-based games is to distribute the game state among peers and along with it processing, network, and storage tasks. In a primary-copy based replication scheme where any update to the object has to be first performed on the primary copy, this means distributing primary copies of objects among peers. Most multiplayer games use a primary-copy model in order to provide strong consistency control over an object. Games consist of various types of actions that have different levels of sensitivity and can be categorized according to their consistency requirements. With the appropriate consistency level of each action type within a game, this paper allows developers to choose the right trade-off between performance and consistency. The performance for P2P game architecture with the primary-copy model is evaluated through simulation experiments and analysis.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.5
• /
• pp.360-370
• /
• 2009

Using solar power in wireless sensor networks requires a different approach to energy optimization from networks with battery-based nodes. Solar energy is an inexhaustible supply which can potentially allow a system to run forever, but there are several issues to be considered such as the uncertainty of energy supply and the constraint of rechargeable battery capacity. In this paper, we present SolarSS: a reliable storage system for solar-powered sensor networks, which provides a set of functions, in separate layers, such as sensory data collection, replication to prevent failure-induced data loss, and storage balancing to prevent depletion-induced data loss. SolarSS adapts the level of layers activated dynamically depending on solar energy availability, and provides an efficient resource allocation and data distribution scheme to minimize data loss.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.8C
• /
• pp.803-810
• /
• 2003

This paper addresses an image processing technique for the human papillomavirus (HPV) DNA chip to discriminate whether the probes are hybridized with the target DNA. HPV DNA chip is designed to determine HPV gene-types by using DNA probes for 22 HPV types. In addition to the probes, the HPV DNA chip has markers that always react with the sample DNA. The positions of probe-dots in the final scanned image are fixed relative to the marker- dot locations with a small variation attributable to the accuracy of the dotter and the scanner. The probes are quadruplicated to enhance diagnostic fidelity. frier knowledge including the marker relative distance and the replication information of probes is integrated into the template matching technique with normalized covariance measure. It was demonstrated that the employment of both of the prior knowledges can be accomplished by simply averaging the template matching measures over the positions of the markers and probes. The resulting proposed scheme yields stable marker locating and probe classification.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.4
• /
• pp.247-258
• /
• 2009

Distributed file systems running on a cluster of inexpensive commodity hardware are being recognized as an effective solution to support the explosive growth of storage demand in large-scale Internet service companies. This paper presents the design and implementation of BeanFS, a distributed file system for large-scale e-mail services. BeanFS is adapted to e-mail services as follows. First, the volume-based replication scheme alleviates the metadata management overhead of the central metadata server in dealing with a very large number of small files. Second, BeanFS employs a light-weighted consistency maintenance protocol tailored to simple access patterns of e-mail message. Third, transient and permanent failures are treated separately and recovering from transient failures is done quickly and has less overhead.

• The Journal of the Korea Contents Association
• /
• v.19 no.5
• /
• pp.187-193
• /
• 2019

Key-value storage engines are an essential component of growing demand in many computing environments, including social networks, online e-commerce, and cloud services. Recent key-value storage engines offer many features such as transaction, versioning, and replication. In a key-value storage engine, transaction processing provides atomicity through Write-Ahead-Logging (WAL), and a synchronous commit method for transaction processing flushes log data before the transaction completes. According to our observation, flushing log data to persistent storage is a performance bottleneck for key-value storage engines due to the significant overhead of fsync() calls despite the various optimizations of existing systems. In this article, we propose a group synchronization method to improve the performance of the key-value storage engine. We also design and implement a transaction scheduling method to perform other transactions while the system processes fsync() calls. The proposed method is an efficient way to reduce the number of frequent fsync() calls in the synchronous commit while supporting the same level of transaction provided by the existing system. We implement our scheme on the WiredTiger storage engine and our experimental results show that the proposed system improves the performance of key-value workloads over existing systems.

• International Journal of Highway Engineering
• /
• v.12 no.1
• /
• pp.21-27
• /
• 2010

Management of driver hours of service (HOS) for commercial vehicle operators has been a continual safety challenge. One of the more critical issues to government and motor carriers is fatigue and fatigue-related accidents. To reduce truck drivers’fatigue-related accident risk in other countries, the government issued the HOS regulations. However, korea government does not have any HOS regulations. The objective of this research gives the clues that korea should have the HOS regulation to reduce truck drivers’fatigue-related accident risk. This study examines the HOS regulation over other countries and conducts relative accident risk analysis using the real data from 3 freight companies. The data set includes 231 accident involved drivers and 462 non-accident drivers. Therefore, the size of the total data set is 693 drivers. One of the most important aspects of early studies of safety and HOS was the need to characterize continuous driving by using the notion of "survival". Subsequent research used a data replication scheme and logistic regression to capture the survival effect. This study uses time-dependent logistic regression. The test of significance between parameters indicates that the first three hours are almost the same risk. In the 10th hour of driving, the risk was more than 2.2times that in the baseline first hour. In conclusion, as driving time goes on, the crash risk increases.

• The KIPS Transactions:PartC
• /
• v.16C no.1
• /
• pp.65-72
• /
• 2009

Due to the popularity of mobile devices and advances in wireless communication technologies, a mobile ad hoc network has received a lot of attention. In the existing data replication management research, the use of a replica has been shown to be an efficient technique for improving data accessibility. However, to use a replica in ad hoc networks, the data consistency between the original data and the replica should be guaranteed. In the traditional research, a mobile node should check an original data whether the data is updated or not. However, It may be costly or sometimes impossible to check the original data. In the case of the time constraint applications, the checking cost can cause more serious problem. In this paper, we propose the time-guarantee based cache invalidation schemes for time constraint applications and the threshold based compensation method to enhance the time-guarantee based scheme. The proposed schemes can remove the "rollback" problem. Simulation results show that our schemes outperform the previous ones in terms of access time with little loss of data currency.