• Proceedings of the KAIS Fall Conference
• /
• 2010.05a
• /
• pp.45-48
• /
• 2010

에너지 효율성이 중요한 무선 센서 네트워크에서 클러스터링 기술은 클러스터 헤드 노드가 클러스터 멤버 노드의 데이터를 병합하여 싱크노드로 전송함으로써 센서노드들과 싱크노드 사이의 통신 횟수를 줄여 에너지 효율을 얻는다. 이와 관련된 연구로 LEACH(Low Energy Adaptive Clustering Hierarchy) 프로토콜은 센서 네트워크의 데이터 처리 및 전송 부하를 센서 노드 전체에 분산 시켜 무선 센서 네트워크의 수명을 연장 하였다. 본 논문에서는 분산형 클러스터링 라우팅 기법 중 가장 대표적인 LEACH의 클러스터 헤드 결정 방법에 대한 고찰과 이를 토대로 새로운 확률적 클러스터 헤드 결정 방법의 도출을 이루어 내고자 한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11A
• /
• pp.1147-1158
• /
• 2006

Clustering algorithm is an essential element to implement a hierarchical routing protocol, especially for a large-scale wireless sensor network. In this paper, we propose a new type of energy-efficient clustering algorithm, which maximizes the physical distance between cluster head and gateway by a neighbor node discovery mechanism. Furthermore, a slave/master patching scheme is introduced as a useful means of further improving the energy-efficiency. It has been shown that the number of cluster heads can be reduced by as many as 21% as compared with the existing clustering algorithms.

• The KIPS Transactions:PartC
• /
• v.16C no.6
• /
• pp.783-790
• /
• 2009

The necessity of wireless sensor networks is increasing in the recent years. So many researches are studied in wireless sensor networks. The clustering algorithm provides an effective way to prolong the lifetime of the wireless sensor networks. The one-hop routing of LEACH algorithm is an inefficient way in the energy consumption of cluster-head, because it transmits a data to the BS(Base Station) with one-hop. On the other hand, other clustering algorithms transmit data to the BS with multi-hop, because the multi-hop transmission is an effective way. But the multi-hop routing of other clustering algorithms which transmits data to BS with multi-hop have a data bottleneck state problem. The unequal clustering algorithm solved a data bottleneck state problem by increasing the routing path. Most of the unequal clustering algorithms partition the nodes into clusters of unequal size, and clusters closer to the BS have small-size the those farther away from the BS. However, the energy consumption of cluster-head in unequal clustering algorithm is more increased than other clustering algorithms. In the thesis, I propose an energy efficient unequal clustering algorithm which decreases the energy consumption of cluster-head and solves the data bottleneck state problem. The basic idea is divided a three part. First of all I provide that the election of appropriate cluster-head. Next, I offer that the decision of cluster-size which consider the distance from the BS, the energy state of node and the number of neighborhood node. Finally, I provide that the election of assistant node which the transmit function substituted for cluster-head. As a result, the energy consumption of cluster-head is minimized, and the energy consumption of total network is minimized.

• 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.

• The KIPS Transactions:PartC
• /
• v.17C no.3
• /
• pp.291-298
• /
• 2010

In wireless sensor networks, energy is the most important consideration because the lifetime of the sensor node is limited by battery. The clustering is the one of methods used to manage network energy consumption efficiently and LEACH(Low-Energy Adaptive Clustering Hierarchy) is one of the most famous clustering algorithms. LEACH utilizes randomized rotation of cluster-head to evenly distribute the energy load among the sensor nodes in the network. The random selection method of cluster-head does not guarantee the number of cluster-heads produced in each round to be equal to expected optimal value. And, the cluster head in a high-density cluster has an overload condition. In this paper, we proposed both a token based cluster-head selection algorithm for guarantee the number of cluster-heads and a cluster selection algorithm for uniform-density cluster. Through simulation, it is shown that the proposed algorithm improve the network lifetime about 9.3% better than LEACH.

• 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.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.4
• /
• pp.40-48
• /
• 2007

MANET constructs a network that is free and independent between sensor nodes without infrastructure. Also, there are a lot of difficulties to manage data process, control etc.. back efficiently from change of topology by transfer of sensor node that compose network. Especially, because each sensor node must consider mobility certainly, problem about energy use happens. To solve these problem, mechanisms that compose cluster of cluster header and hierarchic structure between member were suggested. However, accompanies inefficient energy consumption because sensing power level of sensor node is fixed and brings energy imbalance of sensor network and shortening of survival time. In this paper, I suggested intelligent clustering mechanism for efficient energy management to solve these problem of existent Clustering mechanism. Proposed mechanism corresponds fast in network topology change by transfer of sensor node, and compares in existent mechanism in circumstance that require serial sensing and brings elevation survival time of sensor node.Please put the abstract of paper here.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.7
• /
• pp.139-148
• /
• 2008

The sensor network is applied from the field which is various. The sensor network nodes are exchanged with mobile environment and they construct they select cluster and cluster headers. In this paper, we propose the Dynamic Prediction Clustering Algorithm use to Skyline queries attributes in direction, angel and hop. This algorithm constructs cluster in base mobile sensor node after select cluster header. Propose algorithm is based made cluster header for mobile sensor node. It "Adv" reduced the waste of energy which mobile sensor node is unnecessary. Respects clustering where is efficient according to hop count of sensor node made dynamic cluster. To extend a network life time of 2.4 times to decrease average energy consuming of sensor node. Also maintains dynamic cluster to optimize the within hop count cluster, the average energy specific consumption of node decreased 14%.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10d
• /
• pp.86-90
• /
• 2007

WSN는 초기에 센서 노드들이 배치되었을 때 이웃 센서 노드들 간 보안키를 안전하고 효율적으로 설정해야하고 에너지 소비를 최소화해야하며 네트워크의 생존성을 늘리기 위해 불필요한 키 관리 동작을 지양해야한다. 네트워크 레벨의 중앙 집중적인 키 관리는 센서노드 하나에 대한 취약성 공격이 전체 네트워크의 위협으로 가용성보장이 어렵다. 따라서 본 논문에서는 네트워크를 클러스터링 하여 센서노드 노출로 인한 네트워크 전체에 주는 피해를 줄이고자 구의 형태로 클러스터링 함으로써 동일 클러스터내의 노드수의 증가에도 경로키 수를 줄일 수 있게 하여 센서 노드의 에너지 소모를 감소시켜 가용성을 보장하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.04a
• /
• pp.166-169
• /
• 2014

무선 센서 네트워크는 제한된 에너지를 가진 센서 노드들로 구성되며, 센서 노드의 에너지를 효율적으로 활용하기 위해 클러스터링 알고리즘을 사용한다. 균형 있는 클러스터 구성을 위해서는 클러스터 헤드의 선정이 중요하다. 기존의 연구는 확률, 노드의 잔여 에너지, 이웃 노드의 수, 이웃 노드와의 거리 등의 정보를 활용하여 클러스터 헤드를 선정하였다. 그러나 확률은 클러스터 헤드의 밀집으로 인한 에너지 소비의 불균형이 있을 수 있으며, 이웃 노드와의 정보 비교는 필요한 정보 수집을 위해 많은 에너지가 필요하다. 이러한 문제점을 개선하기 위해 본 논문은 센서 노드를 베이스 스테이션과의 거리에 따라 2-레벨로 나누고 각 상위 레벨에 속한 동일한 하위 레벨을 순차적으로 변경해가며 클러스터를 구성하는 기법을 제안한다.