• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.1035-1037
• /
• 2009

Common to use fixed-node sensor network and wireless sensor networks, unlike the recent move of the node happens frequently. These wireless sensor networks by taking into account the mobility of sensor nodes dynamically self-configurable routing protocol is required. In this paper, a fixed-node configuration and energy efficiency in the self-LEACH protocol is based on the useful movement of the nodes of the cluster is dynamically self-configuring routing protocols offer M-LEACH.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5B
• /
• pp.801-808
• /
• 2010

LEACH, one of hierarchical based routing protocols, was proposed for energy efficiency which is the most important requirement of Wireless Sensor Network(WSN). LEACH protocol is composed of a cluster of certain large number of clusters, which have a cluster head and member nodes. Member nodes send sensing data to their cluster heads, and the cluster heads aggregate the sensing data and transmit it to BS. The challenges of LEACH protocol are that cluster heads are not evenly distributed, and energy consumption to transmit aggregated data from Cluster heads directly to BS is excessive. This study, to improve LEACH protocol, suggests LECEEP that transmit data to contiguity cluster head that is the nearest and not far away BS forming chain between cluster head, and then the nearest cluster head from BS transmit aggregated data finally to BS. According to simulation, LECEEP consumes less energy and retains more number of survival node than LEACH protocol.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2009.01a
• /
• pp.283-288
• /
• 2009

고정된 망을 가지지 않고, 이동 호스트로만 이루어져 통신되는 망인 Ad-hoc 네트워크에서 고속으로 이동 중인 차량들 간의 긴급한 정보를 주고받아 고속도로에서의 다중 충돌사고를 미연에 방지할 수 있는 차량 통신 프로토콜을 제안한다. 본 논문에서는 도로위의 차량들은 서로 연계성이 없기 때문에 위치추적시스템인 GPS에서 수신한 거리 값을 연계하여 클러스터를 구성한다. 클러스터를 IEEE 802.11 MAC 계층에서 구성하기 때문에 경로 설정으로 인한 과부하문제를 해소 하였다. 논문에서 제안한 액티브 네트워크 기반의 멀티 홉 라우팅 프로토콜은, Active 네트워크를 이용하여 안정된 통신이 이루어 질수 있도록 한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06d
• /
• pp.241-242
• /
• 2011

SRC 프로토콜은 BCDCP 클러스터 라우팅 기법과 페어와이즈 키와 디지털서명을 이용한 키 분배 프로토콜을 결합한 클러스터링 기반 보안 프로토콜이며, 초기 키 생성 및 분배, 주기적인 키 재 생성, 센서 추가 및 센서 단계로 구성되어 있다. 본 논문에서는 SRC 프로토콜의 한계점인 페어와이즈 키의 선분배를 이용한 보안방법의 개선과 에너지 사용량을 개선하기 위한 초기 키 생성 및 분배단계를 분리하여 초기 키 생성 단계와 분배단계를 제시한다.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.3
• /
• pp.163-169
• /
• 2016

To establish the equitable distribution of total energy load, a representative cluster based routing protocol LEACH selects cluster heads randomly in accordance with the pre-determined probability every round. But because the current energy level of sensor nodes is not considered, if a sensor node which has little residual energy is elected as a cluster head, it can not live to fulfil the role of cluster head which has big energy load. As a result, the first time of death of a node is quickened and the service quality of WSN gets worse. In this regard we propose a new routing method that, by considering the current energy of a cluster head and the distance between cluster heads and a base station, selects the sub cluster head for saving the energy of a cluster head. Simulation results show that the first time of death of a node prolongs, more data arrive at the base station and the service quality of WSN improves.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.27 no.1
• /
• pp.124-130
• /
• 2023

In this paper, we intend to improve the network lifetime by improving the energy efficiency of sensor nodes in a wireless sensor network by utilizing machine learning using K-means clustering algorithm. A wireless sensor network is a wireless network composed of physical devices including batteries as physical sensors. Due to the characteristics of sensor nodes, all resources must be efficiently used to minimize energy consumption to maximize network lifetime. A cluster based approach is used to manage groups of relatively large numbers of nodes. In the proposed protocol, by improving the existing LEACH algorithm, we propose a clustering algorithm that selects a cluster head using a cluster based approach and a location based approach. The performance results to be improved were measured using Matlab simulation. Through the experimental results, K-means clustering was applied to the energy efficiency part. By utilizing K-means, it is confirmed that energy efficiency is improved and the lifetime of the entire network is extended.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11b
• /
• pp.1627-1630
• /
• 2002

Ad Hoc 망은 고정된 네트워크 기반이 없는 동적인 호스트들로 구성된 네트워크이다. 호스트가 네트워크를 연결하기 위해 이웃 노드에 의존적이다. 그래서 네트워크의 보안 사항에 있어서 전통적인 네트워크에서 사용한 보안기법을 그대로 적용하기 어렵다. 본 논문에서는 Ad Hoc 망에서의 특징에 근거하여 여러 동적인 노드들을 클러스터로 묶어서 클러스터 헤드가 멤버 노드들의 정보를 관리하는 가운데 한 클러스터 멤버가 다른 클러스터에 접속을 할 때 카 클러스터 헤드 사이에 멤버 인증서 교환을 위한 공개키 기반 인증 프로토콜을 제안한다.

• Journal of Convergence Society for SMB
• /
• v.4 no.1
• /
• pp.7-15
• /
• 2014

In this paper, we propose an efficient routing protocol to achieve an optimal route searching process of the network lifetime by balancing power consumption per node. The proposed protocols aim at finding energy-efficient paths at low protocol power. In our protocol, each intermediate node keeps power level and branch number of child nodes and it transmits the data the nearest neighbor node. Our protocol may minimize the energy consumption at each node, thus prolong the lifetime of the system regardless of the location of the sink outside or inside the cluster. In the proposed protocol for inter-cluster communication, a cluster head chooses a relay node from its adjacent cluster heads according to the node's residual energy and its distance to the base station. Simulation results show that proposed protocol successfully balances the energy consumption over the network, and achieves a remarkable network lifetime improvement as highly as 7.5%.

• Journal of Digital Convergence
• /
• v.11 no.10
• /
• pp.419-429
• /
• 2013

The Wireless sensor network(WSN) consisting of a large number of sensors aims to gather data in a variety of environments. The sensor nodes operate on battery of limited power. so, To extend network life time is major goals of research in the WSN. In this paper, we state the key point of a energy consumption with minimum&load balancing. The proposed protocol guarantee balance of number of cluster member nodes using the node memory threshold and optimization of distribution of cluster head using the optimized clustering method. The results show that the proposed protocol could support the load balancing and high energy efficiency by distributing the clusters with a reasonable number of member nodes. The simulation results show that our schme ensure longer life time in WSN as compare with existing schemes such as LEACH and CBLM.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.11
• /
• pp.763-770
• /
• 2014

In traditional routing protocols including LEACH for wireless sensor networks, nodes suffer from unbalanced energy consumption because the nodes require large transmission energy as the distance to the sink node increase. Multi-hop based routing protocols have been studied to address this problem. In existing protocols, each cluster head usually chooses the closest head as a relay node. We propose LEACH-CHT, in which cluster heads choose the path with least energy consumption to send data to the sink node. In our research, each hop, a cluster head selects the least cost path to the sink node. This method solves the looping problem efficiently as well as make it possible that a cluster head excludes other cluster heads placed farther than its location from the path, without additional energy consumption. By balancing the energy consumption among the nodes, our proposed scheme outperforms existing multi-hop schemes by up to 36% in terms of average network lifetime.