• Journal of Digital Convergence
• /
• v.10 no.1
• /
• pp.371-378
• /
• 2012

Through sensor nodes it can obtain behavior, condition, location of objects. Generally speaking, sensor nodes are very limited because they have a battery power supply. Therefore, for collecting sensor data, efficient energy management is necessary in order to prolong the entire network survival. In this paper, we propose a method that increases energy efficiency to be self-configuring by distributed sensor nodes per cluster. The proposed method is based on the ANTCLUST. After measuring the similarity between two objects it is method that determine own cluster. It applies a colonial closure model of ant. The result of an experiment, it showed that the number of alive nodes increased 27% than existing clustering methods.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.12
• /
• pp.247-255
• /
• 2011

Most existing clustering protocols have been aimed to provide balancing the residual energy of each node and maximizing life-time of wireless sensor networks. In this paper, we present the adaptive clustering strategy related to sink position for clustering protocols in wireless sensor networks. This protocol allows networks topology to be adaptive to the change of the sink position by using symmetrical clustering strategy that restricts the growth of clusters based on depth of the tree. In addition, it also guarantees each cluster the equal life-time, which may be extended compared with the existing clustering protocols. We evaluated the performance of our clustering scheme comparing to LEACH and EEUC, and observe that our protocol is observed to outperform existing protocols in terms of energy consumption and longevity of the network.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.942-948
• /
• 2016

WSN based on wireless sensor nodes, Sensor nodes can not be reassigned and recharged if they once placed. Each sensor node comes into being involved to a communication network with its limited energy. But the existing proposed clustering techniques, being applied to WSN environment with irregular dispersion of sensor nodes, have the network reliability issues which bring about a communication interruption with the local node feature of unbalanced distribution in WSN. Therefore, the communications participation of the sensor nodes in the suggested algorithm is extended by 25% as the sensor field divided in the light of the non-uniformed distribution of sensor nodes and a static or a dynamic clustering algorithm adopted according to its partition of sensor node density in WSN. And the entire network life cycle was extended by 14% to ensure the reliability of the network.

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

무선 센서 네트워크는 센서들을 무선으로 연결하여 데이터 교환을 통해 다양한 환경에서 정보를 수집할 수 있도록 하는 유용한 도구이다. 센서노드 간의 통신은 센서노드의 제한된 에너지를 효율적으로 이용하도록 만들어져야만 한다. 클러스터링에 기반한 계층적 라우팅 기법은 클러스터 내의 노드들은 클러스터헤드와만 통신을 하게하고 클러스터헤드가 한꺼번에 싱크에게 통합된 정보를 보내게 하여 에너지를 절약하는 기법이다. 본 연구에서는 이러한 클러스터링 기반의 라우팅에서 에너지 효율을 높이기 위해 싱크와 클러스터헤드 사이의 거리에 따른 최적 클러스터 크기를 계산하고, 원형의 전체 토폴로지에서 계산된 값과 일치됨을 확인해 보았다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.12
• /
• pp.409-414
• /
• 2015

The energy conservation is the most important subject for long run operation of the sensor nodes with limited power resources. Clustering is one of most energy efficient technique to grouped the sensor nodes into distinct cluster. But, in a cluster based WSN, CHs and gateways bear an extra work load to send the processed data to the sink. The inappropriate cluster formation may cause gateways overloaded and may increase latency in communication. In this paper, we propose a novel load balanced clustering model for improving energy efficiency and giving a guarantee of long network lifetime. We show the result of performance measurement experiments that designs using a branch and bound algorithm and a multi-start local search algorithm to compare with the existing load balanced clustering model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.5B
• /
• pp.253-259
• /
• 2008

Because a sensor node in wireless sensor networks is battery operated and energy constrained, reducing energy consumption of each node is one of important issues. The clustering technique can make network topology be hierarchical and reduce energy consumption of each sensor node. In this paper, we propose an efficient clustering mechanism considering overlap avoidance in wireless sensor networks. The proposed method consists of three parts. The first is to elect cluster heads considering each node's energy. Then clusters are formed by using signal strength in the second phase. Finally we can reduce the cluster overlap problem derived from two or more clusters. In addition, this paper includes performance evaluation of our algorithm. Simulation results show that network lifetime was extended up to 75 percents than LEACH and overlapped clusters are decreased down to nearly zero percents.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.4
• /
• pp.2370-2375
• /
• 2014

Wireless sensor networks (WSNs) have a big potential for distributed sensing for large geographical area. The improvement of the lifetime of WSNs is the important research topic because it is considered to be difficult to change batteries of sensor nodes. Clustering communication protocols are energy-efficient because each sensor node can send its packet to the cluster head near from itself rather than the sink far from itself. In this paper, we present an energy-efficient clustering communication protocol, which chooses cluster heads based on the expected residual lifetime of each sensor node. Simulation results show that our proposed scheme increases average lifetimes of sensor nodes as much as 20% to 30% in terms of the traffic quantity and as much as 30% to 40% in terms of the scalability compared to the existing clustering communication protocol, LEACH.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.612-615
• /
• 2012

Energy efficiency in wireless sensor network is a principal issue because wireless sensor network uses limited energy. In wireless sensor network, because nodes are placed randomly, they may be concentrated in certain area. This dense area causes shortening the life of the concentrated area, and furthermore reducing the life of the entire network. In this paper, we suggest a additional cluster head selection algorithm for reducing the overload of head node in dense area and shows simulation result using our algorithm with LEACH algorithm.

• The KIPS Transactions:PartC
• /
• v.17C no.1
• /
• pp.69-80
• /
• 2010

Wireless sensor networks (WSN) consisting of a large number of sensors aim to gather data in a variety of environments and are being used and applied to many different fields. The sensor nodes composing a sensor network operate on battery of limited power and as a result, high energy efficiency and long network lifetime are major goals of research in the WSN. In this paper we propose a novel tree-based clustering approach for energy efficient wireless sensor networks. The proposed scheme forms the cluster and the nodes in a cluster construct a tree with the root of the cluster-head., The height of the tree is the distance of the member nodes to the cluster-head. Computer simulation shows that the proposed scheme enhances energy efficiency and balances the energy consumption among the nodes, and thus significantly extends the network lifetime compared to the existing schemes such as LEACH, PEGASIS, and TREEPSI.

• The KIPS Transactions:PartC
• /
• v.14C no.6
• /
• pp.519-524
• /
• 2007

One of the most important issues on the sensor network with resource limited sensor nodes is prolonging the network lifetime by effectively utilizing the limited node energy. The most representative mechanism to achieve a long lived sensor network is the clustering mechanism which can be further classified into the single hop mode and the multi hop mode. The single hop mode requires that all sensor nodes in a cluster communicate directly with the cluster head(CH) via single hop md, in the multi hop mode, sensor nodes communicate with the CH with the help of other Intermediate nodes. One of the most critical factors that impact on the performance of the existing multi hop clustering mechanism is the cluster size and, without the assumption on the uniform node distribution, finding out the best cluster size is intractable. Since sensor nodes in a real sensor network are distributed non uniformly, the fixed size mechanism may not work best for real sensor networks. Therefore, in this paper, we propose a new dynamic size multi hop clustering mechanism in which the cluster size is determined according to the distance from the sink to relieve the traffic passing through the CHs near the sink. We show that our proposed scheme outperforms the existing fixed size clustering mechanisms by carrying out numerical analysis and simulations.