• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.6
• /
• pp.85-92
• /
• 2010

In this paper, we propose a Clustering-based Cooperative Routing using OFDM (CCRO) for supporting transmission efficiency in mobile wireless sensor networks. The main features and contributions of the proposed method are as follows. First, the clustering method which uses the location information of nodes as underlying infrastructure for supporting stable transmission services efficiently is used. Second, cluster-based cooperative data transmission method is used for improving data transmission and reliability services. Third, OFDM based data transmission method is used for improving data transmission ratio with channel efficiency. Fourth, we consider realistic approach in the view points of the mobile ad-hoc wireless sensor networks while conventional methods just consider fixed sensor network environments. The performance evaluation of the proposed method is performed via simulation using OPNET and theoretical analysis. The results of performance evaluation show improvement of transmission efficiency.

• Journal of Intelligence and Information Systems
• /
• v.15 no.4
• /
• pp.23-36
• /
• 2009

Network intrusion detection have been continuously improved by using data mining techniques. There are two kinds of methods in intrusion detection using data mining-supervised learning with class label and unsupervised learning without class label. In this paper we have studied the way of improving network intrusion detection accuracy by using LBG clustering algorithm which is one of unsupervised learning methods. The K-means method, that starts with random initial centroids and performs clustering based on the Euclidean distance, is vulnerable to noisy data and outliers. The nonuniform binary split algorithm uses binary decomposition without assigning initial values, and it is relatively fast. In this paper we applied the EM(Expectation Maximization) based LBG algorithm that incorporates the strength of two algorithms to intrusion detection. The experimental results using the KDD cup dataset showed that the accuracy of detection can be improved by using the LBG algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6B
• /
• pp.534-543
• /
• 2006

As the topology frequently varies, more cluster reconstructing is needed and also management overheads increase in the wireless ad hoc/sensor networks. In this paper, we propose a multi-hop clustering algorithm for wireless sensor network topology management using dynamic pre-clusterhead scheme to solve cluster reconstruction and load balancing problems. The proposed scheme uses weight map that is composed with power level and mobility, to choose pre-clusterhead and construct multi-hop cluster. A clusterhead has a weight map and threshold to hand over functions of clusterhead to pre-clusterhead. As a result of simulation, our algorithm can reduce overheads and provide more load balancing well. Moreover, our scheme can maintain the proper number of clusters and cluster members regardless of topology changes.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.3
• /
• pp.121-129
• /
• 2011

One of the major challenges of minimum energy consumption for wireless sensor networks(WSN) environment. LEACH protocol is hierarchical routing protocol that obtains energy efficiency by using clustering. However, LEACH protocol in each round, because the new cluster configuration, cluster configuration, whenever the energy consumed shorten the life of the network. Therefore in this paper, the cluster is formed in WSN environment in early stage and the problems with energy waste have been solved by selecting C-node. In the initial round of proposed model uses 26 percent more than traditional LEACH energy consumption. However, as the round is ongoing, it has been proved by the network simulation tool that the waste of energy could be diminished up to 35%.

• The KIPS Transactions:PartC
• /
• v.15C no.2
• /
• pp.119-124
• /
• 2008

The LEACH is a study method of a clustering base that was representative in many routing techniques that was suggested in sensor network environment. This is suggested technique to manage the sensor network group which consisted of many sensors in efficiency. However, it does not consider energy remaining quantity of the cluster header to manage cluster group, the problem where the cluster group is able to destroyed on the middle which transmits data. We are going to propose to solve such a problem by this paper for new clustering technique to accomplish management for a cluster group. It uses the technique which it proposes from the dissertation which it sees and are to the data transfer and the control also the connection directivity of the cluster group to improve also the lag time diminishes, test result it will lead and the possibility which it will know it was.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.925-928
• /
• 2010

Wireless sensor networks are composed of a large number of sensor nodes with limited energy resources. One critical issue in wireless sensor networks is how to gather sensed information in an energy efficient way since the energy is limited. The clustering algorithm is a technique used to reduce energy consumption. It can improve the scalability and lifetime of wireless sensor network. In this paper, we introduce a clustering protocol with mode selection (CPMS) for wireless sensor networks. Our scheme improves the performance of BCDCP (Base Station Controlled Dynamic Clustering Protocol) and BIDRP (Base Station Initiated Dynamic Routing Protocol) routing protocol. In CPMS, the base station constructs clusters and makes the head node with highest residual energy send data to base station. Furthermore, we can save the energy of head nodes using modes selection method. The simulation results show that CPMS achieves longer lifetime and more data messages transmissions than current important clustering protocol in wireless sensor networks.

