Power Conserving Computation of OrderStatistics over Sensor传感器的顺序统计量的功率守恒计算.pptVIP

下载本文档

2
0
约8.58千字
约 24页
2017-03-08 发布于上海
举报
版权申诉

Power Conserving Computation of OrderStatistics over Sensor传感器的顺序统计量的功率守恒计算.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Power Conserving Computation of OrderStatistics over Sensor传感器的顺序统计量的功率守恒计算

Power Conserving Computation of Order-Statistics over Sensor Networks Michael B. Greenwald Sanjeev KhannaDept. of Computer Information ScienceUniversity of Pennsylvania Sensor Networks Cheap = plentiful, large scale networks Low power = long life Easily deployed, wireless = hazardous/inaccessible locations Base Station w/connection to outside world = info flows to station we can extract data, Self-configuring = just deploy, and network sets itself up Management Use of Sensor Nets Power Consumption and Network Lifetime Battery replacement is difficult. Network lifetime may be a function of worst-case battery life. Dominant cost is per-byte cost of transmission Minimize worst-case power consumption at any node, maximize network lifetime. Management Use of Sensor Nets Primary operation is data extraction Declarative DB-like interface Issue query, answers stream towards basestation Not necessarily consistent with power concerns COUNT, MIN, MAX easy to optimize: aggregate in network. Example of simple aggregate query: MAX Primary operation is data extraction Aggregate in network Transmit only max observation of all your children O(1) per node. Richer queries: Order-statistics Exact-order-statistic query: ?-quantile(S,?) returns the element with rank r = ? |S| Approximate order statistic query: approx-?-quantile(S,?,?) returns an element with rank r, (1 - ? )? |S| = r = (1 + ? )? |S| Quantile summaries query: quantile-summary(S,?) returns a summary Q, such that ?-quantile(Q,?) returns an element with rank r, (1 - ? )? |S| = r = (1 + ? )? |S| Goals Respond accurately to quantile queries Balance power consumption over network(load on any two nodes differs by at most a poly-log factor) Topology independent Structure solution in a manner amenable to standard optimizations: e.g. non-holistic/decomposable Na?ve approaches Send all |S| to basestation at root If root has few childre, then ?(|S|) cost Sample w/probability 1/(|S|?2) Uniform sampling Los