scispace - formally typeset
Search or ask a question

SEP: A Stable Election Protocol for clustered heterogeneous wireless sensor networks

TL;DR: This work proposes SEP, a heterogeneous-aware protocol to prolong the time interval before the death of the first node (the authors refer to as stability period), which is crucial for many applications where the feedback from the sensor network must be reliable.
Abstract: We study the impact of heterogeneity of nodes, in terms of their energy, in wireless sensor networks that are hierarchically clustered. In these networks some of the nodes become cluster heads, aggregate the data of their cluster members and transmit it to the sink. We assume that a percentage of the population of sensor nodes is equipped with additional energy resources—this is a source of heterogeneity which may result from the initial setting or as the operation of the network evolves. We also assume that the sensors are randomly (uniformly) distributed and are not mobile, the coordinates of the sink and the dimensions of the sensor field are known. We show that the behavior of such sensor networks becomes very unstable once the first node dies, especially in the presence of node heterogeneity. Classical clustering protocols assume that all the nodes are equipped with the same amount of energy and as a result, they can not take full advantage of the presence of node heterogeneity. We propose SEP, a heterogeneous-aware protocol to prolong the time interval before the death of the first node (we refer to as stability period), which is crucial for many applications where the feedback from the sensor network must be reliable. SEP is based on weighted election probabilities of each node to become cluster head according to the remaining energy in each node. We show by simulation that SEP always prolongs the stability period compared to (and that the average throughput is greater than) the one obtained using current clustering protocols. We conclude by studying the sensitivity of our SEP protocol to heterogeneity parameters capturing energy imbalance in the network. We found that SEP yields longer stability region for higher values of extra energy brought by more powerful nodes.

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI
TL;DR: A new distributed energy-efficient clustering scheme for heterogeneous wireless sensor networks, which is called DEEC, is proposed and evaluated, which achieves longer lifetime and more effective messages than current important clustering protocols in heterogeneous environments.

1,131 citations


Cites background from "SEP: A Stable Election Protocol for..."

  • ...Keywords: Wireless sensor networks; Clustering algorithm; Heterogeneous environment; Energy-efficient...

    [...]

Journal ArticleDOI
TL;DR: The classification initially proposed by Al-Karaki, is expanded, in order to enhance all the proposed papers since 2004 and to better describe which issues/operations in each protocol illustrate/enhance the energy-efficiency issues.
Abstract: The distributed nature and dynamic topology of Wireless Sensor Networks (WSNs) introduces very special requirements in routing protocols that should be met. The most important feature of a routing protocol, in order to be efficient for WSNs, is the energy consumption and the extension of the network's lifetime. During the recent years, many energy efficient routing protocols have been proposed for WSNs. In this paper, energy efficient routing protocols are classified into four main schemes: Network Structure, Communication Model, Topology Based and Reliable Routing. The routing protocols belonging to the first category can be further classified as flat or hierarchical. The routing protocols belonging to the second category can be further classified as Query-based or Coherent and non-coherent-based or Negotiation-based. The routing protocols belonging to the third category can be further classified as Location-based or Mobile Agent-based. The routing protocols belonging to the fourth category can be further classified as QoS-based or Multipath-based. Then, an analytical survey on energy efficient routing protocols for WSNs is provided. In this paper, the classification initially proposed by Al-Karaki, is expanded, in order to enhance all the proposed papers since 2004 and to better describe which issues/operations in each protocol illustrate/enhance the energy-efficiency issues.

1,032 citations

Proceedings ArticleDOI
04 Apr 2005
TL;DR: This work proposes an unequal clustering size (UCS) model for network organization, which can lead to more uniform energy dissipation among the cluster head nodes, thus increasing network lifetime and expands this approach to homogeneous sensor networks.
Abstract: Organizing wireless sensor networks into clusters enables the efficient utilization of the limited energy resources of the deployed sensor nodes However, the problem of unbalanced energy consumption exists, and it is tightly bound to the role and to the location of a particular node in the network If the network is organized into heterogeneous clusters, where some more powerful nodes take on the cluster head role to control network operation, it is important to ensure that energy dissipation of these cluster head nodes is balanced Oftentimes the network is organized into clusters of equal size, but such equal clustering results in an unequal load on the cluster head nodes Instead, we propose an unequal clustering size (UCS) model for network organization, which can lead to more uniform energy dissipation among the cluster head nodes, thus increasing network lifetime Also, we expand this approach to homogeneous sensor networks and show that UCS can lead to more uniform energy dissipation in a homogeneous network as well

