2009
DOI: 10.1631/jzus.a0820765
|View full text |Cite
|
Sign up to set email alerts
|

Optimized algorithm for balancing clusters in wireless sensor networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2010
2010
2017
2017

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 7 publications
(7 citation statements)
references
References 17 publications
0
7
0
Order By: Relevance
“…In Figure 1, the network lifetime of the proposed approach was compared to that of the previous three algorithms, LEACH [21], MESH [10], and OABC [24]. (Alluding to Section 1, the network lifetime designates the time until every node in the network was alive.)…”
Section: Methodsmentioning
confidence: 99%
See 3 more Smart Citations
“…In Figure 1, the network lifetime of the proposed approach was compared to that of the previous three algorithms, LEACH [21], MESH [10], and OABC [24]. (Alluding to Section 1, the network lifetime designates the time until every node in the network was alive.)…”
Section: Methodsmentioning
confidence: 99%
“…The existing approaches based on the random rotation model form a new cluster whenever a message transfer finishes at the base station [10, 13, 17, 21, 23, 24, 26]. However, unnecessary changes in cluster formation make balanced control more difficult because even nodes with a low energy level can be selected as the CH.…”
Section: An Enhanced Load Balancing Clustering Algorithmmentioning
confidence: 99%
See 2 more Smart Citations
“…One is disjoint multipath routing, where the alternative paths do not intersect with each other [11]. The LEACH algorithm is currently the most widely used algorithm for sensor network clustering [12]. In order to equalize energy consumption, the algorithm uses the random rotation method for electing the CH.…”
Section: Introductionmentioning
confidence: 99%