• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.12
• /
• pp.409-414
• /
• 2015

The energy conservation is the most important subject for long run operation of the sensor nodes with limited power resources. Clustering is one of most energy efficient technique to grouped the sensor nodes into distinct cluster. But, in a cluster based WSN, CHs and gateways bear an extra work load to send the processed data to the sink. The inappropriate cluster formation may cause gateways overloaded and may increase latency in communication. In this paper, we propose a novel load balanced clustering model for improving energy efficiency and giving a guarantee of long network lifetime. We show the result of performance measurement experiments that designs using a branch and bound algorithm and a multi-start local search algorithm to compare with the existing load balanced clustering model.

• Journal of Information Processing Systems
• /
• v.19 no.1
• /
• pp.17-32
• /
• 2023

Centralized hierarchical routing protocols are often used to solve the problems of uneven energy consumption and short network life in wireless sensor networks (WSNs). Clustering and cluster head election have become the focuses of WSNs. In this paper, an energy balanced clustering routing algorithm optimized by sine cosine algorithm (SCA) is proposed. Firstly, optimal cluster head number per round is determined according to surviving node, and the candidate cluster head set is formed by selecting high-energy node. Secondly, a random population with a certain scale is constructed to represent a group of cluster head selection scheme, and fitness function is designed according to inter-cluster distance. Thirdly, the SCA algorithm is improved by using monotone decreasing convex function, and then a certain number of iterations are carried out to select a group of individuals with the minimum fitness function value. From simulation experiments, the process from the first death node to 80% only needs about 30 rounds. This improved algorithm balances the energy consumption among nodes and avoids premature death of some nodes. And it greatly improves the energy utilization and extends the effective life of the whole network.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.9
• /
• pp.12-17
• /
• 2016

In the holographic data storage system (HDSS), the data regarding the volume of a storage medium are recorded and read by the page, and the transmission rate and storage capacity can be increased because of two-dimensional, page-oriented data processing; furthermore, the multi-level HDSS can store more than one bit per pixel. For this same reason, however, and unlike conventional data-storage systems, the HDSS is hampered by two-dimensional (2D) intersymbol interference (ISI) and interpage interference (IPI). Progress regarding the published papers on 2D ISI, which is more severe in the multi-level HDSS, continues; however, mitigation of both 2D ISI and IPI in terms of the multi-level HDSS has not yet been studied. In this paper, we therefore propose a 4-level balanced-modulation code that simultaneously mitigates 2D ISI and IPI.

• Journal of the Korean Data and Information Science Society
• /
• v.26 no.3
• /
• pp.611-618
• /
• 2015

By Wikipedia, big data is a broad term for data sets so large or complex that traditional data processing applications are inadequate. Data mining is the computational process of discovering patterns in huge data sets involving methods at the intersection of association rule, decision tree, clustering, artificial intelligence, machine learning. Association rule is a well researched method for discovering interesting relationships between itemsets in huge databases and has been applied in various fields. There are positive, negative, and inverse association rules according to the direction of association. If you want to set the evaluation criteria of association rule, it may be desirable to consider three types of association rules at the same time. To this end, we proposed a balanced comparative confidence considering sensitivity, specificity, false positive, and false negative, checked the conditions for association threshold by Piatetsky-Shapiro, and compared it with comparative confidence and inversely comparative confidence through a few experiments.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.1
• /
• pp.57-65
• /
• 2017

This paper presented a method of designing low-power feedback active noise control filter optimized for headphones/earphones. Using constrained optimization, we obtained a high order FIR noise control filter to ensure reasonable noise attenuation performance at high sampling frequency environment. Then using infinite impulse response (IIR) approximation method called Balanced Model Truncation (BMT), we obtained a low order IIR noise control filter suitable for low-power digital signal processing system like headphones/earphones. For further performance improvement, we utilized frequency warping method so that we could obtain more accurately approximated IIR filter and we ensured system stability by reconstructing the low order IIR filter in form of cascaded second order IIR filters. ANC simulation with white noise and stability test verified that the proposed algorithm had superior attenuation performance and better robustness compared to the conventional algorithm.

• Journal of Digital Convergence
• /
• v.15 no.1
• /
• pp.171-179
• /
• 2017