566 citations

Journal ArticleDOI
TL;DR: A state-of-the-art and comprehensive survey on clustering approaches in WSNs, which surveys the proposed approaches in the past few years in a classified manner and compares them based on different metrics such as mobility, cluster count, cluster size, and algorithm complexity.

433 citations


Cites methods from "SEP: A Stable Election Protocol for..."

  • ...In SEP an adjustable percentage of the nodes have higher energy than the other nodes....

    [...]

  • ...To elect the CHs, SEP uses a weighted probability method based on remaining energy in the nodes....

    [...]

  • ...As an example, SEP (Smaragdakis et al., 2004) uses LEACH in heterogeneous WSNs. SEP studies the impact of heterogeneity, in terms of energy of the nodes....

    [...]

  • ...The authors show that, compared to LEACH, SEP can increase the stability period of the network....

    [...]

  • ...Stable Election Protocol (SEP): Researchers use LEACH in different aspects....

    [...]

Journal ArticleDOI
TL;DR: This paper provides the taxonomy of various clustering and routing techniques in WSNs based upon metrics such as power management, energy management, network lifetime, optimal cluster head selection, multihop data transmission etc.

430 citations

References
More filters
Journal ArticleDOI
TL;DR: The current state of the art of sensor networks is captured in this article, where solutions are discussed under their related protocol stack layer sections.
Abstract: The advancement in wireless communications and electronics has enabled the development of low-cost sensor networks. The sensor networks can be used for various application areas (e.g., health, military, home). For different application areas, there are different technical issues that researchers are currently resolving. The current state of the art of sensor networks is captured in this article, where solutions are discussed under their related protocol stack layer sections. This article also points out the open research issues and intends to spark new interests and developments in this field.

14,048 citations


"SEP: A Stable Election Protocol for..." refers background in this paper

  • ...Motivation: Wireless Sensor Networks are networks of tiny, battery powered sensor nodes with limited on-board processing, storage and radio capabilities [1]....

    [...]

Proceedings ArticleDOI
04 Jan 2000
TL;DR: The Low-Energy Adaptive Clustering Hierarchy (LEACH) as mentioned in this paper is a clustering-based protocol that utilizes randomized rotation of local cluster based station (cluster-heads) to evenly distribute the energy load among the sensors in the network.
Abstract: Wireless distributed microsensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In this paper, we look at communication protocols, which can have significant impact on the overall energy dissipation of these networks. Based on our findings that the conventional protocols of direct transmission, minimum-transmission-energy, multi-hop routing, and static clustering may not be optimal for sensor networks, we propose LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster based station (cluster-heads) to evenly distribute the energy load among the sensors in the network. LEACH uses localized coordination to enable scalability and robustness for dynamic networks, and incorporates data fusion into the routing protocol to reduce the amount of information that must be transmitted to the base station. Simulations show the LEACH can achieve as much as a factor of 8 reduction in energy dissipation compared with conventional outing protocols. In addition, LEACH is able to distribute energy dissipation evenly throughout the sensors, doubling the useful system lifetime for the networks we simulated.

12,497 citations

01 Jan 2000
TL;DR: LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster based station (cluster-heads) to evenly distribute the energy load among the sensors in the network, is proposed.
Abstract: Wireless distributed microsensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In this paper, we look at communication protocols, which can have signicant impact on the overall energy dissipation of these networks. Based on our ndings that the conventional protocols of direct transmission, minimum-transmission-energy, multihop routing, and static clustering may not be optimal for sensor networks, we propose LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster base stations (cluster-heads) to evenly distribute the energy load among the sensors in the network. LEACH uses localized coordination to enable scalability and robustness for dynamic networks, and incorporates data fusion into the routing protocol to reduce the amount of information that must be transmitted to the base station. Simulations show that LEACH can achieve as much as a factor of 8 reduction in energy dissipation compared with conventional routing protocols. In addition, LEACH is able to distribute energy dissipation evenly throughout the sensors, doubling the useful system lifetime for the networks we simulated.

11,412 citations


