2014
DOI: 10.1007/978-3-319-07782-6_61
|View full text |Cite
|
Sign up to set email alerts
|

IDUC: An Improved Distributed Unequal Clustering Protocol for Wireless Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 11 publications
0
2
0
Order By: Relevance
“…The energy consumption is balanced by intracluster communication in EECS and the network lifetime is significantly improved. In IDUC [18], a radius competition scheme is proposed to generate unequal clusters that can balance the energy consumption among CHs in the network with heterogeneous energy. On the other hand, some research works provide mathematical analysis on how to assign the range of clusters in various scenarios [13,19].…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…The energy consumption is balanced by intracluster communication in EECS and the network lifetime is significantly improved. In IDUC [18], a radius competition scheme is proposed to generate unequal clusters that can balance the energy consumption among CHs in the network with heterogeneous energy. On the other hand, some research works provide mathematical analysis on how to assign the range of clusters in various scenarios [13,19].…”
Section: Related Workmentioning
confidence: 99%
“…For the intercluster communication, many dynamic clustering protocols are developed based on the assumption that the CHs can communicate with the BS directly [8,11,17]. On the other hand, some research works have considered the multihops routing among CHs [12,13,18]. For example, HEED [12] uses the greedy routing algorithm for intercluster communication, and EC [13] uses a routing algorithm that considers the load balance among CHs.…”
Section: Related Workmentioning
confidence: 99%