2008 International Conference on Convergence and Hybrid Information Technology 2008
DOI: 10.1109/ichit.2008.247
|View full text |Cite
|
Sign up to set email alerts
|

Fast Data Aggregation Algorithm for Minimum Delay in Clustered Ubiquitous Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2012
2012
2016
2016

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 8 publications
0
2
0
Order By: Relevance
“…This is performed by comparing the Received Signal Strength (RSS) from all neighboring CHs. The non-CH node finds the minimum hop distance (HDmin) [25] between itself and its corresponding CH with the help of received power (pr) from the CH and transmission range of the sensor nodes (nt).…”
Section: Cluster Formationmentioning
confidence: 99%
“…This is performed by comparing the Received Signal Strength (RSS) from all neighboring CHs. The non-CH node finds the minimum hop distance (HDmin) [25] between itself and its corresponding CH with the help of received power (pr) from the CH and transmission range of the sensor nodes (nt).…”
Section: Cluster Formationmentioning
confidence: 99%
“…The authors of [20] proposed an optimal link scheduling algorithm, a zone based approach, to minimize the aggregation time by given variable length of time slots for all links in the zone-based fast data aggregation tree (ZFDAT) where clock synchronization is required. Clock synchronization is not an easy task in a remotely deployed WSN.…”
Section: Introductionmentioning
confidence: 99%