On Exploiting Logical Dependencies for Minimizing Additive Cost Metrics in Resource-Limited Crowdsensing

Shaohan Hu, Shen Li, Shuochao Yao, Lu Su, R. Govindan, Reginald L. Hobbs, T. Abdelzaher
{"title":"On Exploiting Logical Dependencies for Minimizing Additive Cost Metrics in Resource-Limited Crowdsensing","authors":"Shaohan Hu, Shen Li, Shuochao Yao, Lu Su, R. Govindan, Reginald L. Hobbs, T. Abdelzaher","doi":"10.1109/DCOSS.2015.26","DOIUrl":null,"url":null,"abstract":"We develop data retrieval algorithms for crowd-sensing applications that reduce the underlying network bandwidth consumption or any additive cost metric by exploiting logical dependencies among data items, while maintaining the level of service to the client applications. Crowd sensing applications refer to those where local measurements are performed by humans or devices in their possession for subsequent aggregation and sharing purposes. In this paper, we focus on resource-limited crowd sensing, such as disaster response and recovery scenarios. The key challenge in those scenarios is to cope with resource constraints. Unlike the traditional application design, where measurements are sent to a central aggregator, in resource limited scenarios, data will typically reside at the source until requested to prevent needless transmission. Many applications exhibit dependencies among data items. For example, parts of a city might tend to get flooded together because of a correlated low elevation, and some roads might become useless for evacuation if a bridge they lead to fails. Such dependencies can be encoded as logic expressions that obviate retrieval of some data items based on values of others. Our algorithm takes logical data dependencies into consideration such that application queries are answered at the central aggregation node, while network bandwidth usage is minimized. The algorithms consider multiple concurrent queries and accommodate retrieval latency constraints. Simulation results show that our algorithm outperforms several baselines by significant margins, maintaining the level of service perceived by applications in the presence of resource-constraints.","PeriodicalId":332746,"journal":{"name":"2015 International Conference on Distributed Computing in Sensor Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2015-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Distributed Computing in Sensor Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCOSS.2015.26","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

We develop data retrieval algorithms for crowd-sensing applications that reduce the underlying network bandwidth consumption or any additive cost metric by exploiting logical dependencies among data items, while maintaining the level of service to the client applications. Crowd sensing applications refer to those where local measurements are performed by humans or devices in their possession for subsequent aggregation and sharing purposes. In this paper, we focus on resource-limited crowd sensing, such as disaster response and recovery scenarios. The key challenge in those scenarios is to cope with resource constraints. Unlike the traditional application design, where measurements are sent to a central aggregator, in resource limited scenarios, data will typically reside at the source until requested to prevent needless transmission. Many applications exhibit dependencies among data items. For example, parts of a city might tend to get flooded together because of a correlated low elevation, and some roads might become useless for evacuation if a bridge they lead to fails. Such dependencies can be encoded as logic expressions that obviate retrieval of some data items based on values of others. Our algorithm takes logical data dependencies into consideration such that application queries are answered at the central aggregation node, while network bandwidth usage is minimized. The algorithms consider multiple concurrent queries and accommodate retrieval latency constraints. Simulation results show that our algorithm outperforms several baselines by significant margins, maintaining the level of service perceived by applications in the presence of resource-constraints.
资源有限的群体感知中利用逻辑依赖最小化附加成本度量
我们为人群感知应用程序开发数据检索算法,通过利用数据项之间的逻辑依赖关系来减少底层网络带宽消耗或任何附加成本指标,同时保持对客户端应用程序的服务水平。人群传感应用是指那些由人类或他们拥有的设备进行局部测量以进行随后的聚合和共享目的的应用。在本文中,我们关注资源有限的人群感知,如灾难响应和恢复场景。在这些情况下的关键挑战是应对资源限制。与传统的应用程序设计不同,在传统的应用程序设计中,测量值被发送到中央聚合器,而在资源有限的场景中,数据通常驻留在源端,直到被请求为止,以防止不必要的传输。许多应用程序显示数据项之间的依赖关系。例如,一个城市的部分地区可能会因为相关的低海拔而被洪水淹没,如果通往某些道路的桥梁发生故障,这些道路可能无法进行疏散。这种依赖关系可以编码为逻辑表达式,以避免根据其他数据项的值检索某些数据项。我们的算法考虑了逻辑数据依赖性,这样应用程序查询在中心聚合节点得到回答,同时网络带宽使用最小化。该算法考虑多个并发查询,并适应检索延迟约束。仿真结果表明,该算法的性能明显优于几个基线,在存在资源约束的情况下保持应用程序感知的服务水平。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信