• Journal of the Institute of Convergence Signal Processing
• /
• v.9 no.4
• /
• pp.313-320
• /
• 2008

The dynamic clustering technique has some problems regarding energy consumption. In the cluster configuration aspect the cluster structure must be modified every time the head nodes are re-selected resulting in high energy consumption. Also, there is excessive energy consumption when a cluster head node receives identical data from adjacent cluster sources nodes. 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 duster head nodes, is suggested for solving the energy consumption problem regarding repetitive cluster construction. Furthermore, the issue of redundant data occurring at the cluster head node is dealt with by broadcasting metadata of the initially received data to prevent reception by a sensor node with identical data. A simulation experiment was performed to verify the validity of the proposed approach. The results of the simulation experiments were compared with the performances of two of the must 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 29.3% and 21.2% more efficient than LEACH and HEED, respectively.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.12
• /
• pp.109-120
• /
• 1998

An image segmentation approach based on the fuzzy worm searching and MIN-MAX clustering algorithm is proposed in this paper. This algorithm deals with fuzzy worm value and min-max node at a gross scene level, which investigates the edge information including fuzzy worm action and spatial relationship of the pixels as the parameters of its objective function. But the conventional segmentation methods for edge extraction generally need the mask information for the algebraic model, and take long run times at mask operation, whereas the proposed algorithm has single operation according to active searching of fuzzy worms. In addition, we also propose both genetic fuzzy worm searching and genetic min-max clustering using genetic algorithm to complete clustering and fuzzy searching on grey-histogram of image for the optimum solution, which can automatically determine the size of ranges and has both strong robust and speedy calculation. The simulation results showed that the proposed algorithm adaptively divided the quantized images in histogram region and performed single searching methods, significantly alleviating the increase of the computational load and the memory requirements.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.05a
• /
• pp.519-522
• /
• 2017

In this paper, we propose an algorithm for an alternative method using the clustering algorithm in a system that needs classification to extract individual user context information. In the conventional user classification system, the user has to input his own information. In this paper, we will research and develop a system applying a clustering algorithm which can extract user 's perceived information applying the improved algorithm for user management base. Generally, the algorithm that distinguishes users with the same data makes sure that recorded information matches the newly entered information, and then responds accordingly. However, it is troublesome to manually input information of the new user. Therefore, in this paper, we propose a method to distinguish users by using the clustering algorithm based on the analyzed data from the working memory in the accumulated system without directly inputting the user information. The study shows that the management method applied to the applied algorithm is more adaptive in environments where the number of people is different from that of the existing system (as a subjective observer test method).

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.04a
• /
• pp.301-304
• /
• 2007

학습법칙은 신경회로망의 성능에 중요한 영향을 미친다. 본 논문은 데이터와 클러스터들의 대표값들 사이의 거리를 고려하여 학습률을 정하는 새로운 퍼지 학습법칙을 제안한다. 클러스터들의 대표값을 조정할 때, 이러한 고려는 outlier에 비하여 결정경계선 근처에 있는 데이터의 반영도를 높임으로써 outlier의 클러스터의 대표값에 미치는 영향도를 낮출 수 있다. 따라서 outlier들이 결정경계선을 악화시키는 것을 방지할 수 있다. 이 새로운 퍼지 학습법칙을 IAFC(Integrated Adaptive Fuzzy Clustering) 신경회로망에 적용하였다. 제안한 퍼지 신경회로망과 다른 감독 신경회로망들의 성능을 비교하기 위하여 iris 데이터를 사용하였다. iris 데이터를 사용하여 테스트한 결과 제안한 퍼지 신경회로망의 성능이 우수함을 보였다.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2005.11a
• /
• pp.101-105
• /
• 2005

본 논문에서는 LVQ(Learning Vector Quantization)을 퍼지화한 새로운 퍼지 학습 법칙을 제안하였다. 퍼지 LVQ 학습 법칙 3은 기존의 학습률 대신에 퍼지 학습률을 사용하였는데, 기존의 LVQ와는 달리 비대칭인 학습률을 사용하였다. 기본의 LVQ에서는 분류가 맞거나 틀렸을 때 같은 학습률을 사용하고 부호만 달랐으나, 새로운 퍼지 학습 법칙에서는 분류가 맞거나 틀렸을 때 부호가 다를 뿐만 아니라 학습률도 다르다. 이 새로운 퍼지 학습 법칙을 무감독 신경회로망인 improved IAFC(Integrated Adaptive Fuzzy Clustering) 신경회로망에 적용하여 감독 신경회로망으로 변형하였다. Improved IAFC 신경회로망은 유연성이 있으면서도 안정성이 있다. 제안한 supervised IAFC 신경회로망 3의 성능과 오류 역전파 신경회로망의 성능을 비교하기 위하여 iris 데이터를 사용하였는데 Supervised IAFC 신경회로망 3가 오류 역전파 신경회로망보다 성능이 우수하였다.

