2013
DOI: 10.1007/978-3-642-38865-1_12
|View full text |Cite
|
Sign up to set email alerts
|

Simulation Comparison of LEACH-Based Routing Protocols for Wireless Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(2 citation statements)
references
References 14 publications
0
2
0
Order By: Relevance
“…A number of LEACH variants are proposed which tend to provide better results, which provided different concepts on chain-based procedure [8], deterministic CH selection [7], centralized [23], distributed [23], semi-distributed [15], heterogeneous networks [17] or homogeneous networks, mobility, security [17], cluster radius fixation [18] and many more.…”
Section: Related Workmentioning
confidence: 99%
“…A number of LEACH variants are proposed which tend to provide better results, which provided different concepts on chain-based procedure [8], deterministic CH selection [7], centralized [23], distributed [23], semi-distributed [15], heterogeneous networks [17] or homogeneous networks, mobility, security [17], cluster radius fixation [18] and many more.…”
Section: Related Workmentioning
confidence: 99%
“…All the nodes present in the network gets a chance in their life time to become the cluster head, thereby increasing the lifetime of the network [7].The sensor nodes are usually inexpensive and small, containing different types of sensors, processors and memory units. The routing protocols should adapt to the changing topology thereby finding an optimal route especially in a case, if sensor nodes stop working in a long run [8].…”
Section: Introductionmentioning
confidence: 99%