• KIPS Transactions on Software and Data Engineering
• /
• v.6 no.1
• /
• pp.1-8
• /
• 2017

Given a multi-dimensional dataset of tuples, a skyline query returns a subset of tuples which are not 'dominated' by any other tuples. Skyline query is very useful in Big data analysis since it filters out uninteresting items. Much interest was devoted to the MapReduce-based parallel processing of skyline queries in large-scale distributed environment. There are three requirements to improve parallelism in MapReduced-based algorithms: (1) workload should be well balanced (2) avoid redundant computations (3) Optimize network communication cost. In this paper, we introduce MR-SEAP (MapReduce sample Skyline object Equality Angular Partitioning), an efficient angular space partitioning based skyline query processing using sampling-based pruning, which satisfies requirements above. We conduct an extensive experiment to evaluate MR-SEAP.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.10
• /
• pp.2218-2226
• /
• 2009

TDMA based MAC protocol supporting wireless mesh network has many advantage rather than 802.11 DCF/EDCA protocol based on packet. But TDMA based MAC protocol require new synchronization method because of mobile point oscillator's difference, and distributed environments. This thesis propose synchronization method for TDMA based MAC protocol. It divides MP(Mobile Points) states into 4 types. If MP is in sync mode, it schedules TDMA local start time in time skew interval using beacon. It proposes compensation algorithms to compensate time skew caused by clock drift. This proposal show that general time error and clock drift rate value reduced and get synchronized result.

• Journal of KIISE:Databases
• /
• v.35 no.1
• /
• pp.84-95
• /
• 2008

Wireless sensor networks have recently emerged as a platform for several applications. By deploying wireless sensor nodes and constructing a sensor network, we can remotely obtain information about the behavior, conditions, and positions of objects in a region. Since sensor nodes operate on batteries, energy-efficient mechanisms for gathering sensor data are indispensable to prolong the lifetime of a sensor network as long as possible. In this paper, we propose a novel clustering algorithm that distributes the energy consumption of a cluster head. First, we analyze the energy consumption if cluster heads and divide each cluster into a collection layer and a transmission layer according to their roles. Then, we elect a cluster head for each layer to distribute the energy consumption of single cluster head. In order to show the superiority of our clustering algorithm, we compare it with the existing clustering algorithm in terms of the lifetime of the sensor network. As a result, our experimental results show that the proposed clustering algorithm achieves about $10%{\sim}40%$ performance improvements over the existing clustering algorithms.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.10
• /
• pp.6276-6281
• /
• 2014

Genetic Algorithms (GAs) are efficient methods for search and optimization problems. On the other hand, there are some problems associated with the premature convergence to local optima of the multimodal function, which has multi peaks. The problem is related to the lack of genetic diversity of the population to cover the search spaces sufficiently. A sharing and crowding method were introduced. This paper proposed strategies to improve the convergence speed and the convergence to the global optimum for solving the multimodal optimization function. These strategies included the random generated sub-population that were well-distributed and spread widely through search spaces. The results of the simulation verified the effects of the proposed method.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.1
• /
• pp.38-43
• /
• 2011

Cluster-based routing is high energy consumption of cluster head nodes. A recent approach to resolving the problem is the dynamic cluster technique that periodically re-selects cluster head nodes to distribute energy consumption of the sensor nodes. However, the dynamic clustering technique has a problem that repetitive construction of clustering consumes the more energies. This paper proposes a solution to the problems described above from the energy efficiency perspective. The round-robin cluster header(RRCH) technique, which fixes the initially structured cluster and sequentially selects cluster head nodes, is suggested for solving the energy consumption problem regarding repetitive cluster construction. A simulation result were compared with the performances of two of the most widely used conventional techniques, the LEACH(Low Energy Adaptive Clustering Hierarchy) and HEED(Hybrid, Energy Efficient, Distributed Clustering) algorithms, based on energy consumption, remaining energy for each node and uniform distribution. The evaluation confirmed that in terms of energy consumption, the technique proposed in this paper was 26.5% and 20% more efficient than LEACH and HEED, respectively.

• Journal of KIISE:Databases
• /
• v.33 no.2
• /
• pp.163-174
• /
• 2006

