• Title/Summary/Keyword: Stable Election Protocol

Search Result 4, Processing Time 0.019 seconds

Fuzzy Logic Approach to Zone-Based Stable Cluster Head Election Protocol-Enhanced for Wireless Sensor Networks

  • Mary, S.A. Sahaaya Arul;Gnanadurai, Jasmine Beulah
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.4
    • /
    • pp.1692-1711
    • /
    • 2016
  • Energy is a scarce resource in wireless sensor networks (WSNs). A variety of clustering protocols for WSNs, such as the zone-based stable election protocol-enhanced (ZSEP-E), have been developed for energy optimization. The ZSEP-E is a heterogeneous zone-based clustering protocol that focuses on unbalanced energy consumption with parallel formation of clusters in zones and election of cluster heads (CHs). Most ZSEP-E research has assumed probabilistic election of CHs in the zones by considering the maximum residual energy of nodes. However, studies of the diverse CH election parameters are lacking. We investigated the performance of the ZSEP-E in such scenarios using a fuzzy logic approach based on three descriptors, i.e., energy, density, and the distance from the node to the base station. We proposed an efficient ZSEP-E scheme to adapt and elect CHs in zones using fuzzy variables and evaluated its performance for different energy levels in the zones.

Energy Aware Landmark Election and Routing Protocol for Grid-based Wireless Sensor Network (그리드 기반 무선센서네트워크에서 에너지 인지형 Landmark 선정 및 라우팅 프로토콜)

  • Sanwar Hosen, A.S.M.;Cho, Gi-Hwan
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.11a
    • /
    • pp.177-180
    • /
    • 2011
  • In practice, it is well known that geographical and/or location based routing is highly effective for wireless sensor network. Here, electing some landmarks on the network and forwarding data based on the landmark is one of the good approaches for a vast sensing field with holes. In the most previous works, landmarks are elected without considering the residual energy on each sensor. In this paper, we propose an Energy aware Landmark Election and Routing (ELER) protocol to establish a stable routing paths and reduce the total power consumption. The proposed protocol makes use of each sensor's energy level on electing the landmarks, which would be utilized to route a packet towards the target region using greedy forwarding method. Our simulation results illustrate that the proposed scheme can significantly reduce the power dissipation and effectively lengthen the lifetime of the network.

An Improved Zone-Based Routing Protocol for Heterogeneous Wireless Sensor Networks

  • Zhao, Liquan;Chen, Nan
    • Journal of Information Processing Systems
    • /
    • v.13 no.3
    • /
    • pp.500-517
    • /
    • 2017
  • In this paper, an improved zone-based routing protocol for heterogeneous wireless sensor networks is proposed. The proposed protocol has fixed the sized zone according to the distance from the base station and used a dynamic clustering technique for advanced nodes to select a cluster head with maximum residual energy to transmit the data. In addition, we select an optimal route with minimum energy consumption for normal nodes and conserve energy by state transition throughout data transmission. Simulation results indicated that the proposed protocol performed better than the other algorithm by reducing energy consumption and providing a longer network lifetime and better throughput of data packets.

Energy-Aware Self-Stabilizing Distributed Clustering Protocol for Ad Hoc Networks: the case of WSNs

  • Ba, Mandicou;Flauzac, Olivier;Haggar, Bachar Salim;Makhloufi, Rafik;Nolot, Florent;Niang, Ibrahima
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.11
    • /
    • pp.2577-2596
    • /
    • 2013
  • In this paper, we present an Energy-Aware Self-Stabilizing Distributed Clustering protocol based on message-passing model for Ad Hoc networks. The latter does not require any initialization. Starting from an arbitrary configuration, the network converges to a stable state in a finite time. Our contribution is twofold. We firstly give the formal proof that the stabilization is reached after at most n+2 transitions and requires at most $n{\times}log(2n+{\kappa}+3)$ memory space, where n is the number of network nodes and ${\kappa}$ represents the maximum hops number in the clusters. Furthermore, using the OMNeT++ simulator, we perform an evaluation of our approach. Secondly, we propose an adaptation of our solution in the context of Wireless Sensor Networks (WSNs) with energy constraint. We notably show that our protocol can be easily used for constructing clusters according to multiple criteria in the election of cluster-heads, such as nodes' identity, residual energy or degree. We give a comparison under the different election metrics by evaluating their communication cost and energy consumption. Simulation results show that in terms of number of exchanged messages and energy consumption, it is better to use the Highest-ID metric for electing CHs.