TY - GEN
T1 - Timely report delivery in social swarming applications
AU - Liu, Bin
AU - Terlecky, Peter
AU - Xu, Xing
AU - Bar-Noy, Amotz
AU - Govindan, Ramesh
AU - Rawitz, Dror
PY - 2012
Y1 - 2012
N2 - 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-4x better than without peer-assistance, and within 60% of an upper-bound on the optimal.
AB - 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-4x better than without peer-assistance, and within 60% of an upper-bound on the optimal.
UR - http://www.scopus.com/inward/record.url?scp=84864210808&partnerID=8YFLogxK
U2 - 10.1109/dcoss.2012.8
DO - 10.1109/dcoss.2012.8
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84864210808
SN - 9780769547077
T3 - Proceedings - IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2012
SP - 75
EP - 82
BT - Proceedings - IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2012
T2 - 8th IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2012
Y2 - 16 May 2012 through 18 May 2012
ER -