"SEP: A Stable Election Protocol for..." refers background or methods in this paper

  • ...Using Direct Transmission (DT), sensor nodes transmit directly to the sink, as a result nodes that are far away from the sink would die first [6]....

    [...]

  • ...In [6], the authors showed that if the clusters are not constructed in an optimal way, the total consumed energy of the sensor network per round is increased exponentially either when the number of clusters that are created is greater or especially when the number of the constructed clusters is less than the optimal number of clusters....

    [...]

  • ...The LEACH (Low Energy Adaptive Clustering Hierarchy) protocol [6] maintains such clustering hierarchy....

    [...]

  • ...In LEACH there is an optimal percentage popt (determined a priori) of nodes that has to become cluster heads in each round assuming uniform distribution of nodes in space [2, 3, 6, 7]....

    [...]

  • ...Previous work have studied either by simulation [6, 7] or analytically [2, 3] the optimal probability of a node being elected as a cluster head as a function of spatial density when nodes are uniformly distributed over the sensor field....

    [...]

Journal ArticleDOI
TL;DR: This work develops and analyzes low-energy adaptive clustering hierarchy (LEACH), a protocol architecture for microsensor networks that combines the ideas of energy-efficient cluster-based routing and media access together with application-specific data aggregation to achieve good performance in terms of system lifetime, latency, and application-perceived quality.
Abstract: Networking together hundreds or thousands of cheap microsensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. These networks require robust wireless communication protocols that are energy efficient and provide low latency. We develop and analyze low-energy adaptive clustering hierarchy (LEACH), a protocol architecture for microsensor networks that combines the ideas of energy-efficient cluster-based routing and media access together with application-specific data aggregation to achieve good performance in terms of system lifetime, latency, and application-perceived quality. LEACH includes a new, distributed cluster formation technique that enables self-organization of large numbers of nodes, algorithms for adapting clusters and rotating cluster head positions to evenly distribute the energy load among all the nodes, and techniques to enable distributed signal processing to save communication resources. Our results show that LEACH can improve system lifetime by an order of magnitude compared with general-purpose multihop approaches.

10,296 citations


"SEP: A Stable Election Protocol for..." refers background or methods in this paper

  • ...In LEACH there is an optimal percentage popt (determined a priori) of nodes that has to become cluster heads in each round assuming uniform distribution of nodes in space [2, 3, 6, 7]....

    [...]

  • ...For the purpose of this study we use similar energy model and analysis as proposed in [7]....

    [...]

  • ...Previous work have studied either by simulation [6, 7] or analytically [2, 3] the optimal probability of a node being elected as a cluster head as a function of spatial density when nodes are uniformly distributed over the sensor field....

    [...]

  • ...A solution proposed in [7], called LEACH, guarantees that the energy load is well distributed by dynamically created clusters, using cluster heads dynamically elected according to a priori optimal probability....

    [...]

Proceedings ArticleDOI
09 Jul 2003
TL;DR: This paper proposes a distributed, randomized clustering algorithm to organize the sensors in a wireless sensor network into clusters, and extends this algorithm to generate a hierarchy of clusterheads and observes that the energy savings increase with the number of levels in the hierarchy.
Abstract: A wireless network consisting of a large number of small sensors with low-power transceivers can be an effective tool for gathering data in a variety of environments. The data collected by each sensor is communicated through the network to a single processing center that uses all reported data to determine characteristics of the environment or detect an event. The communication or message passing process must be designed to conserve the limited energy resources of the sensors. Clustering sensors into groups, so that sensors communicate information only to clusterheads and then the clusterheads communicate the aggregated information to the processing center, may save energy. In this paper, we propose a distributed, randomized clustering algorithm to organize the sensors in a wireless sensor network into clusters. We then extend this algorithm to generate a hierarchy of clusterheads and observe that the energy savings increase with the number of levels in the hierarchy. Results in stochastic geometry are used to derive solutions for the values of parameters of our algorithm that minimize the total energy spent in the network when all sensors report data through the clusterheads to the processing center.

1,935 citations


"SEP: A Stable Election Protocol for..." refers background or methods in this paper

  • ...In LEACH there is an optimal percentage popt (determined a priori) of nodes that has to become cluster heads in each round assuming uniform distribution of nodes in space [2, 3, 6, 7]....

    [...]

  • ...Previous work have studied either by simulation [6, 7] or analytically [2, 3] the optimal probability of a node being elected as a cluster head as a function of spatial density when nodes are uniformly distributed over the sensor field....

    [...]