2010
DOI: 10.1587/elex.7.1112
|View full text |Cite
|
Sign up to set email alerts
|

EBDHR: Energy Balancing and Dynamic Hierarchical Routing algorithm for wireless sensor networks

Abstract: Abstract:Due to energy resources constraint in wireless sensor networks, balancing energy consumption is very important in increasing the network life time. In this paper, the new hierarchical and dynamic routing algorithm is proposed to balance energy consumption among the nodes and to prevent from energy holing problem. Simulation results show that the proposed algorithm prolongs the network lifetime about 40% compared to the LEACH protocol.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2010
2010
2021
2021

Publication Types

Select...
4
2
2

Relationship

1
7

Authors

Journals

citations
Cited by 16 publications
(5 citation statements)
references
References 12 publications
0
5
0
Order By: Relevance
“…The DEEC algorithm considers the remaining energy of nodes when selecting CHs, preventing the quick deaths of low-energy nodes because they serve as CHs for a long time. Since then, many scholars [ 10 , 11 , 12 , 13 , 14 , 15 ] have proposed various methods entailing WSNs, such as SEP, PEGASIS, and HEED, to save energy and handle greater workloads; these methods extend the lives of sensor nodes and achieve the best operating efficiency in an environment with limited energy. In addition, some researchers [ 16 , 17 , 18 ] have surveyed and compared the aforementioned methods.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The DEEC algorithm considers the remaining energy of nodes when selecting CHs, preventing the quick deaths of low-energy nodes because they serve as CHs for a long time. Since then, many scholars [ 10 , 11 , 12 , 13 , 14 , 15 ] have proposed various methods entailing WSNs, such as SEP, PEGASIS, and HEED, to save energy and handle greater workloads; these methods extend the lives of sensor nodes and achieve the best operating efficiency in an environment with limited energy. In addition, some researchers [ 16 , 17 , 18 ] have surveyed and compared the aforementioned methods.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Where k x − x i is the distance between nodes x and x i , A x − x i is the attenuation for the distance the signal travels, and α(α ∈ [2,5] ) is the path loss exponent.…”
Section: Cluster Formation Based On Cluster Member Boundsmentioning
confidence: 99%
“…In order to obtain an objective scalability of network, gathering sensor nodes into clusters has been greatly pursued by the research community [1,2]. Each cluster would have a head, in many cases referred to the clusterhead (CH).…”
Section: Introductionmentioning
confidence: 99%
“…In cluster formation phase, the all nodes calculate the confidence value of primary cluster heads that are on their radio transmission range by (7) [10]. Then they join to the primary cluster head that its confidence value is greater than other.…”
Section: Cat Protocolmentioning
confidence: 99%
“…One of the techniques that use the data aggregation to reduce energy consumption in WSNs is called clustering based routing algorithm [1][2][3][4]. In [5][6][7][8][9][10] there are protocols that use the clustering technique in the network.…”
Section: Introductionmentioning
confidence: 99%