• Title/Summary/Keyword: Cluster Head

Search Result 430, Processing Time 0.031 seconds

An Hybrid Clustering Using Meta-Data Scheme in Ubiquitous Sensor Network (유비쿼터스 센서 네트워크에서 메타 데이터 구조를 이용한 하이브리드 클러스터링)

  • Nam, Do-Hyun;Min, Hong-Ki
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.9 no.4
    • /
    • pp.313-320
    • /
    • 2008
  • The dynamic clustering technique has some problems regarding energy consumption. In the cluster configuration aspect the cluster structure must be modified every time the head nodes are re-selected resulting in high energy consumption. Also, there is excessive energy consumption when a cluster head node receives identical data from adjacent cluster sources nodes. This paper proposes a solution to the problems described above from the energy efficiency perspective. The round-robin cluster header(RRCH) technique, which fixes the initially structured cluster and sequentially selects duster head nodes, is suggested for solving the energy consumption problem regarding repetitive cluster construction. Furthermore, the issue of redundant data occurring at the cluster head node is dealt with by broadcasting metadata of the initially received data to prevent reception by a sensor node with identical data. A simulation experiment was performed to verify the validity of the proposed approach. The results of the simulation experiments were compared with the performances of two of the must widely used conventional techniques, the LEACH(Low Energy Adaptive Clustering Hierarchy) and HEED(Hybrid, Energy Efficient Distributed Clustering) algorithms, based on energy consumption, remaining energy for each node and uniform distribution. The evaluation confirmed that in terms of energy consumption, the technique proposed in this paper was 29.3% and 21.2% more efficient than LEACH and HEED, respectively.

  • PDF

A Study on Cluster Head Selection and a Cluster Formation Plan to Prolong the Lifetime of a Wireless Sensor Network

  • Ko, Sung-Won;Cho, Jeong-Hwan
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.29 no.7
    • /
    • pp.62-70
    • /
    • 2015
  • The energy of a sensor in a Wireless Sensor Network (WSN) puts a limit on the lifetime of the network. To prolong the lifetime, a clustering plan is used. Clustering technology gets its energy efficiency through reducing the number of communication occurrences between the sensors and the base station (BS). In the distributed clustering protocol, LEACH-like (Low Energy Adaptive Clustering Hierarchy - like), the number of sensor's cluster head (CH) roles is different depending on the sensor's residual energy, which prolongs the time at which half of nodes die (HNA) and network lifetime. The position of the CH in each cluster tends to be at the center of the side close to BS, which forces cluster members to consume more energy to send data to the CH. In this paper, a protocol, pseudo-LEACH, is proposed, in which a cluster with a CH placed at the center of the cluster is formed. The scheme used allows the network to consume less energy. As a result, the timing of the HNA is extended and the stable network period increases at about 10% as shown by the simulation using MATLAB.

Algorithm Improving Network Life-time Based on LEACH Protocol (LEACH 프로토콜 기반 망 수명 개선 알고리즘)

  • Choo, Young-Yeol;Choi, Han-Jo;Kwon, Jang-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.8A
    • /
    • pp.810-819
    • /
    • 2010
  • This paper proposes an algorithm to improve total network lifetime for Wireless Sensor Network (WSN) application such as environmental condition monitoring systems based on LEACH protocol. Firstly, the algorithm had equal number of nodes allocated to each cluster at cluster set-up phase where it abided by LEACH protocol. Secondly, at cluster set-up phase, each node was determined the order to be cluster header of the cluster which it had joined. After then, the role of a cluster head delivers to the next node according to determined order when the cluster head has received certain number of packets. With above method energy consumption of each node made equal and overall network lifetime was increased. Simulation results shows that overall network lifetime of proposed algorithm was increased two times than that of LEACH and total energy consumption was one forth of that of LEACH protocol.

A Cluster-based Routing Protocol with Energy Consumption Balance in Distributed Wireless Sensor Networks (분산 무선센서 네트워크의 클러스터-기반 에너지 소비 균형 라우팅 프로토콜)

  • Kim, Tae-Hyo;Ju, Yeon-Jeong;Oh, Ho-Suck;Kim, Min-Kyu;Jung, Yong-Bae
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.15 no.4
    • /
    • pp.155-161
    • /
    • 2014
  • In this paper, a cluster-based routing protocol in distributed sensor network is proposed, which enable the balanced energy consumption in the sensor nodes densely deployed in the sensor fields. This routing protocol is implemented based on clusters with hierarchical scheme. The clusters are formed by the closely located sensor nodes. A cluster node with maximum residual energy in the cluster, can be selected as cluster head node. In routing, one of the nodes in the intersection area between two clusters is selected as a relay-node and this method can extend the lifetime of all the sensor nodes in view of the balanced consumption of communication energy.

A Study on Energy Efficient Self-Organized Clustering for Wireless Sensor Networks (무선 센서 네트워크의 자기 조직화된 클러스터의 에너지 최적화 구성에 관한 연구)

  • Lee, Kyu-Hong;Lee, Hee-Sang
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.37 no.3
    • /
    • pp.180-190
    • /
    • 2011
  • Efficient energy consumption is a critical factor for deployment and operation of wireless sensor networks (WSNs). To achieve energy efficiency there have been several hierarchical routing protocols that organize sensors into clusters where one sensor is a cluster-head to forward messages received from its cluster-member sensors to the base station of the WSN. In this paper, we propose a self-organized clustering method for cluster-head selection and cluster based routing for a WSN. To select cluster-heads and organize clustermembers for each cluster, every sensor uses only local information and simple decision mechanisms which are aimed at configuring a self-organized system. By these self-organized interactions among sensors and selforganized selection of cluster-heads, the suggested method can form clusters for a WSN and decide routing paths energy efficiently. We compare our clustering method with a clustering method that is a well known routing protocol for the WSNs. In our computational experiments, we show that the energy consumptions and the lifetimes of our method are better than those of the compared method. The experiments also shows that the suggested method demonstrate properly some self-organized properties such as robustness and adaptability against uncertainty for WSN's.

