• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.10
• /
• pp.3950-3957
• /
• 2010

Wireless sensor network is composed of sensor node with limited sources, and to maintain and repair is vexatious once made up. Accordingly it is important matter to maximize the network lifetime by minimizing the energy consumption in wireless sensor network, and utilizing the limited sources efficiently. In this paper, I propose a technique arranging the cluster number with efficiency in clustering method to optimize the energy consumption. The energy usage needed for wireless transmission varies in distance(threshold). This technique reduces the energy consumption considering the threshold when arranging the cluster number. I verify that the clustering method organized through the valid processes outperform the LEACH(Low-Energy Adaptive Clustering Hierarchy) in total energy consumption.

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

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

• Convergence Security Journal
• /
• v.16 no.5
• /
• pp.65-71
• /
• 2016

The use of Wireless Sensor Networks in many applications require not only efficient network design but also broad aspects of security, military and health care for hospital. Among many applications of WSNs, target tracking is an essential research area in WSNs. We need to track a target quickly as well as find the lost target in WSNs. In this paper, we propose an efficient target tracking method. We also propose an efficient clustering method and algorithm for target tracking.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1B
• /
• pp.10-15
• /
• 2009

Recently, there are tendency that wireless sensor network is one of the important techniques for the future IT industry and thereby application areas in it are getting growing. Researches based on the hierarchical network topology are evaluated in good at energy efficiency in related protocols for wireless sensor network. LEACH is the best well known routing protocol for the hierarchical topology. However, there are problems in the range of message broadcasting, which should be expand into the overall network coverage, in LEACH related protocols. Thereby, this paper proposes a new clustering scheme to solve the co-shared problems in them. The basic idea of our scheme is using the inherent memory restrictions in sensor nodes. The results show that the proposed scheme could support the load balancing by distributing the clusters with a reasonable number of member nodes and thereby the network life time would be extended in about 1.8 times longer than LEACH.

• Journal of IKEEE
• /
• v.27 no.4
• /
• pp.679-682
• /
• 2023

In wireless sensor networks, communication failure between sensor nodes causes continuous connection attempts, which results in a large power loss. In this paper, an appropriate distance between the CH(Cluster Head) node and the communicating sensor nodes is limited so that a group of clusters of appropriate size is formed on a two-dimensional plane. To equalize the cluster size, sensor nodes in the shortest distance communicate with each other to form member nodes, and clusters are formed by gathering nearby nodes. Based on the proposed cluster uniformity algorithm, the improvement rate of cluster uniformity is shown by simulation results. The proposed method can improve the cluster uniformity of the network by about 30%.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.12
• /
• pp.4991-4996
• /
• 2010

Clustering method in wireless sensor network is the technique that forms the cluster to aggregate the data and transmit them at the same time that they can use the energy efficiently. Even though cluster group model is based on clustering, it differs from previous method that reducing the total energy consumption by separating energy overload to cluster group head and cluster head. In this thesis, I calculate the optimal cluster group number and cluster number in this kind of cluster group model according to threshold of energy consumption model. By using that I can minimize the total energy consumption in sensor network and maximize the network lifetime. I also show that proposed cluster group model is better than previous clustering method at the point of network energy efficiency.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.79-86
• /
• 2009

In this paper, we propose a new clustering scheme that provides optimal data aggregation effect and reduces energy consumption of nodes by considering the density of nodes when forming clusters. Since the size of the cluster is determined to ensure optimal data aggregation rate, our scheme reduces transmission range and minimizes interference between clusters. Moreover, by clustering using locally adjacent nodes and aggregating data received from cluster members, we reduce energy consumption of nodes. Through simulation, we confirmed that energy consumption of the whole network is minimized and the sensor network life-time is extended. Moreover, we show that the proposed clustering scheme improves the performance of network compared to previous LEACH clustering scheme.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.10-12
• /
• 2004

무선 센서네트워크는 센싱 지역에 분산되어 있는 초소형 센서 노드들이 감지/처리한 데이터를 수집노드로 전송하여 원격의 사용자가 센싱 지역의 상황인지를 가능하게 하는 유비쿼터스 컹퓨팅의 기반 네트워크이다. 전력 사용이 극히 제한된 센서 노드를 이용하여 무선 센서 망을 구성, 유지하며 데이터를 수집하기 위해서는 효율적인 망의 형태와 이에 따른 네트워크 배치 전략을 필요로 한다. 클러스터 기반 네트워크의 형태는 밀집도가 높은 센서네트워크에서 데이터병합을 수행하고 노드간 에너지 소비 균형을 이루기 위한 효과적인 구조이다. 본 논문에서는 클러스터 기반의 단일 홉 전송 구조에서 데이터 수집률을 높이고 노드간 에너지 사용의 균형을 이루게 하여 네트워크의 생존시간을 최대화할 수 있는 네트워크 배치 방법을 제안하였다. 클러스터링 기법에 따른 에너지 소비 모델을 분석하고 이를 통해 노드의 적절한 밀집도를 산출하였다. 싱크로부터 멀어질수록, 센서필드의 중앙보다는 외곽에 노드의 배치를 조밀하게 배치하여 네트워크의 생존시간을 늘렸다. 시뮬레이션을 통해 효율적인 네트워크의 배치가 노드간 에너지 소비의 균형을 이루도록 하여 네트워크의 생존시간을 늘일 수 있음을 확인하였다.

• Journal of Korea Society of Industrial Information Systems
• /
• v.17 no.4
• /
• pp.41-50
• /
• 2012

Network life time is very important issue for wireless sensor network(WSN). It is very important to design sensor networks for sensors to utilize their energies in effective ways. A-PEGASIS that basically bases on PEGASIS and enhances in two aspects-an elegant chain generation algorithm and periodical update of chains. However, it has problems in the chain generation mechanism and some possibility of network partitioning or sensing hole problem in the network, in LEACH related protocols. This dissertation proposes a new clustering protocol to solve the co-shared problems in the previous protocols. The basic idea of our scheme is using the table for node connectivity. The results show that the network life time would be extended in about 1.8 times longer than LEACH and 1.5 times longer than PEGASIS-A.