• Title/Summary/Keyword: cluster heads

Search Result 135, Processing Time 0.027 seconds

Routing Protocol based on Connectivity Degree and Energy Weight (연결도와 에너지 가중치 기반의 라우팅 프로토콜)

  • Jeong, Yoon-Su
    • 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%.

  • PDF

An Energy-Efficient Clustering Algorithm consider Minimum-hop in Hierarchical Sensor Network (계층구조 센서 네트워크에서 Minimun-hop 을 고려한 클러스터 구성 알고리즘)

  • Kim, Yong;Lee, Doo-Wan;Jang, Kyung-Sik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.10a
    • /
    • pp.510-513
    • /
    • 2010
  • In hierarchical wireless sensor network, Sensor nodes forming a cluster with a hierarchy. And there are being study for balanced energy consumption between cluster nodes. When forming network routing path, if there are configured incorrectly then it can be wasting energy. In this paper to solve these problem, We propose that it can consider sensor's communication range to create minimum hop layer when cluster heads configure routing path.

  • PDF

Implementation of a Top-down Clustering Protocol for Wireless Sensor Networks (무선 네트워크를 위한 하향식 클러스터링 프로토콜의 구현)

  • Yun, Phil-Jung;Kim, Sang-Kyung;Kim, Chang-Hwa
    • Journal of Information Technology Services
    • /
    • v.9 no.3
    • /
    • pp.95-106
    • /
    • 2010
  • Many researches have been performed to increase energy-efficiency in wireless sensor networks. One of primary research topics is about clustering protocols, which are adopted to configure sensor networks in the form of hierarchical structures by grouping sensor nodes into a cluster. However, legacy clustering protocols do not propose detailed methods from the perspective of implementation to determine a cluster's boundary and configure a cluster, and to communicate among clusters. Moreover, many of them involve assumptions inappropriate to apply those to a sensor field. In this paper, we have designed and implemented a new T-Clustering (Top-down Clustering) protocol, which takes into considerations a node's density, a distance between cluster heads, and remained energy of a node all together. Our proposal is a sink-node oriented top-down clustering protocol, and can form uniform clusters throughout the network. Further, it provides re-clustering functions according to the state of a network. In order to verify our protocol's feasibility, we have implemented and experimented T-Clustering protocol on Crossbow's MICAz nodes which are executed on TinyOS 2.0.2.

An Improved Coverage Efficient Clustering Method based on Time Delay for Wireless Sensor Networks (무선 센서 네트워크에서 시간지연 기반 향상된 커버리지 효율적인 클러스터링 방안)

  • Gong, Ji;Kim, Kwang-Ho;Go, Kwang-Sub;Cho, Gi-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.2
    • /
    • pp.1-10
    • /
    • 2009
  • Energy efficient operations are essential to increase the life time of wireless sensor network. A cluster-based protocol is the most common approach to preserve energy during a data aggregation. This paper deals with an energy awareness and autonomous clustering method based on time delay. This method consists of three stages. In the first phase, Candidate Cluster Headers(CCHs) are selected based on a time delay which reflects the remaining energy of a node, with considering coverage efficiency of a cluster. Then, time delay is again applied to declare Cluster Headers(CHs) out of the CCHs. In the last phase, the issue on an orphan node which is not included into a cluster is resolved. The simulation results show that the proposed method increases the life time of the network around triple times longer than LEACH(Low Energy Adaptive Cluster Hierarchy). Moreover, the cluster header frequency is less diverse, and the energy on cluster heads is less spent.

