2006
DOI: 10.1007/11833529_55
|View full text |Cite
|
Sign up to set email alerts
|

Systolic Query Processing for Aggregation in Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2008
2008
2008
2008

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 14 publications
0
2
0
Order By: Relevance
“…However, the sensor nodes in queried ranges are closed to each other but they can't aggregate the sensed value in a queried range because their query transmission paths are different. As a result, the previous methods waste energy unnecessarily to aggregate sensing data out of the queried range [8][9][10][11][12][13][14][15][16][17][18].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…However, the sensor nodes in queried ranges are closed to each other but they can't aggregate the sensed value in a queried range because their query transmission paths are different. As a result, the previous methods waste energy unnecessarily to aggregate sensing data out of the queried range [8][9][10][11][12][13][14][15][16][17][18].…”
Section: Introductionmentioning
confidence: 99%
“…By using the advantages of these tow kinds of method, the tree index method is studied over the sensor nodes such as DSTree, SRT, SPIX [13][14][15][16][17][18]. These methods construct the MBR(minimum bounded rectangle) based tree to minimize the number of sensor nodes that attended the spatial query.…”
Section: Introductionmentioning
confidence: 99%