• Title/Summary/Keyword: Cluster Head Replacement

Search Result 8, Processing Time 0.023 seconds

The Threshold Based Cluster Head Replacement Strategy in Sensor Network Environment (센서 네트워크 환경의 임계값 기반 클러스터 헤드 지연 교체 전략)

  • Kook, Joong-Jin;Ahn, Jae-Hoon;Hong, Ji-Man
    • Journal of Internet Computing and Services
    • /
    • v.10 no.3
    • /
    • pp.61-69
    • /
    • 2009
  • 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 threshold based cluster head replacement strategy for clustering protocols in wireless sensor networks. This protocol minimizes the number of cluster head selection by preventing the cluster head replacement up to the threshold of residual energy. Reducing the amount of head selection and replacement cost, the life-time of the entire networks can be extended compared with the existing clustering protocols. Our simulation results show that our protocol outperformed than LEACH in terms of balancing energy consumption and network life-time.

  • PDF

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.

An Energy-Efficient Clustering Using Division of Cluster in Wireless Sensor Network (무선 센서 네트워크에서 클러스터의 분할을 이용한 에너지 효율적 클러스터링)

  • Kim, Jong-Ki;Kim, Yoeng-Won
    • Journal of Internet Computing and Services
    • /
    • v.9 no.4
    • /
    • pp.43-50
    • /
    • 2008
  • Various studies are being conducted to achieve efficient routing and reduce energy consumption in wireless sensor networks where energy replacement is difficult. Among routing mechanisms, the clustering technique has been known to be most efficient. The clustering technique consists of the elements of cluster construction and data transmission. The elements that construct a cluster are repeated in regular intervals in order to equalize energy consumption among sensor nodes in the cluster. The algorithms for selecting a cluster head node and arranging cluster member nodes optimized for the cluster head node are complex and requires high energy consumption. Furthermore, energy consumption for the data transmission elements is proportional to $d^2$ and $d^4$ around the crossover region. This paper proposes a means of reducing energy consumption by increasing the efficiency of the cluster construction elements that are regularly repeated in the cluster technique. The proposed approach maintains the number of sensor nodes in a cluster at a constant level by equally partitioning the region where nodes with density considerations will be allocated in cluster construction, and reduces energy consumption by selecting head nodes near the center of the cluster. It was confirmed through simulation experiments that the proposed approach consumes less energy than the LEACH algorithm.

  • PDF

A Cluster Based Energy Efficient Tree Routing Protocol in Wireless Sensor Networks (광역 WSN 을 위한 클러스팅 트리 라우팅 프로토콜)

  • Nurhayati, Nurhayati;Choi, Sung-Hee;Lee, Kyung-Oh
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.04a
    • /
    • pp.576-579
    • /
    • 2011
  • Wireless sensor network are widely all over different fields. Because of its distinguished characteristics, we must take account of the factor of energy consumed when designing routing protocol. Wireless sensor networks consist of small battery powered devices with limited energy resources. Once deployed, the small sensor nodes are usually inaccessible to the user, and thus replacement of the energy source is not feasible. Hence, energy efficiency is a key design issue that needs to be enhanced in order to improve the life span of the network. In BCDCP, all sensors sends data from the CH (Cluster Head) and then to the BS (Base Station). BCDCP works well in a smallscale network however is not preferred in a large scale network since it uses much energy for long distance wireless communication. TBRP can be used for large scale network, but it weakness lies on the fact that the nodedry out of energy easily since it uses multi-hops transmission data to the Base Station. Here, we proposed a routing protocol. A Cluster Based Energy Efficient Tree Routing Protocol (CETRP) in Wireless Sensor Networks (WSNs) to prolong network life time through the balanced energy consumption. CETRP selects Cluster Head of cluster tree shape and uses maximum two hops data transmission to the Cluster Head in every level. We show CETRP outperforms BCDCP and TBRP with several experiments.

Clustering Triangular Routing Protocol in Wireless Sensor Network (무선 센서 네트워크에서 삼각 클러스터링 라우팅 기법)

  • Nurhayati, Nurhayati;Lee, Kyung Oh;Choi, Sung Hee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.11a
    • /
    • pp.913-916
    • /
    • 2010
  • Wireless sensor networks consist of small battery powered devices with limited energy resources. Once deployed, the small sensor nodes are usually inaccessible to the user, and thus replacement of the energy source is not feasible. Hence, energy efficiency is a key design issue that needs to be enhanced in order to improve the life span of the network. In BCDCP, all sensors send data from CH (Cluster Head) and then to BS (Base Station). BCDCP works well in small-scale network but in large scale network it is not appropriated since it uses much energy for long distance wireless communication. We propose a routing protocol - Triangular Clustering Routing Protocol (TCRP) - to prolong network life time through the balanced energy consumption. TCRP selects cluster head of triangular shape. The sensor field is divided into energy level and in every level we choose one node as a gate node. This gate node collects data and sends it to the leader node. Finally the leader node sends the aggregated data to the BS. We show TCRP outperforms BCDCP with several experiments.

A Clustered Directed Diffusion Routing Protocol for Wireless Sensor Network (무선센서 네트워크에서 클러스터화된 디렉티드 디퓨젼 라우팅 프로토콜)

  • Zhao, Bin;Lee, Kyung-Oh
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.2
    • /
    • pp.165-172
    • /
    • 2011
  • Wireless sensor networks consist of small battery powered devices with limited energy resources. Once deployed, the small sensor nodes are usually inaccessible to the user, and thus replacement of the energy source is not feasible. Hence, energy efficiency is a key design issue that needs to be enhanced in order to improve the life span of the network. Directed Diffusion is a well known routing protocol. In this paper we adopt the clustering mechanism to improve the efficiency of Directed Diffusion. We introduce C-Directed Diffusion which make clusters, select the CH(Cluster Head) and CHs do the same process as in Directed Diffusion. C-Directed Diffusion is pretty simple and show better performance than Directed Diffusion.

An energy-efficient technique for mobile-wireless-sensor-network-based IoT

  • Singla, Jatin;Mahajan, Rita;Bagai, Deepak
    • ETRI Journal
    • /
    • v.44 no.3
    • /
    • pp.389-399
    • /
    • 2022
  • Wireless sensor networks (WSNs) are one of the basic building blocks of Internet of Things (IoT) systems. However, the wireless sensing nodes in WSNs suffer from energy constraint issues because the replacement/recharging of the batteries of the nodes tends to be difficult. Furthermore, a number of realistic IoT scenarios, such as habitat and battlefield monitoring, contain mobile sensing elements, which makes the energy issues more critical. This research paper focuses on realistic WSN scenarios that involve mobile sensing elements with the aim of mitigating the attendant energy constraint issues using the concept of radio-frequency (RF) energy extraction. The proposed technique incorporates a cluster head election workflow for WSNs that includes mobile sensing elements capable of RF energy harvesting. The extensive simulation analysis demonstrated the higher efficacy of the proposed technique compared with the existing techniques in terms of residual energy, number of functional nodes, and network lifetime, with approximately 50% of the nodes found to be functional at the 4000th, 5000th, and 6000th rounds for the proposed technique with initial energies of 0.25, 0.5 and 1 J, respectively.