Timely Report Delivery in Social Swarming Applications

Bin Liu, Peter Terlecky, Xing Xu, A. Bar-Noy, R. Govindan, Dror Rawitz
{"title":"Timely Report Delivery in Social Swarming Applications","authors":"Bin Liu, Peter Terlecky, Xing Xu, A. Bar-Noy, R. Govindan, Dror Rawitz","doi":"10.1109/DCOSS.2012.8","DOIUrl":null,"url":null,"abstract":"In social swarming applications, participants equipped with 3G and WiFi-capable smart phones are tasked to provide reports (possibly voluminous ones that include full-motion video) about their immediate environment to a central coordinator. In this paper, we consider the problem of timely delivery of these reports: each report has an associated deadline and the goal of the system is to retrieve as many reports as possible (or retrieve the most valuable reports), while satisfying each report's deadline. Reporters can use their cellular interface to upload their reports, but can also ask neighbors (using their faster WiFi interface) to help upload parts of their reports. Under an assumption that WiFi transmission delays are negligible, we first show that there exists a polynomial time optimal solution using an earliest-deadline-first (EDF) strategy for achieving the goals described above. In practice, WiFi delays are not negligible: in this case, it turns out that the scheduling problem is strongly NP-hard. We formulate two heuristic algorithms, and show, through simulations with real-world measurements, that these heuristics perform 2-4× better than without peer-assistance, and within 60% of an upper-bound on the optimal.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"2548 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCOSS.2012.8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In social swarming applications, participants equipped with 3G and WiFi-capable smart phones are tasked to provide reports (possibly voluminous ones that include full-motion video) about their immediate environment to a central coordinator. In this paper, we consider the problem of timely delivery of these reports: each report has an associated deadline and the goal of the system is to retrieve as many reports as possible (or retrieve the most valuable reports), while satisfying each report's deadline. Reporters can use their cellular interface to upload their reports, but can also ask neighbors (using their faster WiFi interface) to help upload parts of their reports. Under an assumption that WiFi transmission delays are negligible, we first show that there exists a polynomial time optimal solution using an earliest-deadline-first (EDF) strategy for achieving the goals described above. In practice, WiFi delays are not negligible: in this case, it turns out that the scheduling problem is strongly NP-hard. We formulate two heuristic algorithms, and show, through simulations with real-world measurements, that these heuristics perform 2-4× better than without peer-assistance, and within 60% of an upper-bound on the optimal.
社会化集群应用中的及时报告交付
在社交集群应用中,配备3G和wifi功能的智能手机的参与者被要求向中央协调器提供关于他们周围环境的报告(可能是大量的报告,包括全动态视频)。在本文中,我们考虑了及时交付这些报告的问题:每个报告都有一个相关的截止日期,系统的目标是在满足每个报告的截止日期的同时检索尽可能多的报告(或检索最有价值的报告)。记者可以使用他们的蜂窝接口上传他们的报告,但也可以要求邻居(使用他们更快的WiFi接口)帮助上传他们报告的一部分。在WiFi传输延迟可以忽略不计的假设下,我们首先证明存在一个多项式时间的最优解,使用最早截止日期优先(EDF)策略来实现上述目标。在实践中,WiFi延迟是不可忽略的:在这种情况下,调度问题是强np困难的。我们制定了两种启发式算法,并通过现实世界测量的模拟显示,这些启发式算法比没有同伴帮助的情况好2-4倍,并且在最优上界的60%以内。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信