• Proceedings of the KIPE Conference
• /
• 2007.07a
• /
• pp.458-460
• /
• 2007

RBF 네트워크의 중간층은 클러스터링 하는 층으로 주어진 자료 집합을 유사한 클러스터들로 분류하는 것이다. 여기서 유사하다는 것은 입력 데이터들에 대한 특징 벡터 공간사이에서 한 클러스터내의 벡터들 간에 거리를 측정하여 정해진 반경 내에 존재하면 같은 클러스터로 분류하고 정해진 반경 내에 존재하지 않으면 다른 클러스터로 분류한다. 그러나 정해진 반경 내에서 클러스터링 하는 것은 잘못된 클러스터를 선택하는 단점을 가지게 된다. 그러므로 중간층을 결정하는 것은 RBF 네트워크의 전반적인 효율성에 큰 영향을 준다. 따라서 본 논문에서는 효율적으로 중간층을 결정하기 위한 방법으로 퍼지 C-Means 클러스터링 알고리즘을 이용하고자 하였다. 그리하여 본 논문에서는 고장 전류의 특성을 해석하여 그 원인을 판단, 분류하기 위하여 전력계통의 고장 기록 장치로부터 얻어지는 선로의 전류 데이터를 FCM을 이용 분류하여 다양한 고장 모드를 판별할 수 있었다.

• The Journal of the Acoustical Society of Korea
• /
• v.33 no.5
• /
• pp.341-350
• /
• 2014

In this paper, an energy efficient clustering scheme using self organization method is proposed. The proposed scheme selects a cluster head considering not only the number of neighbor nodes but also the residual battery amount. In addition, the network life time is extended by re-selecting the cluster heads only in case the current cluster head's residual energy falls down below a certain threshold level. Accordingly, the energy consumption is evenly distributed over the entire network nodes. The cluster head delivers the collected data from member nodes to a Sink node in a way of multi-hop relaying. In order to evaluate the proposed scheme, we run computer simulation in terms of the total residual amount of battery, the number of alive nodes after a certain amount of time, the accumulated energy cost for network configuration, and the deviation of energy consumption of all nodes, comparing with LEACH which is one of the most popular network clustering schemes. Numerical results show that the proposed scheme has twice network life-time of LEACH scheme and has much more evenly distributed energy consumption over the entire network.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06b
• /
• pp.87-89
• /
• 2011

전 세계적으로 수중 또는 해양의 정보는 매우 중요하며 다양한 활용가치를 지닌다. 수중 또는 해양을 개발하고 활용하기 위해서는 실시간으로 지속적으로 모니터링하면서 데이터를 수집하고 필요에 따라 수중 장치나 장비를 제어하는 기술이 기본적으로 요구된다. 본 논문에서는 수중 센서네트워크에 특징에 대해서 알아보고 클러스터링을 적용한 수중 네트워크내의 전송 효율 향상에 대해 연구하고, 통신을 위하여 MAC 계층으로 협업 통신을 적용하는 가능성 그리고 몇 가지 주의점에 대하여 알아보았다. 본 연구를 통하여 수중 네트워크로의 협업 통신 적용은 큰 가능성을 지니고 있으며, 지상에서와의 다른 환경 때문에 프로토콜의 적절한 설계가 매우 필요하다는 것을 알았다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06d
• /
• pp.119-122
• /
• 2007

무선 센서 네트워크에서 이동하는 물체 추적 실패시 이를 복구하기 위하여 많은 센서들의 에너지를 소비하기 때문에 이동 물체 추적 복구는 전체 센서 네트워크의 생명주기 연장에 중요한 요소이다. 본 논문에서는 물체의 이동정보를 고려한 동적 클러스터링 환경에서 이동물체의 추적 실패시 이동물체를 효율적으로 재 탐지할 수 있는 이동물체 추적 복구 기법을 제안함으로써 이동하는 물체추적 실패후 재 탐지에 성공하는 복구율을 증가시켜서 센서 노드의 에너지 소모를 최소화 하여 전체 센서 네트워크의 생명주기를 연장시키고자 한다. 시뮬레이션 결과가 증명하는 바와 같이 제안한 방식은 보다 높은 복구율을 달성하였다.