In distributed wireless sensor network, it is difficult to transmit and analyze the entire stream data depending on limited networks, power and processor. Therefore it is suitable to use alternative stream data processing after classifying the continuous stream data. We propose a classification framework for continuous multivariate stream data. The proposed approach works in two steps. In the preprocessing step, it takes input as a sliding window of multivariate stream data and discretizes the data in the window into a string of symbols that characterize the signal changes. In the classification step, it uses a standard text classification algorithm to classify the discretized data in the window. We evaluated both supervised and unsupervised classification algorithms. For supervised, we tested Bayesian classifier and SVM, and for unsupervised, we tested Jaccard, TFIDF Jaro and Jaro Winkler. In our experiments, SVM and TFIDF outperformed other classification methods. In particular, we observed that classification accuracy is improved when the correlation of attributes is also considered along with the n-gram tokens of symbols.

• The KIPS Transactions:PartD
• /
• v.16D no.2
• /
• pp.191-200
• /
• 2009

Location based services (LBSs) have drawn huge attention as the growing number mobile devices and wireless technology demand more pervasive information access. In LBSs, Constraint nearest neighbor queries are one of the important queries of human to fulfill his desired quickly through wireless technology. We propose new query processing of constrained nearest neighbor query on the air to support mobile clients which demand optimal uses of wireless broadcast channel and using minimum battery power of client. First we proposed NN query processing with constrained region and then explain the novel NN query processing with various types of constraints. We have proposed novel algorithms to support Constrained Nearest Neighbor queries on the air based on Distributed Spatial Index and Bitmap-based Spatial Index.

• Journal of Advanced Navigation Technology
• /
• v.17 no.3
• /
• pp.298-305
• /
• 2013

In this paper, we propose simple combining schemes for sensing ATSC digital television signals with spectral correlation density (SCD). The detection algorithms exploiting the cyclostationarity exhibited by the pilot of ATSC digital television signals usually use the SCD value at a given particular frequency. However, we found that non-zero SCDs are found to be distributed over a certain range of frequencies in multipath fading environment. To utilize a set of non-zero SCD values computed in the vicinity of the pilot location, we formulate a class of combining methods in analogy with the maximal ratio combining, the square law combining and the equal gain combining. We show that the proposed simple combining schemes improve the detection performance by 0.5~1.0dB under multipath fading environments.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2019.05a
• /
• pp.160-160
• /
• 2019

Water is a limited source that needs to be properly managed and distributed to the ever-growing population of the world. Rapid urbanization and development have increased the overall water demand of the world drastically. However, there is loss of billions of liters of water every year due to leakages in water distribution systems. Such water loss means significant financial loss for the utilities as well. World bank estimates a loss of $14 billion annually from wasted water. To address these issues and for the development of efficient and reliable leakage management techniques, high efforts have been made by the researchers and engineers. Over the past decade, various techniques and technologies have been developed for leakage management and leak detection. These include ideas such as pressure management in water distribution networks, use of Advanced Metering Infrastructure, use of machine learning algorithms, etc. For leakage detection, techniques such as acoustic technique, and in recent yeats transient test-based techniques have become popular. Smart Water Grid uses two-way real time network monitoring by utilizing sensors and devices in the water distribution system. Hence, valuable real time data of the water distribution network can be collected. Best results and outcomes may be produced by proper utilization of the collected data in unison with advanced detection and management techniques. Long term reduction in Non Revenue Water can be achieved by detecting, localizing and repairing leakages as quickly and as efficiently as possible. However, there are still numerous challenges to be met and future research works to be conducted in this field.

• Journal of Convergence for Information Technology
• /
• v.11 no.11
• /
• pp.66-74
• /
• 2021

With the development of the Internet, user authentication technology that proves me online is improving. Existing ID methods pose a threat of personal information leakage if the service provider manages personal information and security is weak, and the information subject is to the service provider. In this study, as online identification technology develops, we propose a DID-based self-authentication model to prevent the threat of leakage of personal information from a centralized format and strengthen sovereignty. The proposed model allows users to directly manage personal information and strengthen their sovereignty over information topics through VC issued by the issuing agency. As a research method, a self-authentication model that guarantees security and integrity is presented using a decentralized identifier method based on distributed ledger technology, and the security of the attack method is analyzed. Because it authenticates through DID Auth using public key encryption algorithms, it is safe from sniffing, man in the middle attack, and the proposed model can replace real identity card.