2008
DOI: 10.1016/j.comcom.2007.10.020
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Load-Balanced Clustering Algorithms for wireless sensor networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
56
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 121 publications
(56 citation statements)
references
References 6 publications
0
56
0
Order By: Relevance
“…Therefore, energy conservation of the gateways is also very crucial for the long operation of the WSNs. Many energy-efficient clustering algorithms Low et al 2008; Bari et al 2008;Gupta and Younis 2003) have been proposed in this regard. However, none of the algorithms have considered routing load of CHs during cluster formation.…”
Section: Introductionmentioning
confidence: 99%
“…Therefore, energy conservation of the gateways is also very crucial for the long operation of the WSNs. Many energy-efficient clustering algorithms Low et al 2008; Bari et al 2008;Gupta and Younis 2003) have been proposed in this regard. However, none of the algorithms have considered routing load of CHs during cluster formation.…”
Section: Introductionmentioning
confidence: 99%
“…Rajan et al in their paper [22] have presented an overview of different bio-inspired population based metaheuristic algorithms for optimization problems in ad hoc networks. In [23], the authors have proposed a breadth-first search tree (BFS) based clustering algorithm for selection of minimal loaded CHs and affiliation of nodes to them. In [24], a Genetic Algorithm (GA) optimization technique has been developed which mimics the Darwinian theory of the survival of the fittest.…”
Section: Related Workmentioning
confidence: 99%
“…Many deterministic and stochastic algorithms have been developed in recent years for such networks [22][23][24][25][26][27][28][29][30][31][32][33][34][35]. All the algorithms based on the gradient method are deterministic as they are hard computing based on a certain mathematical formula that cannot be changed.…”
Section: Related Workmentioning
confidence: 99%
“…Though, we focused on metaheuristic approach as our proposed algorithm is derived from it. In [26], Low et al have designed a clustering method by considering a BFS node tree to discover the slightest loaded head for allocating a node to a CH. The computational complexity of the method is O(mn 2 ) where n nodes with m cluster heads.…”
Section: Related Workmentioning
confidence: 99%
“…In this perspective, lots of researchers have recommended to bring into play of few extraordinary nodes termed as heads, which are furnished with added energy Copyright 漏 2017 MECS I.J. Intelligent Systems and Applications, 2017, 6, 66-74 [23,26,27,31]. These nodes acts like leaders of cluster and are accountable for the similar practicality of the CHs.…”
Section: Introductionmentioning
confidence: 99%