The Community for Technology Leaders
Green Image
Issue No. 06 - June (2012 vol. 23)
ISSN: 1045-9219
pp: 1147-1158
Bin Liu , University of Southern California, Los Angeles
Micheal J. Neely , University of Southern California, Los Angeles
Dror Rawitz , Tel-Aviv University, Tel-Aviv
Peter Terlecky , CUNY Graduate Center, New York
Ramesh Govindan , University of Southern California, Los Angeles
Amotz Bar-Noy , Brooklyn College and CUNY Graduate Center, New York
With the advent of smartphone technology, it has become possible to conceive of entirely new classes of applications. Social swarming, in which users armed with smartphones are directed by a central director to report on events in the physical world, has several real-world applications: search and rescue, coordinated fire-fighting, and the DARPA balloon hunt challenge. In this paper, we focus on the following problem: how does the director optimize the selection of reporters to deliver credible corroborating information about an event. We first propose a model, based on common notions of believability, about the credibility of information. We then cast the problem posed above as a discrete optimization problem, prove hardness results, introduce optimal centralized solutions, and design an approximate solution amenable to decentralized implementation whose performance is about 20 percent off, on average, from the optimal (on real-world data sets derived from Google News) while being three orders of magnitude more computationally efficient. More interesting, a time-averaged version of the problem is amenable to a novel stochastic utility optimization formulation, and can be solved optimally, while in some cases yielding decentralized solutions. To our knowledge, we are the first to propose and explore the problem of extracting credible information from a network of smartphones.
Discrete optimization, stochastic optimization, corroboration.
Bin Liu, Micheal J. Neely, Dror Rawitz, Peter Terlecky, Ramesh Govindan, Amotz Bar-Noy, "Optimizing Information Credibility in Social Swarming Applications", IEEE Transactions on Parallel & Distributed Systems, vol. 23, no. , pp. 1147-1158, June 2012, doi:10.1109/TPDS.2011.281
230 ms
(Ver 3.3 (11022016))