• Journal of electromagnetic engineering and science
• /
• v.9 no.3
• /
• pp.111-117
• /
• 2009

This paper presents an energy-efficient and bandwidth-efficient 2-1-1 relaying scheme in which a sensor node(SN) assists two others in their data transmission to a clusterhead in WSNs(Wireless Sensor Networks) using LEACH (Low-Energy Adaptive Clustering Hierarchy). We derive the closed-form BER expression of this scheme which is also a general BER one for the decode-and-forward cooperative protocol and prove that the proposed scheme performs the same as the conventional relaying scheme but obtains higher channel utilization efficiency. A variety of numerical results reveal the relaying can save the network energy up to 11 dB over single-hop transmission at BER of $10^{-3}$.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.7
• /
• pp.1293-1310
• /
• 2011

A simple modification of well known Low Energy Adaptive Clustering Hierarchy (LEACH) protocol is proposed to exploit cooperative diversity. Instead of selecting a single cluster-head, we propose M cluster-heads in each cluster to obtain a diversity of order M. The cluster-heads gather data from all the sensor nodes within the cluster using same technique as LEACH. Cluster-heads transmit gathered data cooperatively towards the destination or higher order cluster-head. We propose a code combining based cooperative diversity protocol which is similar to coded cooperation that maximizes the performance of the proposed cooperative LEACH protocol. The implementation of the proposed cooperative strategy is analyzed. We develop the upper bounds on bit error rate (BER) and frame error rate (FER) for our proposal. Space time block codes (STBC) are also a suitable candidate for our proposal. In this paper, we argue that the STBC performs worse than the code combining cooperation.

• Proceedings of the KWS Conference
• /
• 1999.10a
• /
• pp.142-145
• /
• 1999

The dynamic resistance monitoring is one of the important issues in that in-process and real time quality assurance of resistance spot weld is needed to increase the product reliability. Secondary dynamic resistance patterns, as a real manner, are hard to adapt those factors in real time and in-plant system. In the present study, a new dynamic resistance detecting method is presented as a practical manner of weld quality assurance at the primary circuit. By the correlation analysis, it is found that the primary dynamic resistance patterns are basically similar to those of the secondary. Various dynamic resistance indices are characterized with the primary curve. And quality of the weld, like the tensile shear strength, is estimated using adaptive neuro-fuzzy estimation system which is consisted of the Sugeno fuzzy algorithm. Through the fuzzy clustering and parameter optimization, real time weld quality assurance system with less efforts is proposed.

• Journal of information and communication convergence engineering
• /
• v.10 no.4
• /
• pp.384-389
• /
• 2012

In this paper, we examine the problems of the low energy adaptive clustering hierarchy (LEACH) protocol and present ideas for improvement by selecting the cluster head node. The main problem with LEACH lies in the random selection of cluster heads. There exists a probability that the formed cluster heads are unbalanced and may remain in one part of the network, which makes some part of the network unreachable. In this paper, we present a new version of the LEACH protocol called the improved LEACH (ILEACH) protocol, which a cluster head is selected based on its ratio between the current energy level and an initial energy level, and multiplies by the root square of its number of neighbor nodes. The simulation results show that the proposed ILEACH increases the energy efficiency and network lifetime.

• Journal of information and communication convergence engineering
• /
• v.12 no.2
• /
• pp.104-108
• /
• 2014

The field of body sensor networks has attracted interest of many researchers due to its potential to revolutionize medicine. These sensors are usually implanted inside the human body and communicate among themselves. In the process of receiving, processing, or transmitting data, these devices produce heat. This heat damages the tissues surrounding the devices in the case of prolonged exposure. In this paper, to reduce this damages, we have improved and evaluated two protocols-the least temperature routing protocol and adaptive least temperature routing protocol-by implementing clustering as well as a leadership rotation algorithm. We used Castalia to simulate a basic body area network cluster composed of 6 nodes. A throughput application was used to simulate all the nodes sending data to one sink node. Simulations results shows that improved communication protocol with leadership rotation algorithm significantly reduce the energy consumption as compared to a scheme without leadership rotation algorithm.