Checkpoint-based Fault-tolerance for LEACH Protocol

International audienceMost routing protocols designed for wireless sensor networks provide good results in ideal environments. However, their performance degrades dramatically when nodes stop working for various causes such as loss of energy, crushed by animal or climatic conditions. In this paper, we highlight the weaknesses of LEACH (Low Energy Adaptive Clustering Hierarchy) protocol by evaluating its performance. Then we propose an improved version of this protocol based on checkpoint approach that allows it to become a fault-tolerant protocol. Finally, several simulations were conducted to illustrate the benefits of our contribution

Improvement of LEACH for fault tolerance in sensor networks

International audienceIn wireless sensor networks, failures occur due to energy depletion, environmental hazards, hardware failure, communication link errors, etc. These failures could prevent them to accomplish their tasks. Moreover, most routing protocols are designed for ideal environment such as LEACH. Hence, if nodes fail the performance of these protocols degrade. In this context, we propose two improved versions of LEACH so that it becomes a fault-tolerant protocol. In the first version, we propose a clustered architecture for LEACH in which there are two cluster-heads in each cluster: one is primary (CHp) and the other is secondary (CHs). In the second version, we propose to use the checkpoint technique. Finally, we conducted several simulations to illustrate the performance our contribution and compared obtained results to LEACH protocol in a realistic environment

Cluster-based Energy-efficient k-Coverage for Wireless Sensor Networks

International audienc

An Enhanced Fault-tolerant Version of LEACH for Wireless Sensor Networks

International audienceIn wireless sensor networks (WSN), routing protocols have been designed to balance energy and prolong network lifetime such as LEACH. However, the occurrence of failures could degrade them of their performance. In this paper, we propose an improved version of LEACH so it becomes a faulttolerant protocol. Moreover, we suggest a multihop routing scheme from cluster-heads to the base station to conserve energy and in the same time create a backup path between cluster-heads that provides a better resilience to various failures in WSN. We conducted several simulations to illustrate the performance of our contribution in realistic environments. Simulation results have shown that our contribution greatly enhances the original version of LEACH in terms of energy consumption and network lifetime

An Efficient Cluster-based Self-organization Algorithm for Wireless Sensor Networks

International audienceThe paper proposes an Efficient Cluster-based Self-organisation Algorithm (ECSA) for partitioning Wireless Sensor Networks (WSNs) into clusters, thus giving at the network a hierarchical organisation. Each sensor uses its weight based on its k-density and its residual energy to elect a cluster-head in its 2-hop neighbourhood. ECSA operates without a centralised controller, and does not require that the location of sensors be known. Firstly, we estimate the number of clusters formed with ECSA according to transmission range, then we evaluate the amount of packets sent to the sink per energy dissipation by using the same model presented by Heinzelman et al. (2002), and the number of nodes alive per number of packets received at the sink. Simulation results illustrate that ECSA can evenly distribute energy consumption of sensors and consequently maximise network lifetime when compared to LEACH and LEACH-C

An Efficient Cluster-based Self-organization Algorithm for Wireless Sensor Networks

International audienceThe paper proposes an Efficient Cluster-based Self-organisation Algorithm (ECSA) for partitioning Wireless Sensor Networks (WSNs) into clusters, thus giving at the network a hierarchical organisation. Each sensor uses its weight based on its k-density and its residual energy to elect a cluster-head in its 2-hop neighbourhood. ECSA operates without a centralised controller, and does not require that the location of sensors be known. Firstly, we estimate the number of clusters formed with ECSA according to transmission range, then we evaluate the amount of packets sent to the sink per energy dissipation by using the same model presented by Heinzelman et al. (2002), and the number of nodes alive per number of packets received at the sink. Simulation results illustrate that ECSA can evenly distribute energy consumption of sensors and consequently maximise network lifetime when compared to LEACH and LEACH-C

Design and Verification of a Self-organisation Algorithm for Sensor Networks

International audienceFor ad hoc networks, clustering is the organization method that groups the nodes into clusters managed by nodes called cluster-heads. This hierarchical organization allows an effective way of improving performance, security, fault tolerance and scalability of the platform. In this paper, we introduce a new approach to self-organize an ad hoc network, and define communication protocols so that to optimize communication in the routing. We implement a hierarchy structure to the ad hoc network, that is: many clusters with one leader per group, and a coordinator for the whole network. In order to optimize the communication process, decent metrics are chosen in group formation and in leader election. To illustrate the performance of our algorithm, we verify it using model checking; we simulate it and compare its performance with a geographical-based algorithm

An Energy Aware MPR-based Broadcasting Algorithms for Wireless Sensor

International audienceBroadcasting in wireless sensor networks (WSN) is to disseminate packets of data from a node to all nodes in the network. Since wireless communications consume great amounts of sensor's energy, many algorithms and methods were introduced to minimize the cost of broadcasting such as MPR (Multipoint Relay) and DS-MPR (Dominated connecting Set with MPR). In this paper, we introduce first, a slight modification of MPR, by involving the remaining energy of sensors in the selection of relay nodes. We call our algorithm MPR remaining Energy (MPRE). Then, we focus on DS-MPR which also involves the remaining energy of nodes in the selection of relay nodes, so we modify it to become applicable in a realistic environment. We call our second algorithm Realistic environment with DS-MPR÷(RDS-MPR). We illustrate that our algorithm increases the lifetime of nodes, compared to MPR and pure flooding, due to their cooperative way to choose the relay sensors and their balancing of relaying nodes

A version of LEACH Adapted to the Lognormal Shadowing Model

Part 12: Security and Network Technologies: Wireless Sensor NetworksInternational audienceThe most protocols designed for wireless sensor networks (WSNs) have been developed for an ideal environment represented by unit disc graph model (UDG) in which the data is considered as successfully received if the communicating nodes are within the transmission range of each other. However, these protocols do not take into account the fluctuations of radio signal that can happen in realistic environment. This paper aims to adapt LEACH protocol for realistic environment since LEACH is considered as the best cluster-based routing protocol in terms of energy consumption for WSNs. We have carried out an evaluation of LEACH based on two models; lognormal shadowing model (LNS) in which the probability of reception without error is calculated according to the Euclidian distance separating the communicating nodes and probabilistic model in which the probability of reception is generated randomly. In both models, if the probability of successful reception is lower than a predefined threshold, a multi-hop communication is incorporated for forwarding data between cluster-heads (CHs) towards the base station instead of direct communication as in original version of LEACH. The main aims of this contribution are minimizing energy consumption and guaranteeing reliable data delivery to the base station. The simulation results show that our proposed algorithm outperforms the original LEACH for both models in terms of energy consumption and ratio of successful received packets