2015
DOI: 10.1016/j.compeleceng.2014.07.019
|View full text |Cite
|
Sign up to set email alerts
|

Energy efficient fault tolerant clustering and routing algorithms for wireless sensor networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
81
0
1

Year Published

2015
2015
2019
2019

Publication Types

Select...
7
1
1

Relationship

1
8

Authors

Journals

citations
Cited by 147 publications
(85 citation statements)
references
References 21 publications
1
81
0
1
Order By: Relevance
“…Optimal positioning of relay nodes in a WiFi network (our setting) has been studied e.g., in [32,3,2]. We note however that [32] does not address fault-tolerant positioning, and [3,2] focuses on energy saving fault tolerant routing of hierarchical networks.…”
Section: State Of the Artmentioning
confidence: 99%
See 1 more Smart Citation
“…Optimal positioning of relay nodes in a WiFi network (our setting) has been studied e.g., in [32,3,2]. We note however that [32] does not address fault-tolerant positioning, and [3,2] focuses on energy saving fault tolerant routing of hierarchical networks.…”
Section: State Of the Artmentioning
confidence: 99%
“…We note however that [32] does not address fault-tolerant positioning, and [3,2] focuses on energy saving fault tolerant routing of hierarchical networks.…”
Section: State Of the Artmentioning
confidence: 99%
“…However, it suffers from the connectivity problem of CHs. Kuila et al [13] have proposed a cost-based distributed energy balanced clustering and routing algorithm for CH selection and cluster formation. But, the algorithm suffers from the connectivity problem of the selected CHs.…”
mentioning
confidence: 99%
“…parameterbased clustering algorithm, the communication load of the CHs is incorporated with respect to the base station (BS). An energy-efficient fault-tolerant clustering and routing algorithm has been proposed in [10], in which distributed run-time recovery of the nodes is used to handle sudden failure of the CHs. The proposed clustering algorithm runs on every node simultaneously.…”
Section: Related Workmentioning
confidence: 99%