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

Near-Optimal Node Clustering in Wireless Sensor Networks for Environment Monitoring

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
33
1

Year Published

2008
2008
2018
2018

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 25 publications
(34 citation statements)
references
References 5 publications
0
33
1
Order By: Relevance
“…However, they did not provide any justification for choosing multihop mode for communication between the sensor nodes and the CHs. It was one of the rare efforts to match the size and shape of clusters to the gathered sensor data: nodes form clusters only if their data were similar and can be aggregated with little or no data loss [14]. In terms of the cluster form, the algorithm adopted a traditional -hop clustering with random cluster sizes due to the requirement of data similarity.…”
Section: Related Workmentioning
confidence: 99%
“…However, they did not provide any justification for choosing multihop mode for communication between the sensor nodes and the CHs. It was one of the rare efforts to match the size and shape of clusters to the gathered sensor data: nodes form clusters only if their data were similar and can be aggregated with little or no data loss [14]. In terms of the cluster form, the algorithm adopted a traditional -hop clustering with random cluster sizes due to the requirement of data similarity.…”
Section: Related Workmentioning
confidence: 99%
“…Some routing protocols organize wireless nodes into clusters, such as Leach (Heinzelman et al, 2000). In (Xia & Vlajic, 2007) the conditions under which such protocols are energy efficient are established and the optimal radius of a cluster is determined. Existing energy efficient routing protocols can be first distinguished by the number of paths maintained to a destination: a single path or multiple paths.…”
Section: Energy Saving Techniques At Routing Layermentioning
confidence: 99%
“…Xia et al in [41], proposed Local Negotiated Clustering Algorithm (LNCA) that tries to minimize the overall energy cost of the network by using the similarity of nodes. Experimental results of the algorithm indicate that 2-hop LNCA outperforms existing LEACH [31] algorithms in terms of energy consumption.…”
Section: Homogeneous Sensor Networkmentioning
confidence: 99%