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

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

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

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

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

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

• Journal of Korea Multimedia Society
• /
• v.14 no.10
• /
• pp.1287-1302
• /
• 2011

Clustering protocol that is used in wireless sensor network is an efficient method that extends the lifetime of the network. However, when this method is applied to an environment in which collected data of the sensor node easily overlap, sensor nodes unnecessarily consumes energy. In the case of clustering technique that uses a threshold, the lifetime of the network is extended but the degree of accuracy of collected data is low. Therefore it is hard to trust the data and improvement is needed. In addition, it is hard for the clustering protocol that uses multi-hop transmission to normally collect data because the selection of a cluster head node occurs at random and therefore the link of nodes is often disconnected. Accordingly this paper suggested a cluster-formation algorithm that reduces unnecessary energy consumption and that works with an alleviated link disconnection. According to the result of performance analysis, the suggested method lets the nodes consume less energy than the existing clustering method and the transmission efficiency is increased and the entire lifetime is prolonged by about 30%.

• 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 the Korea Society of Computer and Information
• /
• v.20 no.4
• /
• pp.77-85
• /
• 2015

Recently, wireless sensor network(WSN) have been used in various fields to implement ubiquitous computing environment. WSN uses small, low cost and low power sensors in order to collect information from the sensor field. This paper proposes a clustering algorithm for energy efficiency of sensor nodes. The proposed algorithm is based on conventional LEACH, the representative clustering protocol for WSN and it prolongs network and nodes life time using sleep technique and changable transmission mode. The nodes of the proposed algorithm first calculate their clustering participation value based on the distance to the neighbor nodes. The nodes located in high density area will have clustering participation value and it can turn to sleep mode. Besides, proposed algorithm can change transmission method from conventional single-hop transmission to multi-hop transmission according to the energy level of cluster head. Simulation results show that the proposed clustering algorithm outperforms conventional LEACH, especially non-uniformly deployed network.

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

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.12
• /
• pp.6081-6088
• /
• 2012

An unequal clustering method in wireless sensor networks is the technique that forms the cluster of different size. This method decreases whole energy consumption by solving the hot spot problem. In this paper, I propose a layer-based dynamic unequal clustering using the unequal clustering model. This method decreases whole energy consumption and maintain that equally using optimal cluster's number and cluster head position. I also show that proposed method is better than previous clustering method at the point of network lifetime.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.755-758
• /
• 2012

국경 지역을 실시간 모니터링하고, 효율적인 데이터 전달을 위해서는 센서 노드의 에너지 소모를 줄임으로써 전체 네트워크의 수명을 연장시킬 필요가 있다. 그에 따라, 본 논문에서는 네트워크를 클러스터링 기반으로 한 다수의 영역으로 분할하고 각각의 영역 내 특정 노드에 헤드의 역할을 부여하여 라우팅을 수행하는 계층적 클러스터 센서 네트워크를 제안한다. 제안하는 기법에서는 클러스터 헤드에서의 데이터 모음을 통한 통신 메시지 수를 줄임으로써 센서 노드들의 에너지 소모를 최소화시키고, 긴 국경 라인을 커버할 수 있는 충분한 클러스터 확장이 가능하다. 또한 링크의 상태 및 노드의 밀집도를 고려하여 적응적으로 링크의 품질을 측정하는 알고리즘을 제시하여 링크 변화에 대한 빠른 탐색을 통해 네트워크를 관리하는 방안을 제시한다.

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