This study analyzes the influence of the four components of authentic leadership on employees' OCB and job performance to suggest the implications behind the developing of authentic leadership. A survey was conducted on employees of various business areas in Korea, and 448 responses were used in statistical analysis. The results are as follow: First, self-awareness has not shown significantly effective on organizational citizenship behavior and job performance. Second, internalized moral perspective has shown significantly effective toward organizational citizenship behavior and job performance. Third, relational transparency has shown significantly effective for organizational citizenship behavior, but not effective for job performance. Forth, balanced processing of information has not shown significantly effective on organizational citizenship behavior and job performance. This paper makes significant contribution by considering the supervisor's relational transparency and internalized moral perspective, because these authentic leadership dimensions improve employees' OCB and job performance.

• Journal of KIISE:Information Networking
• /
• v.32 no.3
• /
• pp.427-432
• /
• 2005

Packet arrival rates in internet routers have been dramatically increased due to the advance of link technologies, and hence wire-speed packet processing in Internet routers becomes more challenging. As IP address lookup is one of the most essential functions for packet processing, algorithm and architectures for efficient IP address lookup have been widely studied. In this paper, we Propose an efficient I address lookup architecture which shows yeW good Performance in search speed while requires a single small-size memory The proposed architecture is based on multi-way tree structure which performs comparisons of multiple prefixes by one memory access. Performance evaluation results show that the proposed architecture requires a 280kByte SRAM to store about 40000 prefix samples and an address lookup is achieved by 5.9 memory accesses in average.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.3
• /
• pp.821-830
• /
• 1997

The directory-based cache coherence scheme is an attractive approach to solve the caceh coherence problem in a large-scale shared-memory multiprocessor.However, the exsting directory-based schemes have some problens such as the enormous storage overhead for a directory, the long invalidation latency, the heavy network condes-tion, and the low scalability.For resolving these problems, we propose a new directroy- based caceh coherence scheme which is suitable for building scalable, shred-memory multiprocessors.In this scheme, each directory en-try ofr a given memory block is a number-balanced binaty tree(NBBT) stucture.The NBBT has several proper-ties to effciently maintain the directory for the cache consistency such that the shape is unique, the maximum depth is [log$_2$n], and the tree has the minimum number of leaf nodes among the binarry tree with n nodes.Therefore, this scheme can reduce the storage overhead, the network traffic, and the inbalidation latency and can ensutr the high- scalability the large-scale shared-memory multiprocessors.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5271-5289
• /
• 2016

On large-scale data analysis platforms deployed on cloud infrastructures over the Internet, the instability of the data transfer time and the dynamics of the processing rate require a more sophisticated data distribution scheme which maximizes parallel efficiency by achieving the balanced load among participated computing elements and by eliminating the idle time of each computing element. In particular, under the constraints that have the real-time and limited data buffer (in-memory storage) are given, it needs more controllable mechanism to prevent both the overflow and the underflow of the finite buffer. In this paper, we propose an auto regulated data provisioning model based on receiver-driven data pull model. On this model, we provide a synchronized data replenishment mechanism that implicitly avoids the data buffer overflow as well as explicitly regulates the data buffer underflow by adequately adjusting the buffer resilience. To estimate the optimal size of buffer resilience, we exploits an adaptive buffer resilience control scheme that minimizes both data buffer space and idle time of the processing elements based on directly measured sample path analysis. The simulation results show that the proposed scheme provides allowable approximation compared to the numerical results. Also, it is suitably efficient to apply for such a dynamic environment that cannot postulate the stochastic characteristic for the data transfer time, the data processing rate, or even an environment where the fluctuation of the both is presented.

• Journal of applied mathematics & informatics
• /
• v.14 no.1_2
• /
• pp.343-351
• /
• 2004

In order to maintain load balancing in a distributed system, we should obtain workload information from all the nodes on network. This processing requires $O(v^2)$ communication overhead, where v is the number of nodes. In this paper, we present a new synchronous dynamic distributed load balancing algorithm on a (v, k ＋ 1, 1)-configured network applying a symmetric balanced incomplete block design, where $v\;=\;k^2$\;＋\;k\;＋\;1$. Our algorithm needs only $O(\sqrt[v]{v})$ communication overhead and each node receives workload information from all the nodes without redundancy. Therefore, load balancing is maintained since every link has the same amount of traffic for transferring workload information.