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

Optimizing LEACH clustering algorithm with mobile sink and rendezvous nodes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
65
0
1

Year Published

2015
2015
2023
2023

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 115 publications
(66 citation statements)
references
References 6 publications
0
65
0
1
Order By: Relevance
“…Nevertheless, some additional improvements have already been developed to incorporate the use of data mules in the routing protocols. These developments have been carried out by RPL [6] or LEACH [7].…”
Section: Linked To the Algorithmmentioning
confidence: 99%
“…Nevertheless, some additional improvements have already been developed to incorporate the use of data mules in the routing protocols. These developments have been carried out by RPL [6] or LEACH [7].…”
Section: Linked To the Algorithmmentioning
confidence: 99%
“…Previous studies have demonstrated the effectiveness of RPs on the performance MSs studied the effect of MS movement (like a bus) on a predetermined trajectory and the use of RN for data collection. The MS sends signals called beacons that notify the RNs of the MS arrival [4].…”
Section: Related Workmentioning
confidence: 99%
“…In this approach rendezvous points are made near the trajectory of a mobile sink (MS). A mobile sink (MS) is an alternate way to reduce energy consumption [12]. The use of rendezvous points helps the cluster heads to collect a large volume of data at a time without traveling a long distance which achieves high data bandwidth and low communication delay at the same time and increases the lifetime of the network [13].…”
Section: Introductionmentioning
confidence: 99%