Work Items工作的项目.pptVIP

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

Data Management in Mobile Computing Applications Location-based services Ubiquitous Computing Traffic and incident management Environmental monitoring Mobile communication Challenge Traditional and spatial databases cannot handle the rate of location update from moving objects Processing Range-Monitoring Query What is range-monitoring query? Retrieve mobile objects in a spatial region, and continuously monitor the population in the area * * Kien A. Hua School of EECS University of Central Florida Range-Monitoring Queries a Q2 Q1 b c f d e Range-Monitoring Queries a Q2 Q1 b c f d e How to minimize location updates? Each update involves mobile communication costs and server processing costs How to minimize monitoring update cost? Query results keep changing Research Issues Q1 Q5 Q2 Q4 Safe Regions Q3 Circular Safe Region Rectangular Safe Region a Problems with Safe Regions Computing a safe region takes from O(n) to O(n log3 n) Adding a new query requires re-computation of safe regions for all objects How to provide accurate query results, and real-time updates? Challenge Proposed: Monitoring-Query Management Q1 Q2 Q7 Q6 Q3 Q5 Q4 a Resident Domain Given an object’s position P and its processing capability N, its resident domain should Computing a Resident Domain contain position P, and be as large as possible, but contain no more than N queries Domain and Query Decomposition Q1 Q4 Q2 Q3 R1 R42 R21 R31 R22 R41 Domain and Query Decomposition Q1 Q4 Q2 Q3 R1 R42 R21 R31 R22 R41 a Domain and Query Decomposition Q1 Q4 Q2 Q3 R1 R42 R21 R31 R22 R41 a Binary Partitioning Tree (BP-tree) D D domain node data node D d1 d1 d2 d2 Binary Partitioning Tree (BP-tree) d1 d1 d2 d21 d22 d21 d22 D Binary Partitioning Tree (BP-tree) Mobile Communication Cost 0 5 10 15 20 25 30 10 20 30 40 50 60 70 80 90 100 Number of messages sent by mobile objects (millions) Number of monitoring queries (thousands) MQM Safe Region Server Processing Cost 0.1 1 10 100 1000 10 20 30 40 50

文档评论(0)

bokegood + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档