Medians and Beyond: New Aggregation Techniques for Sensor Networks. CS851 Seminar Presentation. Outline. Motivations, State of Art, Contributions The Q-Digest Scheme Queries on Q-Digest Experimental Evaluation Conclusions Be prepared! I have questions for you!. Motivations.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Medians and Beyond: New Aggregation Techniques for Sensor Networks
CS851 Seminar Presentation
Be prepared! I have questions for you!
How about merging Q1(n1,k1) and Q2(n2,K2)?
What dos it mean 3K?
The root node does not satisfy property (2).??
3K means 3K
What about the leaf node, which does not satisfy property (1)?
It doesn’t matter, because a leaf node is not the ancestor of any node.
(maximum weight of any path from root to leaf in Q)/n
1 1 5 7 3 3 3 3
(maximum weight of any path from root to leaf in Q)/n = 7/15
= 3 * log8 / 3K = 3*3/3*5 = 9/15
back to base station; no