An Energy Efficient Variable Area Routing protocol in Wireless Sensor networks (무선 센서 네트워크에서 에너지 효율적인 가변 영역 라우팅 프로토콜)

  • Choi, Dong-Min;Moh, Sang-Man;Chung, Il-Yong
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.8
    • /
    • pp.1082-1092
    • /
    • 2008
  • In wireless sensor networks, clustering protocol such as LEACH is an efficient method to increase whole networks lifetime. However, this protocol result in high energy consumption at the cluster head node. Hence, this protocol must changes the cluster formation and cluster head node in each round to prolong the network lifetime. But this method also causes a high amount of energy consumption during the set-up process of cluster formation. In order to improve energy efficiency, in this paper, we propose a new cluster formation algorithm. In this algorithm, we define a intra cluster as the sensor nodes within close proximity of each other. In a intra cluster, a node senses and transmits data at a time on the round-robin basis. In a view of whole network, intra cluster is treated as one node. During the setup phase of a round, intra clusters are formed first and then they are re-clustered(network cluster) by choosing cluster-heads(intra clusters). In the intra cluster with a cluster-head, every member node plays the role of cluster-head on the round-robin basis. Hence, we can lengthen periodic round by a factor of intra cluster size. Also, in the steady-state phase, a node in each intra cluster senses and transmits data to its cluster-head of network cluster on the round-robin basis. As a result of analysis and comparison, our scheme reduces energy consumption of nodes, and improve the efficiency of communications in sensor networks compared with current clustering methods.

  • PDF

An Efficient Optimization Technique for Node Clustering in VANETs Using Gray Wolf Optimization

  • Khan, Muhammad Fahad;Aadil, Farhan;Maqsood, Muazzam;Khan, Salabat;Bukhari, Bilal Haider
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.9
    • /
    • pp.4228-4247
    • /
    • 2018
  • Many methods have been developed for the vehicles to create clusters in vehicular ad hoc networks (VANETs). Usually, nodes are vehicles in the VANETs, and they are dynamic in nature. Clusters of vehicles are made for making the communication between the network nodes. Cluster Heads (CHs) are selected in each cluster for managing the whole cluster. This CH maintains the communication in the same cluster and with outside the other cluster. The lifetime of the cluster should be longer for increasing the performance of the network. Meanwhile, lesser the CH's in the network also lead to efficient communication in the VANETs. In this paper, a novel algorithm for clustering which is based on the social behavior of Gray Wolf Optimization (GWO) for VANET named as Intelligent Clustering using Gray Wolf Optimization (ICGWO) is proposed. This clustering based algorithm provides the optimized solution for smooth and robust communication in the VANETs. The key parameters of proposed algorithm are grid size, load balance factor (LBF), the speed of the nodes, directions and transmission range. The ICGWO is compared with the well-known meta-heuristics, Multi-Objective Particle Swarm Optimization (MOPSO) and Comprehensive Learning Particle Swarm Optimization (CLPSO) for clustering in VANETs. Experiments are performed by varying the key parameters of the ICGWO, for measuring the effectiveness of the proposed algorithm. These parameters include grid sizes, transmission ranges, and a number of nodes. The effectiveness of the proposed algorithm is evaluated in terms of optimization of number of cluster with respect to transmission range, grid size and number of nodes. ICGWO selects the 10% of the nodes as CHs where as CLPSO and MOPSO selects the 13% and 14% respectively.

An Analysis of Energy Efficient Cluster Ratio for Hierarchical Wireless Sensor Networks (계층적 센서네트워크에서 에너지 효율성을 위한 최적의 클러스터 비율 분석)

  • Jin, Zilong;Kim, Dae-Young;Cho, Jinsung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.6
    • /
    • pp.446-453
    • /
    • 2013
  • Clustering schemes have been adopted as an efficient solution to prolong network lifetime and improve network scalability. In such clustering schemes cluster ratio is represented by the rate of the number of cluster heads and the number of total nodes, and affects the performance of clustering schemes. In this paper, we mathematically analyze an optimal clustering ratio in wireless sensor networks. We consider a multi-hop to one-hop transmission case and aim to provide the optimal cluster ratio to minimize the system hop-count and maximize packet reception ratio between nodes. We examine its performance through a set of simulations. The simulation results show that the proposed optimal cluster ratio effectively reduce transmission count and enhance energy efficiency in wireless sensor networks.

