• Journal of KIISE:Information Networking
• /
• 제36권5호
• /
• pp.437-455
• /
• 2009

In the near future, various multicast based services will be provided over clustered wireless networks. To provide multicast services in secure manner, multicast messages are encrypted by using group key which is shared by group members. Therefore, various group key management schemes have been introduced until now. Among them, tree based approach is one of the most representative paradigms in group key management. Traditional tree based approaches effectively reduce rekeying message transmissions of the key distribution center. However, they do not consider the network bandwidth used for transmitting the rekeying messages. In this paper, we firstly present formulas that describe bandwidth consumption of tree based group key management scheme. Based on our formulations, we propose a bandwidth efficient key tree management scheme for clustered wireless networks where membership changes occur frequently. Simulation results show that our scheme effectively reduces the bandwidth consumption used for rekeying compared to existing key tree schemes.

• Journal of Internet Computing and Services
• /
• 제16권2호
• /
• pp.7-17
• /
• 2015

To provide scalability, wireless sensor network has cluster-based architecture. Wireless sensor network can be implemented based on the IEEE 802.15.4 which is exploited in 2.4GHz ISM frequency band. Since this frequency band is used for various data communication, network status of wireless sensor networks frequently changes according to wireless environment. Thus, wireless channel selection to avoid reduction of transmission efficiency is required. This paper estimates network status using the information that a cluster-head collects in a cluster. Through objective function with throughput, RSSI level and reliability as input parameters, this paper proposes proper wireless channel selection. Simulation results show that the proposed method maintains transmission efficiency even though network status changes.

• Annual Conference of KIPS
• /
• 한국정보처리학회 2007년도 춘계학술발표대회
• /
• pp.773-776
• /
• 2007

클러스터 시스템에서 결함이 발생하였을 때, 결함 회복 성능은 매우 중요한 설계 요소가 된다. 단일 입출력 공간(SIOS)을 저장 장치로 사용하는 클러스터 시스템에서, 각 노드들의 결함허용정보를 주기적으로 저장하는 roll-back 결함회복 기법을 사용하는 경우, 결함 회복 성능은 SIOS가 제공하는 입출력 병렬성과 깊은 관계가 있다. 본 연구에서는 클러스터 시스템의 SIOS 구성에 참여하는 노드 수에 따른 결함 회복 성능을 HPL 벤치마크를 통하여 여러 환경에서 평가하고, 그 결과를 분석하였다. 성능 평가 수행 결과, 클러스터 시스템은 SIOS 구성에 참여하는 노드의 수가 증가할수록 우수한 결함 회복 성능을 보인다. 따라서 SIOS를 결함허용정보 저장 장치로 사용하는 클러스터 시스템을 설계할 경우, SIOS 구성에 참여하는 노드 수가 클러스터 시스템의 결함 회복 성능을 결정하는 데에 중요한 요소가됨을 알 수 있다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• 제22권1호
• /
• pp.43-56
• /
• 2012

Wireless sensor networks consist of numerous small-sized nodes equipped with limited computing power and storage as well as energy-limited disposable batteries. In this networks, nodes are deployed in a large given area and communicate with each other in short distances via wireless links. For energy efficient networks, dynamic clustering protocol is an effective technique to achieve prolonged network lifetime, scalability, and load balancing which are known as important requirements. this technique has a characteristic that sensing data which gathered by many nodes are aggregated by cluster head node. In the case of cluster head node is exposed by attacker, there is no guarantee of safe and stable network. Therefore, for secure communications in such a sensor network, it is important to be able to encrypt the messages transmitted by sensor nodes. Especially, cluster based sensor networks that are designed for energy efficient, strongly recommended suitable key management and authentication methods to guarantee optimal stability. To achieve secured network, we propose a key management scheme which is appropriate for hierarchical sensor networks. Proposed scheme is based on polynomial key pool pre-distribution scheme, and sustain a stable network through key authentication process.

• The KIPS Transactions:PartC
• /
• 제15C권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 Korean Information Science Society Conference
• /
• 한국정보과학회 2006년도 가을 학술발표논문집 Vol.33 No.2 (D)
• /
• pp.236-239
• /
• 2006