A Cluster Head Selection Algorithm Adopting Sensor Density on Wireless Sensor Networks (무선 센서 네트워크상에서 센서간의 밀도를 고려한 클러스터 헤드 선정 알고리즘)

  • Jung, Eui-Hyun;Lee, Sung-Ho;Park, Yong-Jin;Hwang, Ho-Young;Hur, Moon-Haeng
    • The KIPS Transactions:PartC
    • /
    • v.13C no.6 s.109
    • /
    • pp.741-748
    • /
    • 2006
  • Due to the continuous development of sensor technology, Wireless Sensor Networks are rapidly growing and are expected to be applied to various applications. One of the most important factors in Wireless Sensor Networks is energy-efficient management of network resources. For this purpose, a lot of researches have been ongoing in the development of energy-efficient routing protocol. In this paper, a cluster head selection algorithm considering node density in addition to the cluster head selection algorithm of LEACH-C is proposed and simulated. This algorithm gives nearly the same computational speed compared to that of LEACH-C and shows improvement of network lifetime about 11% better than LEACH-C. The simulation result shows that consideration of density as well as distance between nodes in cluster head selection can be more energy-efficient than considering only the distance between nodes as LEACH-C in energy usage of Wireless Sensor Networks.

Communication coverage-aware cluster head election algorithm for Hierarchical Wireless Sensor Networks (계층형 무선센서 네트워크에서 통신영역을 고려한 클러스터 헤드 선출 알고리즘)

  • Lee, Doo-Wan;Kim, Yong;Jang, Kyung-Sik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.10a
    • /
    • pp.527-530
    • /
    • 2010
  • WSN is composed of a lot of small sensors with the limited hardware resources. In WSN, at the initial stage, sensor nodes are randomly deployed over the region of interest, and self-configure the clustered networks by grouping a bunch of sensor nodes and selecting a cluster header among them. Specially, in WSN environment, in which the administrator's intervention is restricted, the self-configuration capability is essential to establish a power-conservative WSN which provides broad sensing coverage and communication coverage. In this paper, we propose a communication coverage-aware cluster head election algorithm for Herearchical WSNs which consists of communication coverage-aware of the Base station is the cluster head node is elected and a clustering.

  • PDF

Optimal LEACH Protocol with Improved Bat Algorithm in Wireless Sensor Networks

  • Cai, Xingjuan;Sun, Youqiang;Cui, Zhihua;Zhang, Wensheng;Chen, Jinjun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.5
    • /
    • pp.2469-2490
    • /
    • 2019
  • A low-energy adaptive clustering hierarchy (LEACH) protocol is a low-power adaptive cluster routing protocol which was proposed by MIT's Chandrakasan for sensor networks. In the LEACH protocol, the selection mode of cluster-head nodes is a random selection of cycles, which may result in uneven distribution of nodal energy and reduce the lifetime of the entire network. Hence, we propose a new selection method to enhance the lifetime of network, in this selection function, the energy consumed between nodes in the clusters and the power consumed by the transfer between the cluster head and the base station are considered at the same time. Meanwhile, the improved FTBA algorithm integrating the curve strategy is proposed to enhance local and global search capabilities. Then we combine the improved BA with LEACH, and use the intelligent algorithm to select the cluster head. Experiment results show that the improved BA has stronger optimization ability than other optimization algorithms, which the method we proposed (FTBA-TC-LEACH) is superior than the LEACH and LEACH with standard BA (SBA-LEACH). The FTBA-TC-LEACH can obviously reduce network energy consumption and enhance the lifetime of wireless sensor networks (WSNs).

A cluster head replacement based on threshold in the Internet of Things (사물인터넷에서 임계치 기반의 클러스터 헤드 교체 기법)

  • Kim, Jeong-Won
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.9 no.11
    • /
    • pp.1241-1248
    • /
    • 2014
  • An efficient battery usage of sensor nodes is main goal in a sensor network, which is the substructure of Internet of Things. Maximizing the battery usage of sensor nodes makes the lifetime of sensor network increase as well as the reliability of the network improved. The previous solutions to solve these problems are mainly focused on the cluster head selection based on the remaining energy. In this paper, we consider both the head selection and the replacement interval which is determined by a threshold that is based on the remaining energy, density of alive nodes, and location. Our simulation results show that the proposed scheme has outstanding contribution in terms of maximizing the life time of the network and balancing energy consumption of all nodes.

A weight-based cluster head replacement algorithm in the Internet of Things (사물인터넷에서 가중치 기반 클러스터 헤드 교체 알고리즘)

  • Kim, Jeong-Won
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.11
    • /
    • pp.91-96
    • /
    • 2014
  • Since the sensors of Internet of Things (IOT) collect various data, the lifetime of sensor network is very important and the data should be aggregated efficiently. The contiguous collection by the certain sensors occurs an excessive battery consumption and successive transmission of same value of data should be avoided. To solve these things, we propose an weight-based cluster head replacement method that divides whole network into several grids and cluster head is selected by remaining energy, density of alive sensors and location of sensor. The aim of algorithm maximizes the lifetime of network. Our simulation results shows that the proposed method is very simple as well as balances energy consumption.