• Aucun résultat trouvé

Load balancing and lifetime maximization in WSN

N/A
N/A
Protected

Academic year: 2021

Partager "Load balancing and lifetime maximization in WSN"

Copied!
2
0
0

Texte intégral

(1)

HAL Id: hal-00952467

https://hal.archives-ouvertes.fr/hal-00952467v3

Submitted on 25 Mar 2014

HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci- entific research documents, whether they are pub- lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Load balancing and lifetime maximization in WSN

Riadh Dhaou, Rahim Kacimi, André-Luc Beylot

To cite this version:

Riadh Dhaou, Rahim Kacimi, André-Luc Beylot. Load balancing and lifetime maximization in WSN.

2011. �hal-00952467v3�

(2)

Load balancing and lifetime maximization in WSN

Riadh Dhaou, Rahim Kacimi and André-Luc Beylot IRIT-ENSEEIHT, Toulouse, France

Abstract—Strategies that balance the energy consumption of the nodes and ensure maximum network lifetime by balancing the load are proposed and analyzed. Multiple transmission power levels are used. We studied an optimal solution for calculating the hop-by-hop traffic proportions for the particular case of nodes having just two transmission power levels, and compared the results given by the heuristics with those from the optimal analytical case.

I. INTRODUCTION

The lifetime of Wireless Sensor Networks (WSN) is crucial. Network lifetime is the time span from the deployment to the instant when the network is considered non functional.

This however is application-specific. It can be, for example, the instant when the first sensor dies, a percentage of sensor die, the network partitions or the loss of coverage occurs [1].

Although different definitions of lifetime exist in the literature [1-2], a sensor network that has a specifically defined grid topology, as we considered in our research, certainly has to be considered "dead" whenever it is no longer able to forward data to the BS. We analyze and propose strategies that balance the energy consumption of the nodes and ensure maximum network lifetime by balancing the load. The research was developed in the framework of the “CAPTEURS” project. The aim of the project was to design a solution [3][4][5] for monitoring the temperature on the whole cold chain, from the warehouses to the retailer, and being aware of the fact that minimizing energy consumption is a key goal in many multi- hop wireless networking systems, especially when the nodes of the network are battery powered. Nodes are uniformly and stationary deployed. In order to achieve an extension in lifetime of the network, two transmission power levels (TPL) are used.

II. LOAD-BALANCING STRATEGIES FOR LIFETIME

MAXIMIZATION IN WSN

Equal-Probability Heuristic: This heuristic is the less complex one. Whenever a packet arrives to a node and it should be forwarded through the network with the BS (Fig. 1) as the final destination, the node chooses randomly, with equal probability, the neighbour to send the message to.

Shortest-Path Heuristic: This method chooses the shortest path, or shares the load between the shortest paths to the BS, when the node has several. In the context of energy balancing the shortest-paths are the paths that have the lowest cost in terms of energy consumption.

Contribution-Based Heuristic: Here it is proposed a heuristic which attempts to improve the load balancing and increase the network lifetime by distributing contributions from the BS to the network, depending on the number of neighbours and corresponding power level.

Figure 1. WSN with a grid topology and Sink in the corner. Sensors near the Sink will die faster than the other ones.

III. SIMULATION RESULTS

Simulation results are compared to analytical results [4].

Figure 2. Maximum energy consumption (BS in the corner of a 10x10 grid)

The simulation supposed that each node from a 10x10 grid, initially had a total energy of 30000 units, and the network lifetime is expressed by the number of packets that are sent from the critical node before it dies. The chart from Fig. 2 shows us that the contribution-based heuristic is the most close to the optimal and it is superior to the other two strategies. The equal-probability strategy overcomes the shortest-path in the case in which BS is in the corner.

IV. CONCLUSION

When the TPL increases there is a visible critical load decrease. Indeed, it is more convenient for the overall power consumption for the nodes to send as far as they can towards the BS to maximize the lifetime of the network.

R E F E R E N C E S

[1] J. Champ, C. Saad, A. E. Baert, "Lifetime in WSN", Int. Conference on Complex, Intelligent and Software Intensive Systems, 2009

[2] Y. Chen, Q. Zhao, "On the Lifetime of Wireless Sensor Networks", Communications Letters, IEEE, 2005

[3] R. Kacimi, R. Dhaou, A.-L. Beylot, “Energy-aware self-organization algorithms for WSN”. IEEE GLOBECOM 2008, december 2008 [4] R. Kacimi, R. Dhaou, A.-L. Beylot, “Using Energy-efficient wireless

sensor network for cold chain monitoring”. IEEE CCNC 2009, Jan. 2009 [5] R. Kacimi, R. Dhaou, A.L. Beylot, “Load-balancing Strategies for

Lifetime Maximizing in wireless sensor networks”, IEEE ICC 2010, may 2010.

Références

Documents relatifs

ORBIT achieves good performance in terms of the link utilization and demand acceptance ratio in comparison with the optimal and offline solutions, especially when the network load

Using differential equations, we develop a mathematical model describing the evo- lution of the number of packets on each route that is induced by our load balancer. As we describe

This paper proposes a new balancing circuit control strategy that considers cell voltage, temperature and aging dispersion in order to maximize the lifespan of the whole

As limit points of a dynamic correspond to stationary points, from this theorem, we can conclude that the dynamics (9), and hence the learning algorithm when b goes to 0, will

This paper presents SHELL, a stateless application-aware load-balancer combining (i) a power-of-choices scheme using IPv6 Segment Routing to dispatch new flows to a suitable

Then, we present an experimental evaluation and a performance comparison of these partitioning algorithms and cost-estimation policies on a large scale parallel

In applications with structured communication, each task communicates more with a subgroup of tasks, such that mapping these sub- groups to PUs nearby in the hierarchy can

As in the case of a single class, we deduce from Theorem 2 that there exists an optimal admissible load balancing which is simple, for both the overall blocking probability and