2009 Canadian Conference on Electrical and Computer Engineering 2009
DOI: 10.1109/ccece.2009.5090148
|View full text |Cite
|
Sign up to set email alerts
|

Cluster head selection using RF signal strength

Abstract: The LEACH algorithm for selecting cluster heads is a probabilistic method which produces clusters with a large variation of link distances and uneven energy consumption during the data transmission phase. To address this issue, a RF signal strength algorithm based on link quality is presented. Using a competitive distributed algorithm, nodes attempt to reduce the overall energy required for transmission in addition to forming favourable clusters based on Received Signal Strength Indication (RSSI) density and q… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
10
0

Year Published

2010
2010
2021
2021

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 22 publications
(11 citation statements)
references
References 19 publications
1
10
0
Order By: Relevance
“…A high number of cluster members would also increase channel contentions amongst nodes within each cluster thus reducing the benefit of clustering. SumRSSI resulted in seven clusters formed in the network at transmission range r from 300 to 350 m, at which point n o is roughly n=2, this is consistent with the expected EOEn o derived in (9). The Dunn index metric [26] attempts to quantify the compactness, favourable distribution and separation of clusters.…”
Section: Clustering Performance With Varying Transmission Range Rsupporting
confidence: 69%
“…A high number of cluster members would also increase channel contentions amongst nodes within each cluster thus reducing the benefit of clustering. SumRSSI resulted in seven clusters formed in the network at transmission range r from 300 to 350 m, at which point n o is roughly n=2, this is consistent with the expected EOEn o derived in (9). The Dunn index metric [26] attempts to quantify the compactness, favourable distribution and separation of clusters.…”
Section: Clustering Performance With Varying Transmission Range Rsupporting
confidence: 69%
“…Hence, the LEACH-C model requires a Global Positioning System (GPS) for this case. In another way, in [10], the selection of the CHs depends upon the node's remaining energy that makes the decision if the normal node becomes CH or not after completion of the first round. E-LEACH is the approach named there, that elects the node having higher energy as the CH and considers the remaining nodes having lesser energy as cluster heads.…”
Section: Related Workmentioning
confidence: 99%
“…The LEACH [5] algorithm for selecting clusterheads is a probabilistic method which produces clusters with a large variation of link distances and uneven energy consumption during the data transmission phase. To address this issue, a distributed algorithm is presented in [6] in which nodes attempt to form favourable clusters based on Received Signal Strength indication (RSSI) density and quality. These papers do not take into account multihop clustering aspects.…”
Section: State Of the Artmentioning
confidence: 99%