2020
DOI: 10.1049/iet-com.2019.0629
|View full text |Cite
|
Sign up to set email alerts
|

DiCDU: distributed clustering with decreased uncovered nodes for WSNs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(6 citation statements)
references
References 26 publications
0
6
0
Order By: Relevance
“…The position information can be adopted to elect the optimal CH. Besides, the distribution of nodes follows the uniform distribution [25,31]. Besides, the processes of inter-cluster routing construction and data acquisition are beyond the scope of this paper.…”
Section: Related Assumptions and Notationsmentioning
confidence: 99%
See 1 more Smart Citation
“…The position information can be adopted to elect the optimal CH. Besides, the distribution of nodes follows the uniform distribution [25,31]. Besides, the processes of inter-cluster routing construction and data acquisition are beyond the scope of this paper.…”
Section: Related Assumptions and Notationsmentioning
confidence: 99%
“…In fact, most of the problems in WSNs can be formulated into the multiobjective problem, with the aim of taking several factors concurrently [22,23]. Finally, some other clustering mechanisms which belongs to the cross-layer algorithm, such as those combined with the transport layer [24][25][26], the MAC layer [27,28] etc., were also proposed.…”
mentioning
confidence: 99%
“…), and (g) network topology management (like scalability, etc.). While some previous studies support only one objective (eg, References 28,29), huge number of works support various objectives simultaneously (eg, References 25 and 30‐39).…”
Section: Related Workmentioning
confidence: 99%
“…Increasing the efficiency and scalability are the most important benefits of distributed algorithms. The ideas proposed in References 12,15,25,26,28,29,36,41,[54][55][56][57][58][59][60] are formed based on distributed clustering algorithm. Also, ideas proposed in References 13,14 are formed based on centralized clustering algorithm.…”
Section: Clustering Approachesmentioning
confidence: 99%
“…In DiCDU, 23 unclustered nodes are incorporated into existing clusters to decrease the communication distance of unclustered nodes. Member nodes are encouraged to broadcast state messages to inform unclustered nodes about their clusters.…”
Section: Literature Reviewmentioning
confidence: 99%