무선 센서 네트워크에서는 에너지 제약이라는 특징 때문에 에너지 효율과 관련된 많은 연구가 진행되고 있지만 대부분의 연구는 에너지를 보존하기 위해 센서노드의 작업을 줄이는 소극적인 방식을 취한다. 이에 반해 파워 컨트롤 기법은 전송 파워를 조절하여 불필요한 에너지 소모를 줄이는 적극적인 방식이다. 본 논문에서는 무선 센서 네트워크의 클러스터 기반 라우팅 프로토콜인 LEACH(Low-Energy Adaptive Clustering Hierarchy)에 파워 컨트롤 기법을 적용한 LEACH-PC(LEACH-Power Control)를 제안하였다. LEACH-PC는 클러스터 구성에 사용한 RSSI(Received Signal Strength Indicator) 정보를 이용하여 클러스터 내부 통신 단계에서 파워 컨트롤을 수행한다. LEACH-PC는 에너지 효율성 측면에서 기존의 LEACH 보다 좋은 성능을 보임을 실험을 통해 확인할 수 있었다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 한국정보통신학회 2014년도 춘계학술대회
• /
• pp.400-401
• /
• 2014

본 논문에서는 이동 에드혹 네트워크(Mobile Ad hoc Network: MANET)에서의 상황인식 기반의 스케쥴링 기법인 DDV(Dynamic Direction Vector)-hop알고리즘을 제안한다. 기존 MANET에서는 노드의 이동성으로 인한 동적 네트워크 토폴리지, 네트워크 확장성 결여의 대한 취약성을 지니고 있다. 본 논문에서는 계층적 클러스터 단위의 동적인 토폴로지에서 노드가 이동하는 방향성 및 속도에 대한 노드의 이동 속성 정보를 고려하여 클러스터를 생성 및 유지하는 DDV-hop 알고리즘을 제안한다. 제안된 알고리즘은 클러스터 헤드노드를 기준으로 클러스터 멤버노드의 방향성 및 속도의 속성 정보를 비교하여 유사한 노드간 클러스터링을 구성하고, 이로부터 헤드노드를 선택하는 방법이다. 실험결과, 제안하는 알고리즘이 네트워크의 부하를 감소시키고 네트워크 토폴로지를 안정적으로 유지할 수 있음을 확인하였다.

• The KIPS Transactions:PartD
• /
• 제16D권6호
• /
• pp.845-850
• /
• 2009

Use of XML data has been increased with growth of Web 2.0 environment. XML is recognized its advantages by using based technology of RSS or ATOM for transferring information from blogs and news feed. Bitmap clustering is a method to keep index in main memory based on Relational DBMS, and which performed better than the other XML indexing methods during the evaluation. Existing method generates too many clusters, and it causes deterioration of result of searching quality. This paper proposes k-Bitmap clustering method that can generate user defined k clusters to solve above-mentioned problem. The proposed method also keeps additional inverted index for searching excluded terms from representative bits of k-Bitmap. We performed evaluation and the result shows that the users can control the number of clusters. Also our method has high recall value in single term search, and it guarantees the searching result includes all related documents for its query with keeping two indices.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• 제46권2호
• /
• pp.1-10
• /
• 2009

Energy efficient operations are essential to increase the life time of wireless sensor network. A cluster-based protocol is the most common approach to preserve energy during a data aggregation. This paper deals with an energy awareness and autonomous clustering method based on time delay. This method consists of three stages. In the first phase, Candidate Cluster Headers(CCHs) are selected based on a time delay which reflects the remaining energy of a node, with considering coverage efficiency of a cluster. Then, time delay is again applied to declare Cluster Headers(CHs) out of the CCHs. In the last phase, the issue on an orphan node which is not included into a cluster is resolved. The simulation results show that the proposed method increases the life time of the network around triple times longer than LEACH(Low Energy Adaptive Cluster Hierarchy). Moreover, the cluster header frequency is less diverse, and the energy on cluster heads is less spent.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제31권3A호
• /
• pp.304-310
• /
• 2006

This paper evaluates the performance of three types of data delivery mechanisms in clustered sensor networks, as a basic research to develop an energy efficient topology management scheme. In the first mechanism, one node per cluster(clusterhead) turns on its radio(or wakes up) to transmit and receive RTS/CTS/DATA/ACK messages, but in the second one, k nodes per cluster wake up and participate in the message exchange. In the last mechanism, clusterheads turn on the radio to exchange RTS/CTS messages, and if a clusterhead receives RTS containing its cluster m as a destination, it makes k nodes in the cluster hun on the radio to receive DATA and transmit ACK. Through simulation, we show the energy consumption of the three types of data delivery mechanisms as functions of the number of active nodes per cluster, offered load, and packet loss probability.