MCRO-ECP: Mutation Chemical Reaction Optimization based Energy Efficient Clustering Protocol for Wireless Sensor Networks

  • Daniel, Ravuri;Rao, Kuda Nageswara
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.7
    • /
    • pp.3494-3510
    • /
    • 2019
  • Wireless sensor networks encounter energy saving as a major issue as the sensor nodes having no rechargeable batteries and also the resources are limited. Clustering of sensors play a pivotal role in energy saving of the deployed sensor nodes. However, in the cluster based wireless sensor network, the cluster heads tend to consume more energy for additional functions such as reception of data, aggregation and transmission of the received data to the base station. So, careful selection of cluster head and formation of cluster plays vital role in energy conservation and enhancement of lifetime of the wireless sensor networks. This study proposes a new mutation chemical reaction optimization (MCRO) which is an algorithm based energy efficient clustering protocol termed as MCRO-ECP, for wireless sensor networks. The proposed protocol is extensively developed with effective methods such as potential energy function and molecular structure encoding for cluster head selection and cluster formation. While developing potential functions for energy conservation, the following parameters are taken into account: neighbor node distance, base station distance, ratio of energy, intra-cluster distance, and CH node degree to make the MCRO-ECP protocol to be potential energy conserver. The proposed protocol is studied extensively and tested elaborately on NS2.35 Simulator under various senarios like varying the number of sensor nodes and CHs. A comparative study between the simulation results derived from the proposed MCRO-ECP protocol and the results of the already existing protocol, shows that MCRO-ECP protocol produces significantly better results in energy conservation, increase network life time, packets received by the BS and the convergence rate.

Location-aware Clustering for Efficient Data Gathering in Wireless Sensor Networks (무선 센서 네트워크에서 효율적인 데이터 수집을 위한 위치 기반의 클러스터링)

  • Chang, Hyeong-Jun;Lee, In-Chul;Park, Gwi-Tae
    • Proceedings of the KIEE Conference
    • /
    • 2008.07a
    • /
    • pp.1893-1894
    • /
    • 2008
  • Advances in hardware and wireless network technologies have placed us at the doorstep of a new era where small wireless devices will provide access to information anytime, anywhere as well as actively participate in creating smart environments. In this paper, we propose location-aware clustering method in wireless sensor networks. Previous clustering algorithm assumes that all nodes know its own location by GPS. But, it is unrealistic because of GPS module cost and large energy consumption. So, we operate localization ahead of cluster set-up phase. And Considering node density and geographic information, Cluster Heads are elected uniformly. Moreover, communication between CHs is prolonged network lifetime.

  • PDF

Simulation for the Efficient Utilization of Energy in Wireless Sensor Network (무선 센서네트워크에서의 효과적인 에너지 활용 시뮬레이션)

  • Baeg, Seung-Beom;Cho, Tae-Ho
    • Journal of the Korea Society for Simulation
    • /
    • v.14 no.3
    • /
    • pp.33-42
    • /
    • 2005
  • One of the imminent problems to be solved within wireless sensor network is to balance out energy dissipation among deployed sensor nodes. In this paper, we present a transmission relay method of communications between BS (Base Station) and CHs (Cluster Heads) for balancing the energy consumption and extending the average lifetime of sensor nodes by the fuzzy logic application. The proposed method is designed based on LEACH protocol. The area deployed by sensor nodes is divided into two groups based on distance from BS to the nodes. RCH (Relay Cluster Head) relays transmissions from CH to BS if the CH is in the area far away from BS in order to reduce the energy consumption. RCH decides whether to relay the transmissions based on the threshold distance value that is obtained as a output of fuzzy logic system, Our simulation result shows that the application of fuzzy logic provides the better balancing of energy depletion and prolonged lifetime of the nodes.

  • PDF