Powered by OpenAIRE graph
Found an issue? Give us feedback
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

A new energy efficient routing algorithm based on load balancing for wireless sensor networks

Authors: Mehdi Rangchi; Hamidreza Bakhshi;

A new energy efficient routing algorithm based on load balancing for wireless sensor networks

Abstract

Many research topics in recent years have focused on clustering algorithms as a scalable routing protocol in wireless sensor networks. In these algorithms, by the use of data aggregation techniques and reduction in sensors that should make long distance communications, energy consumption in total network lifetime is decreased. One of algorithms proposed in this field is DECSA. Aiming at the problem of sensors limited energy, this algorithm is an improvement based on the classic clustering algorithm LEACH. By taking into consideration nodes distance from each other and residual energy of nodes, DECSA algorithm tries to select proper nodes as CH. Also, in this algorithm by the aim to produce a multi-level clustering hierarchy and based on CH's distance to base station, some CHs are selected as base station CHs. In this paper, based on DECSA, a load balanced clustering algorithm is proposed. This algorithm incorporates two thresholds in DECSA in terms of supporting minimum and maximum acceptable load. Thus, when cluster load in one frame is smaller than the minimum threshold, cluster's frame is expanded and when it is bigger than maximum threshold, a fraction of cluster's load in each frame is transferred to a 2nd CH node.

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    2
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
2
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!